Blair D. Sullivan

808 total citations
29 papers, 280 citations indexed

About

Blair D. Sullivan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Statistical and Nonlinear Physics. According to data from OpenAlex, Blair D. Sullivan has authored 29 papers receiving a total of 280 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computational Theory and Mathematics, 12 papers in Artificial Intelligence and 8 papers in Statistical and Nonlinear Physics. Recurrent topics in Blair D. Sullivan's work include Advanced Graph Theory Research (9 papers), Complex Network Analysis Techniques (8 papers) and Complexity and Algorithms in Graphs (8 papers). Blair D. Sullivan is often cited by papers focused on Advanced Graph Theory Research (9 papers), Complex Network Analysis Techniques (8 papers) and Complexity and Algorithms in Graphs (8 papers). Blair D. Sullivan collaborates with scholars based in United States, Germany and Poland. Blair D. Sullivan's co-authors include Aaron Adcock, Travis S. Humble, Michael W. Mahoney, Maria Chudnovsky, Felix Reidl, Paul Seymour, Chris Groër, Steve Poole, Taylor Reiter and Erik M. Ferragut and has published in prestigious journals such as Nature Communications, PLoS ONE and Genome biology.

In The Last Decade

Blair D. Sullivan

25 papers receiving 263 citations

Peers

Blair D. Sullivan

AI

CTM

SNP

MB

CNC

Marcos Kiwi Chile

Anand Louis United States

Arash Rafiey Canada

Ravi Montenegro United States

Ivona Bezáková United States

Alexander E. Holroyd United States

Koji Nuida Japan

Grzegorz Kubicki United States

Elena Shamis Russia

Colin Sandon United States

Marcos Kiwi Chile

Blair D. Sullivan

164 ×1.2

AI

155 ×1.7

CTM

27 ×0.4

SNP

22 ×0.5

MB

40 ×1.1

CNC

Citations per year, relative to Blair D. Sullivan Blair D. Sullivan (= 1×) peers Marcos Kiwi

Countries citing papers authored by Blair D. Sullivan

Since Specialization

Citations

This map shows the geographic impact of Blair D. Sullivan's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Blair D. Sullivan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Blair D. Sullivan more than expected).

Fields of papers citing papers by Blair D. Sullivan

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Blair D. Sullivan. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Blair D. Sullivan. The network helps show where Blair D. Sullivan may publish in the future.

Co-authorship network of co-authors of Blair D. Sullivan

This figure shows the co-authorship network connecting the top 25 collaborators of Blair D. Sullivan. A scholar is included among the top collaborators of Blair D. Sullivan based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Blair D. Sullivan. Blair D. Sullivan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Sullivan, Blair D., et al.. (2024). Overlapping and Robust Edge-Colored Clustering in Hypergraphs. 143–151. 1 indexed citations

2.

Pividori, Milton, Sumei Lu, Binglan Li, et al.. (2023). Projecting genetic associations through gene expression patterns highlights disease etiology and drug mechanisms. Nature Communications. 14(1). 5562–5562. 9 indexed citations

3.

Himmelstein, Daniel, Michael Zietz, Vincent Rubinetti, et al.. (2022). Hetnet connectivity search provides rapid insights into how biomedical entities are related. GigaScience. 12. 6 indexed citations

4.

Greene, Casey S., et al.. (2021). Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition. Society for Industrial and Applied Mathematics eBooks. 2021. 111–122. 1 indexed citations

5.

Brown, C. Titus, et al.. (2020). Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity. Genome biology. 21(1). 164–164. 19 indexed citations

6.

Dumitrescu, Eugene, et al.. (2018). Benchmarking treewidth as a practical component of tensor network simulations. PLoS ONE. 13(12). e0207827–e0207827. 8 indexed citations

7.

Sullivan, Blair D., et al.. (2018). Practical Graph Bipartization with Applications in Near-Term Quantum Computing.. arXiv (Cornell University). 1 indexed citations

8.

Reidl, Felix, et al.. (2017). Being Even Slightly Shallow Makes Life Hard. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics).

9.

Rodrigues, Nishant, et al.. (2016). CONCUSS: Version 2.0. Zenodo (CERN European Organization for Nuclear Research). 1 indexed citations

10.

Bridges, Robert A., et al.. (2016). A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization. Social Network Analysis and Mining. 6(1). 2 indexed citations

11.

Reidl, Felix, et al.. (2015). CONCUSS: Version 1.0. Zenodo (CERN European Organization for Nuclear Research).

12.

Adcock, Aaron, et al.. (2015). Zig-Zag Numberlink is NP-Complete. Journal of Information Processing. 23(3). 239–245. 12 indexed citations

13.

Sullivan, Blair D., et al.. (2014). Locally Estimating Core Numbers. 5. 460–469. 19 indexed citations

14.

Sullivan, Blair D., et al.. (2013). Parallel Algorithms for Graph Optimization Using Tree Decompositions. 453. 1838–1847. 2 indexed citations

15.

Sullivan, Blair D., et al.. (2013). Adiabatic quantum programming: minor embedding with hard faults. Quantum Information Processing. 13(3). 709–729. 55 indexed citations

16.

Adcock, Aaron, Blair D. Sullivan, & Michael W. Mahoney. (2013). Tree-Like Structure in Large Social and Information Networks. 1–10. 64 indexed citations

17.

Groër, Chris, Blair D. Sullivan, & Steve Poole. (2011). A mathematical analysis of the R‐MAT random graph generator. Networks. 58(3). 159–170. 14 indexed citations

18.

Seymour, Paul & Blair D. Sullivan. (2009). Counting paths in digraphs. European Journal of Combinatorics. 31(3). 961–975.

19.

Sullivan, Blair D.. (2008). Extremal Problems in Digraphs. 7 indexed citations

20.

Sullivan, Blair D.. (2006). A summary of results and problems related to the Caccetta-Häggkvist conjecture. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact