Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDBlair D. Sullivan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j12]Pål Grønås Drange
, Markus Fanebust Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the threshold of intractability. J. Comput. Syst. Sci. 124: 1-25 (2022)- [i28]Andrew Fraser, Brian Lavallee, Blair D. Sullivan:
Gerrymandering Trees: Parameterized Hardness. CoRR abs/2205.06857 (2022) - [i27]Shweta Jain, Yosuke Mizutani, Blair D. Sullivan:
Faster Decomposition of Weighted Graphs into Cliques using Fisher's Inequality. CoRR abs/2206.07286 (2022) - 2021
- [j11]Jeremy Kun, Michael P. O'Brien, Marcin Pilipczuk, Blair D. Sullivan:
Polynomial Treedepth Bounds in Linear Colorings. Algorithmica 83(1): 361-386 (2021) - [j10]Timothy D. Goodrich, Eric Horton, Blair D. Sullivan:
An Updated Experimental Evaluation of Graph Bipartization Methods. ACM J. Exp. Algorithmics 26: 12:1-12:24 (2021) - [c17]Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan:
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. ACDA 2021: 111-122 - [e1]Michael Bender, John Gilbert, Bruce Hendrickson, Blair D. Sullivan:
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, ACDA 2021, Virtual Conference, July 19-21, 2021. SIAM 2021, ISBN 978-1-61197-683-0 [contents] - [i26]Madison Cooley, Casey S. Greene, Davis Issac, Milton Pividori, Blair D. Sullivan:
Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. CoRR abs/2106.00657 (2021) - [i25]Michael Breen-McKay, Brian Lavallee, Blair D. Sullivan:
Hardness of the Generalized Coloring Numbers. CoRR abs/2112.10562 (2021) - [i24]Yosuke Mizutani, Annie Staker, Blair D. Sullivan:
Sparse dominating sets and balanced neighborhood partitioning. CoRR abs/2112.10973 (2021) - [i23]Daniel Král', Michal Pilipczuk, Sebastian Siebertz, Blair D. Sullivan:
Sparsity in Algorithms, Combinatorics and Logic (Dagstuhl Seminar 21391). Dagstuhl Reports 11(8): 115-128 (2021) - 2020
- [c16]Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel:
Approximating Vertex Cover using Structural Rounding. ALENEX 2020: 70-80 - [i22]Felix Reidl, Blair D. Sullivan:
A color-avoiding approach to subgraph counting in bounded expansion classes. CoRR abs/2001.05236 (2020)
2010 – 2019
- 2019
- [j9]Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan:
Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs. J. Comput. Syst. Sci. 105: 199-241 (2019) - [c15]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. ESA 2019: 37:1-37:15 - [c14]Kyle Kloster, Blair D. Sullivan, Andrew van der Poel:
Mining Maximal Induced Bicliques using Odd Cycle Transversals. SDM 2019: 324-332 - [c13]Blair D. Sullivan, Andrew van der Poel, Trey Woodlief:
Faster Biclique Mining in Near-Bipartite Graphs. SEA² 2019: 424-453 - [i21]Blair D. Sullivan, Andrew van der Poel, Trey Woodlief:
Faster Biclique Mining in Near-Bipartite Graphs. CoRR abs/1903.01538 (2019) - [i20]Brian Lavallee, Hayley Russell, Blair D. Sullivan, Andrew van der Poel:
Approximating Vertex Cover using Structural Rounding. CoRR abs/1909.04611 (2019) - 2018
- [j8]Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble:
Optimizing adiabatic quantum program compilation using a graph-theoretic framework. Quantum Inf. Process. 17(5): 118 (2018) - [c12]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. ALENEX 2018: 75-86 - [c11]Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan:
Treedepth Bounds in Linear Colorings. WG 2018: 331-343 - [i19]Jeremy Kun, Michael P. O'Brien, Blair D. Sullivan:
Treedepth Bounds in Linear Colorings. CoRR abs/1802.09665 (2018) - [i18]Eric Horton, Kyle Kloster, Blair D. Sullivan:
When Centrality Measures Deceive Us. CoRR abs/1804.05966 (2018) - [i17]Timothy D. Goodrich, Eric Horton, Blair D. Sullivan:
Practical Graph Bipartization with Applications in Near-Term Quantum Computing. CoRR abs/1805.01041 (2018) - [i16]Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster, Brian Lavallee, Quanquan C. Liu, Blair D. Sullivan, Ali Vakilian, Andrew van der Poel:
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class. CoRR abs/1806.02771 (2018) - [i15]Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan, Andrew L. Wright:
Benchmarking treewidth as a practical component of tensor-network-based quantum simulation. CoRR abs/1807.04599 (2018) - [i14]Kyle Kloster, Blair D. Sullivan, Andrew van der Poel:
Mining Maximal Induced Bicliques using Odd Cycle Transversals. CoRR abs/1810.11421 (2018) - 2017
- [c10]Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan:
Being Even Slightly Shallow Makes Life Hard. MFCS 2017: 79:1-79:13 - [i13]Timothy D. Goodrich, Blair D. Sullivan, Travis S. Humble:
Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework. CoRR abs/1704.01996 (2017) - [i12]Irene Muzi, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan:
Being even slightly shallow makes life hard. CoRR abs/1705.06796 (2017) - [i11]Kyle Kloster, Philipp Kuinke, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan, Andrew van der Poel:
A practical fpt algorithm for Flow Decomposition and transcript assembly. CoRR abs/1706.07851 (2017) - [i10]Michael P. O'Brien, Blair D. Sullivan:
Experimental Evaluation of Counting Subgraph Isomorphisms in Classes of Bounded Expansion. CoRR abs/1712.06690 (2017) - 2016
- [j7]Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney:
Tree decompositions and social graphs. Internet Math. 12(5): 315-361 (2016) - [j6]Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan:
A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization. Soc. Netw. Anal. Min. 6(1): 99:1-99:14 (2016) - [c9]Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel:
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. ICDM 2016: 829-834 - [c8]Blair D. Sullivan, Andrew van der Poel:
A Fast Parameterized Algorithm for Co-Path Set. IPEC 2016: 28:1-28:13 - [i9]Blair D. Sullivan, Andrew van der Poel:
A Fast Parameterized Algorithm for Co-Path Set. CoRR abs/1603.04376 (2016) - [i8]Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien, Felix Reidl, Blair D. Sullivan, Andrew van der Poel:
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models. CoRR abs/1609.05081 (2016) - 2015
- [j5]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Zig-Zag Numberlink is NP-Complete. J. Inf. Process. 23(3): 239-245 (2015) - [c7]Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan:
Multi-Level Anomaly Detection on Time-Varying Graph Data. ASONAM 2015: 579-583 - [c6]Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the Threshold of Intractability. ESA 2015: 411-423 - [c5]Matthew Farrell, Timothy D. Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs. WAW 2015: 29-41 - [i7]Pål Grønås Drange, Markus Sortland Dregi, Daniel Lokshtanov, Blair D. Sullivan:
On the Threshold of Intractability. CoRR abs/1505.00612 (2015) - 2014
- [j4]Christine Klymko, Blair D. Sullivan, Travis S. Humble:
Adiabatic quantum programming: minor embedding with hard faults. Quantum Inf. Process. 13(3): 709-729 (2014) - [c4]Michael P. O'Brien, Blair D. Sullivan:
Locally Estimating Core Numbers. ICDM 2014: 460-469 - [i6]Erik D. Demaine, Felix Reidl, Peter Rossmanith, Fernando Sánchez Villaamil, Somnath Sikdar, Blair D. Sullivan:
Structural Sparsity of Complex Networks: Random Graph Models and Linear Algorithms. CoRR abs/1406.2587 (2014) - [i5]Matthew Farrell, Timothy Goodrich, Nathan Lemons, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Hyperbolicity, degeneracy, and expansion of random intersection graphs. CoRR abs/1409.8196 (2014) - [i4]Robert A. Bridges, John P. Collins, Erik M. Ferragut, Jason A. Laska, Blair D. Sullivan:
Multi-Level Anomaly Detection on Streaming Graph Data. CoRR abs/1410.4355 (2014) - [i3]Aaron B. Adcock, Erik D. Demaine, Martin L. Demaine, Michael P. O'Brien, Felix Reidl, Fernando Sánchez Villaamil, Blair D. Sullivan:
Zig-Zag Numberlink is NP-Complete. CoRR abs/1410.5845 (2014) - [i2]Michael P. O'Brien, Blair D. Sullivan:
Locally Estimating Core Numbers. CoRR abs/1410.6793 (2014) - [i1]Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney:
Tree decompositions and social graphs. CoRR abs/1411.1546 (2014) - 2013
- [c3]Aaron B. Adcock, Blair D. Sullivan, Michael W. Mahoney:
Tree-Like Structure in Large Social and Information Networks. ICDM 2013: 1-10 - [c2]Blair D. Sullivan, Dinesh Weerapurage, Chris Groër:
Parallel Algorithms for Graph Optimization Using Tree Decompositions. IPDPS Workshops 2013: 1838-1847 - [c1]Aaron B. Adcock, Blair D. Sullivan, Oscar R. Hernandez, Michael W. Mahoney:
Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity. IWOMP 2013: 71-83 - 2011
- [j3]Christopher Groër, Blair D. Sullivan, Steve Poole:
A mathematical analysis of the R-MAT random graph generator. Networks 58(3): 159-170 (2011) - 2010
- [j2]Paul D. Seymour, Blair D. Sullivan:
Counting paths in digraphs. Eur. J. Comb. 31(3): 961-975 (2010)
2000 – 2009
- 2008
- [j1]Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan:
Cycles in dense digraphs. Comb. 28(1): 1-18 (2008)
Coauthor Index
aka: Timothy D. Goodrich
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2022-06-25 02:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp has been originally created in 1993 at:
since 2018, dblp is operated and maintained by:
the dblp computer science bibliography is funded and supported by:
