Blair Dowling SullivanOak Ridge National Laboratory
Computer Science & Mathematics Division
P.O. Box 2008 MS6015
Oak Ridge, TN 37831-6015
Phone: 865 241 0250
CV: Available as pdf (updated April 2013)
Research interests include algorithm design, high performance graph analysis, parallel computing, combinatorial scientific computing, and graph theory. Recent work focuses on integrating tools and techniques from structural graph theory into tools for scalable network analysis.
Organizer, Research Cluster, ICERM Semester Program on Network Science and Graph Algorithms, Spring 2014
Organizing Committee, SIAM Workshop on Combinatorial Scientific Computing (CSC14), July 2014
Center for Nonlinear Studies (CNLS) Colloquium, Los Alamos National Laboratory, May 13, 2013
Third Workshop on Parallel Computing and Optimization (PCO13), with IEEE IPDPS 2013, Boston, MA, May 21-24, 2013
26th Cumberland Conference on Combinatorics, Graph Theory \& Computing, Murfreesboro, TN, May 24-26, 2013
SAMSI Workshop on Social Network Data: Collection and Analysis, October 21-13, 2013
B. D. Sullivan, D. Weerapurage, and C. Groer. Parallel Algorithms for Graph Optimization using Tree Decompositions. PCO'13 (accepted). Also available as ORNL-TM/2012/194.
C. Klymko, B. D. Sullivan, and T. Humble. Adiabatic Quantum Programming: Minor Embedding with Hard Faults. (submitted). ArXiv pre-print.
C. Groer, B. D. Sullivan, and D. Weerapurage. INDDGO: Integrated Network Decompositions & Dynamic programming for Graph Optimization. (submitted). Also available as ORNL-TM/2012/176.
B. D. Sullivan. On a Conjecture of Andrica and Tomescu. Journal of Integer Sequences, 16, 2013. Available here.
C. Groer, B. D. Sullivan, and S. Poole. A Mathematical Analysis of the R-MAT Random Graph Generator. Networks, 58(3):159–170, 2011. Journal version here.
B. D. Sullivan, C. Groer, and S. Poole. Computational Analysis of Two Graph Compression Algorithms. Technical Report ORNL/TM-2009/193, Oak Ridge National Laboratory, 2009.
P. Seymour and B. D. Sullivan. Counting Paths in Digraphs. European Journal of Combinatorics, 31(3):961–975, 2010. Available here.
M. Chudnovsky, P. Seymour, and B. D. Sullivan. Cycles in Dense Digraphs. Combinatorica, 28(1):1– 18, 2008. Available here.
M. Nathanson and B. D. Sullivan. Heights in Finite Projective Space, and a Problem on Directed Graphs. Integers, 8(A13), 2008. Available here
B. D. Sullivan. A Summary of Problems and Results related to the Caccetta-Haggkvist Conjecture. Technical Report 2006-13, American Institute of Mathematics, 2006. Available here.
Integrated Network Decompositions and Dynamic Programming for Graph Optimization: INDDGO.
SPARTN: Sparse Projections Achieving Randomization in Tree-like Networks. Principal Investigator (PI). DARPA GRAPHS Program, 2012-2013.
Connecting Combinatorial and Geometric Tree-Like Structure in Complex Networks. Principal Investigator (PI). ORNL Laboratory Directed Research and Development program (LDRD) SEED Fund, 2011-2012.
Scalable Graph Decomposition and Algorithms to Support the Analysis of Petascale Data. Principal Investigator. U.S. Dept. of Energy (DOE) Office of Advanced Scientific Computing Research (ASCR), 2009-2011.
Extreme Scale Systems Center. Co-PI for Graph Theory and Applied Mathematics, U.S. Dept. of Defense (DoD), 2008-2013.
Department of Homeland Security Dissertation Grant (2006-2007)
Department of Homeland Security Graduate Fellowship (2003-2006)
Phi Kappa Phi Scholarship Cup, Georgia Tech senior with most outstanding academic record (2003)
Georgia Tech President’s Scholar, full tuition & stipend support (1999-2003); Jo Baker Scholar (2003)
Massachusetts Institute of Technology (MIT) Combinatorics Seminar, Cambridge, MA (Apr. 2013)
Industrial Engineering Seminar, University of Tennessee, Knoxville, TN (Apr. 2013)
Computational Science and Engineering Colloquium, Georgia Tech, Atlanta, GA (Oct. 2012)
Mathematics Seminar, sponsored by SIAM Student Chapter, Emory University, Atlanta, GA (Oct. 2012)
Applied Math and Analysis Seminar, Duke University (Oct. 2012).
Applied Mathematics Colloquium, University of North Carolina at Chapel Hill (Sept. 2012).
ICIS Workshop: Graph and Hypergraph Problems in Computational Science, Park City, UT (July 2012).
Workshop on Massive Modern Data Sets, MMDS 2012, Palo Alto, CA (July 2012).
Duke Applied Mathematics Seminar, Durham, NC (Apr. 2012).
Dagstuhl Seminar - Bidimensional Structures: Algorithms, Combinatorics and Logic, Dagstuhl, Germany, March 17-22, 2013
Organizer for mini-symposium "Treewidth: Connecting Fixed-Parameter Tractability, Graphical Models, and Sparse Linear Algebra" (MS167/MS209) at SIAM Computational Science and Engineering (CSE13), February 2013.
Co-Organizer for minisymposium "Anomaly Detection Methods and Applications" at SIAM Southeastern Atlantic Section Annual Meeting (SEAS), March 2013
Ph.D. Mathematics, Princeton University (2008), advisor: Paul D. Seymour.
M.A. Mathematics, Princeton University (2005)
B.S. Applied Mathematics, Georgia Tech (2003)
B.S. Computer Science, Georgia Tech (2003)