Year |
Citation |
Score |
2020 |
Kun J, O’Brien MP, Pilipczuk M, Sullivan BD. Polynomial Treedepth Bounds in Linear Colorings Algorithmica. 1-26. DOI: 10.1007/S00453-020-00760-0 |
0.341 |
|
2019 |
Horton E, Kloster K, Sullivan BD. Subgraph centrality and walk-regularity Linear Algebra and Its Applications. 570: 225-244. DOI: 10.1016/J.Laa.2019.02.005 |
0.386 |
|
2019 |
Demaine ED, Reidl F, Rossmanith P, Villaamil FS, Sikdar S, Sullivan BD. Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs Journal of Computer and System Sciences. 105: 199-241. DOI: 10.1016/J.Jcss.2019.05.004 |
0.369 |
|
2018 |
Dumitrescu EF, Fisher AL, Goodrich TD, Humble TS, Sullivan BD, Wright AL. Benchmarking treewidth as a practical component of tensor network simulations. Plos One. 13: e0207827. PMID 30562341 DOI: 10.1371/Journal.Pone.0207827 |
0.325 |
|
2018 |
Kloster K, Král D, Sullivan BD. Walk entropy and walk-regularity Linear Algebra and Its Applications. 546: 115-121. DOI: 10.1016/J.Laa.2018.02.009 |
0.473 |
|
2018 |
Goodrich TD, Sullivan BD, Humble TS. Optimizing adiabatic quantum program compilation using a graph-theoretic framework Quantum Information Processing. 17. DOI: 10.1007/S11128-018-1863-4 |
0.315 |
|
2016 |
Adcock AB, Sullivan BD, Mahoney MW. Tree decompositions and social graphs Internet Mathematics. 12: 315-361. DOI: 10.1080/15427951.2016.1182952 |
0.384 |
|
2016 |
Bridges RA, Collins JP, Ferragut EM, Laska JA, Sullivan BD. A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization Social Network Analysis and Mining. 6: 99. DOI: 10.1007/S13278-016-0409-Y |
0.388 |
|
2015 |
Farrell M, Goodrich TD, Lemons N, Reidl F, Villaamil FS, Sullivan BD. Hyperbolicity, degeneracy, and expansion of random intersection graphs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9479: 29-41. DOI: 10.24166/Im.06.2017 |
0.413 |
|
2013 |
Sullivan BD, Weerapurage D, Groer C. Parallel algorithms for graph optimization using tree decompositions Proceedings - Ieee 27th International Parallel and Distributed Processing Symposium Workshops and Phd Forum, Ipdpsw 2013. 1838-1847. DOI: 10.1109/IPDPSW.2013.242 |
0.301 |
|
2011 |
Groër C, Sullivan BD, Poole S. A mathematical analysis of the R-MAT random graph generator Networks. 58: 159-170. DOI: 10.1002/Net.20417 |
0.384 |
|
2010 |
Seymour P, Sullivan BD. Counting paths in digraphs European Journal of Combinatorics. 31: 961-975. DOI: 10.1016/J.Ejc.2009.05.008 |
0.467 |
|
2008 |
Chudnovsky M, Seymour P, Sullivan B. Cycles in dense digraphs Combinatorica. 28: 1-18. DOI: 10.1007/S00493-008-2331-Z |
0.495 |
|
Show low-probability matches. |