Works (58)

Updated: November 6th, 2023 07:25

2022 article

Faster Decomposition ofWeighted Graphs into Cliques using Fisher's Inequality

ArXiv.

By: S. Jain, Y. Mizutani & B. Sullivan*

Contributors: S. Jain, Y. Mizutani & B. Sullivan*

Source: ORCID
Added: August 6, 2022

2022 article

Gerrymandering Trees: Parameterized Hardness

ArXiv.

By: A. Fraser, B. Lavallee & B. Sullivan*

Contributors: A. Fraser, B. Lavallee & B. Sullivan*

Source: ORCID
Added: August 6, 2022

2022 article

Improved Parameterized Complexity of Happy Set Problems

ArXiv.

By: Y. Mizutani & B. Sullivan*

Contributors: Y. Mizutani & B. Sullivan*

Source: ORCID
Added: August 6, 2022

2022 journal article

On the threshold of intractability

Journal of Computer and System Sciences, 124, 1–25.

By: P. Drange*, M. Dregi*, D. Lokshtanov* & B. Sullivan*

co-author countries: Norway 🇳🇴 United States of America 🇺🇸

Contributors: P. Drange*, M. Dregi*, D. Lokshtanov* & B. Sullivan*

author keywords: Edge editing; Threshold graphs; Parameterized complexity
Source: ORCID
Added: August 6, 2022

2021 journal article

An Updated Experimental Evaluation of Graph Bipartization Methods

ACM Journal of Experimental Algorithmics, 26.

By: T. Goodrich n, E. Horton n & B. Sullivan n

co-author countries: United States of America 🇺🇸

Contributors: T. Goodrich n, E. Horton n & B. Sullivan n

Source: ORCID
Added: August 6, 2022

2021 article

Hardness of the Generalized Coloring Numbers

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85121786987&partnerID=MN8TOARS

By: M. Breen-McKay, B. Lavallee & B. Sullivan

Contributors: M. Breen-McKay, B. Lavallee & B. Sullivan

Source: ORCID
Added: August 6, 2022

2021 conference paper

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition

SIAM Conference on Applied and Computational Discrete Algorithms (ACDA21), 111–122.

By: M. Cooley, C. Greene, D. Issac, M. Pividori* & B. Sullivan*

co-author countries: United States of America 🇺🇸

Contributors: B. Sullivan*

Source: ORCID
Added: August 6, 2022

2021 article

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85108789587&partnerID=MN8TOARS

By: M. Cooley, C. Greene, D. Issac, M. Pividori & B. Sullivan

Contributors: M. Cooley, C. Greene, D. Issac, M. Pividori & B. Sullivan

Source: ORCID
Added: August 6, 2022

2021 journal article

Polynomial Treedepth Bounds in Linear Colorings

ALGORITHMICA, 83(1), 361–386.

By: J. Kun*, . Michael P. O'Brien n, M. Pilipczuk* & B. Sullivan n

co-author countries: Poland 🇵🇱 United States of America 🇺🇸

Contributors: J. Kun*, M. O’Brien n, M. Pilipczuk* & B. Sullivan n

author keywords: Linear colorings; p-centered colorings; Bounded expansion; Treedepth
Sources: Web Of Science, ORCID
Added: September 21, 2020

2021 article

Projecting genetic associations through gene expression patterns highlights disease etiology and drug mechanisms

BioRxiv.

By: M. Pividori*, S. Lu*, B. Li*, C. Su*, M. Johnson*, W. Wei*, Q. Feng*, B. Namjou* ...

co-author countries: United States of America 🇺🇸

Contributors: M. Pividori*, S. Lu*, B. Li*, C. Su*, M. Johnson*, W. Wei*, Q. Feng*, B. Namjou* ...

Source: ORCID
Added: August 6, 2022

2021 chapter

Secondary Structure Ensemble Analysis via Community Detection

In Association for Women in Mathematics Series (Vol. 22, pp. 55–81).

By: H. Du*, M. Ferrari*, C. Heitsch*, F. Hurley n, C. Mennicke n, B. Sullivan*, B. Xu*

co-author countries: United States of America 🇺🇸

Contributors: H. Du*, M. Ferrari*, C. Heitsch*, F. Hurley n, C. Mennicke n, B. Sullivan*, B. Xu*

Source: ORCID
Added: August 6, 2022

2021 article

Sparse dominating sets and balanced neighborhood partitioning

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85121833484&partnerID=MN8TOARS

By: Y. Mizutani, A. Staker & B. Sullivan

Contributors: Y. Mizutani, A. Staker & B. Sullivan

Source: ORCID
Added: August 6, 2022

2020 article

A color-avoiding approach to subgraph counting in bounded expansion classes

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095561220&partnerID=MN8TOARS

By: F. Reidl & B. Sullivan

Contributors: F. Reidl & B. Sullivan

Source: ORCID
Added: August 6, 2022

2020 conference paper

Approximating vertex cover using structural rounding

Proceedings of the Workshop on Algorithm Engineering and Experiments, 2020-January, 70–80.

By: B. Lavallee, H. Russell, B. Sullivan* & A. Poel

Contributors: B. Lavallee, H. Russell, B. Sullivan* & A. Poel

Source: ORCID
Added: August 6, 2022

2020 journal article

Exploring neighborhoods in large metagenome assembly graphs using spacegraphcats reveals hidden sequence diversity

GENOME BIOLOGY, 21(1).

co-author countries: United States of America 🇺🇸

Contributors: C. Brown*, D. Moritz*, . M.P. O'Brien, F. Reidl n, T. Reiter* & B. Sullivan n

author keywords: Metagenomics; Sequence assembly; Strain variation; Bounded expansion; Dominating set
MeSH headings : Algorithms; Genetic Variation; Genome; Metagenomics / methods; Software
Sources: Web Of Science, ORCID
Added: August 10, 2020

2019 article

Approximating vertex cover using structural rounding

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094768942&partnerID=MN8TOARS

By: B. Lavallee, H. Russell, B. Sullivan & A. Poel

Contributors: B. Lavallee, H. Russell, B. Sullivan & A. Poel

Source: ORCID
Added: August 6, 2022

2019 article

Faster Biclique Mining in Near-Bipartite Graphs

ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, Vol. 11544, pp. 424–453.

By: B. Sullivan n, A. Poel n & T. Woodlief n

co-author countries: United States of America 🇺🇸

Contributors: B. Sullivan n, A. Poel n & T. Woodlief n

author keywords: Bicliques; Odd cycle transversal; Bipartite; Enumeration algorithms; Parameterized complexity
Sources: Web Of Science, ORCID
Added: November 16, 2020

2019 conference paper

Mining maximal induced bicliques using odd cycle transversals

SIAM International Conference on Data Mining, SDM 2019, 324–332.

By: K. Kloster, A. Poel & B. Sullivan*

Contributors: K. Kloster, A. Poel & B. Sullivan*

Source: ORCID
Added: August 6, 2022

2019 article

Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class

27TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS (ESA 2019), Vol. 144.

By: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Contributors: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

author keywords: structural rounding; graph editing; approximation algorithms
Sources: Web Of Science, ORCID
Added: October 5, 2020

2019 journal article

Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs

Journal of Computer and System Sciences, 105, 199–241.

By: E. Demaine*, F. Reidl*, P. Rossmanith*, F. Villaamil*, S. Sikdar* & B. Sullivan n

co-author countries: Germany 🇩🇪 United States of America 🇺🇸

Contributors: E. Demaine*, F. Reidl*, P. Rossmanith*, F. Sánchez Villaamil*, S. Sikdar* & B. Sullivan n

author keywords: Structural sparsity; Bounded expansion; Complex networks; Random graphs; Motif counting; Centrality measures
Source: ORCID
Added: May 25, 2019

2019 journal article

Subgraph centrality and walk-regularity

Linear Algebra and Its Applications, 570, 225–244.

By: E. Horton n, K. Kloster n & B. Sullivan n

co-author countries: United States of America 🇺🇸

Contributors: E. Horton n, K. Kloster n & B. Sullivan n

author keywords: Centrality; Graph entropy; Walk-regularity; Functions of matrices; Network analysis
Source: ORCID
Added: February 12, 2019

2018 conference paper

A practical fpt algorithm for flow decomposition and transcript assembly

Proceedings of the Workshop on Algorithm Engineering and Experiments, 2018-January, 75–86.

By: K. Kloster n, P. Kuinke*, M. O?Brien n, F. Reidl*, F. Villaamil*, B. Sullivan n, A. Van Der Poel n

co-author countries: Germany 🇩🇪 United Kingdom of Great Britain and Northern Ireland 🇬🇧 United States of America 🇺🇸

Contributors: K. Kloster n, P. Kuinke*, M. O’Brien n, F. Reidl*, F. Villaamil*, B. Sullivan n, A. Van Der Poel n

Source: ORCID
Added: August 6, 2022

2018 article

An updated experimental evaluation of graph bipartization methods

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85104339918&partnerID=MN8TOARS

By: T. Goodrich, E. Horton & B. Sullivan

Contributors: T. Goodrich, E. Horton & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 journal article

Benchmarking treewidth as a practical component of tensor network simulations

PLOS ONE, 13(12).

By: E. Dumitrescu*, A. Fisher n, T. Goodrich n, T. Humble*, B. Sullivan n & A. Wright n

co-author countries: United States of America 🇺🇸

Contributors: E. Dumitrescu*, A. Fisher n, T. Goodrich n, T. Humble*, B. Sullivan n & A. Wright n

Ed(s): E. Torre

MeSH headings : Algorithms; Benchmarking; Computer Graphics; Computer Simulation; Quantum Theory; Software
Sources: Web Of Science, ORCID
Added: January 7, 2019

2018 article

Benchmarking treewidth as a practical component of tensor-network–based quantum simulation

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095245427&partnerID=MN8TOARS

By: E. Dumitrescu, A. Fisher, T. Goodrich, T. Humble, B. Sullivan & A. Wrigh

Contributors: E. Dumitrescu, A. Fisher, T. Goodrich, T. Humble, B. Sullivan & A. Wrigh

Source: ORCID
Added: August 6, 2022

2018 article

Exploring neighborhoods in large metagenome assembly graphs reveals hidden sequence diversity

Brown, C. T., Moritz, D., O’Brien, M. P., Reidl, F., Reiter, T., & Sullivan, B. D. (2018, November 5). BioRxiv, Vol. 11.

By: C. Brown, D. Moritz*, M. O’Brien*, F. Reidl*, T. Reiter & B. Sullivan*

co-author countries: United States of America 🇺🇸

Contributors: C. Brown, D. Moritz*, M. O’Brien*, F. Reidl*, T. Reiter & B. Sullivan*

Source: ORCID
Added: February 8, 2019

2018 article

Mining maximal induced bicliques using odd cycle transversals

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85093320378&partnerID=MN8TOARS

By: K. Kloster, B. Sullivan & A. Van Der Poel

Contributors: K. Kloster, B. Sullivan & A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2018 journal article

Optimizing adiabatic quantum program compilation using a graph-theoretic framework

Quantum Information Processing, 17(5).

By: T. Goodrich n, B. Sullivan n & T. Humble*

co-author countries: United States of America 🇺🇸

Contributors: T. Goodrich n, B. Sullivan n & T. Humble*

Sources: Crossref, ORCID
Added: February 5, 2020

2018 article

Polynomial treedepth bounds in linear colorings

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85092833264&partnerID=MN8TOARS

By: J. Kun, M. O’Brien, M. Pilipczuk & B. Sullivan

Contributors: J. Kun, . M.P. O'Brien, M. Pilipczuk & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 article

Structural rounding: Approximation algorithms for graphs near an algorithmically tractable class

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094277709&partnerID=MN8TOARS

By: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Contributors: E. Demaine, T. Goodrich, K. Kloster, B. Lavallee, Q. Liu, B. Sullivan, A. Vakilian, A. Poel

Source: ORCID
Added: August 6, 2022

2018 article

Subgraph centrality and walk-regularity

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85093754399&partnerID=MN8TOARS

By: E. Horton, K. Kloster & B. Sullivan

Contributors: E. Horton, K. Kloster & B. Sullivan

Source: ORCID
Added: August 6, 2022

2018 chapter

Treedepth Bounds in Linear Colorings

In Graph-Theoretic Concepts in Computer Science: Vol. 11159 LNCS (pp. 331–343).

By: J. Kun*, M. O’Brien n & B. Sullivan n

co-author countries: United States of America 🇺🇸

Contributors: J. Kun*, M. O’Brien n & B. Sullivan n

Sources: Crossref, ORCID
Added: February 5, 2020

2018 journal article

Walk entropy and walk-regularity

Linear Algebra and Its Applications, 546, 115–121.

By: K. Kloster n, D. Král'* & B. Sullivan n

co-author countries: United Kingdom of Great Britain and Northern Ireland 🇬🇧 United States of America 🇺🇸

Contributors: K. Kloster n, D. Král* & B. Sullivan n

author keywords: Graph entropy; Walk-regularity; Subgraph centrality; Matrix exponential
Source: ORCID
Added: February 8, 2019

2017 conference paper

A fast parameterized algorithm for Co-Path Set

Leibniz International Proceedings in Informatics, LIPIcs, 63.

By: B. Sullivan n & A. Van Der Poel n

co-author countries: United States of America 🇺🇸

Contributors: B. Sullivan n & A. Van Der Poel n

Source: ORCID
Added: August 6, 2022

2017 article

A practical fpt algorithm for flow decomposition and transcript assembly

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094353595&partnerID=MN8TOARS

By: K. Kloster, P. Kuinke, M. O’Brien, F. Reidl, F. Villaamil, B. Sullivan, A. Van Der Poel

Contributors: K. Kloster, P. Kuinke, . M.P. O'Brien, F. Reidl, F. Villaamil, B. Sullivan, A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2017 article

An experimental evaluation of a bounded expansion algorithmic pipeline

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85092949285&partnerID=MN8TOARS

By: M. O’Brien & B. Sullivan

Contributors: . M.P. O'Brien & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 conference paper

Asymptotic analysis of equivalences and core-structures in kronecker-style graph models

Proceedings - IEEE International Conference on Data Mining, ICDM, 829–834.

Contributors: A. Chin, T. Goodrich, . M.P. O'Brien, F. Reidl, B. Sullivan & A. Van Der Poel

Source: ORCID
Added: August 6, 2022

2017 conference paper

Being even slightly shallow makes life hard

Leibniz International Proceedings in Informatics, LIPIcs, 83.

By: I. Muzi*, M. O’Brien n, F. Reidl* & B. Sullivan n

co-author countries: Germany 🇩🇪 Italy 🇮🇹 United States of America 🇺🇸

Contributors: I. Muzi*, . M.P. O'Brien, F. Reidl* & B. Sullivan n

Source: ORCID
Added: August 6, 2022

2017 article

Being even slightly shallow makes life hard

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094429786&partnerID=MN8TOARS

By: I. Muzi, M. O’Brien, F. Reidl & B. Sullivan

Contributors: I. Muzi, . M.P. O'Brien, F. Reidl & B. Sullivan

Source: ORCID
Added: August 6, 2022

2017 article

Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85095056109&partnerID=MN8TOARS

By: T. Goodrich, B. Sullivan & T. Humble

Contributors: T. Goodrich, B. Sullivan & T. Humble

Source: ORCID
Added: August 6, 2022

2017 article

Walk entropy and walk-regularity

ArXiv. http://www.scopus.com/inward/record.url?eid=2-s2.0-85094268676&partnerID=MN8TOARS

By: K. Kloster, D. Král & B. Sullivan

Contributors: K. Kloster, D. Král & B. Sullivan

Source: ORCID
Added: August 6, 2022

2016 journal article

A multi-level anomaly detection algorithm for time-varying graph data with interactive visualization

Social Network Analysis and Mining, 6(1).

By: R. Bridges*, J. Collins*, E. Ferragut*, J. Laska* & B. Sullivan n

co-author countries: United States of America 🇺🇸

Contributors: R. Bridges*, J. Collins*, E. Ferragut*, J. Laska* & B. Sullivan n

author keywords: Anomaly detection; Graph sequence; Visualization
Sources: Crossref, ORCID
Added: February 5, 2020

2016 conference paper

Asymptotic analysis of equivalences and core-structures in Kronecker-style graph models

2016 ieee 16th international conference on data mining (icdm), 829–834.

By: A. Chin*, T. Goodrich n, M. O'Brien n, F. Reidl n, B. Sullivan n & A. Poel n

co-author countries: United States of America 🇺🇸
Sources: NC State University Libraries, ORCID
Added: August 6, 2018

2016 journal article

Tree decompositions and social graphs

INTERNET MATHEMATICS, 12(5), 315–361.

By: A. Adcock*, B. Sullivan n & M. Mahoney*

co-author countries: United States of America 🇺🇸

Contributors: A. Adcock*, B. Sullivan n & M. Mahoney*

Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 article

Hyperbolicity, Degeneracy, and Expansion of Random Intersection Graphs

ALGORITHMS AND MODELS FOR THE WEB GRAPH, (WAW 2015), Vol. 9479, pp. 29–41.

By: M. Farrell*, T. Goodrich n, N. Lemons*, F. Reidl*, F. Villaamil* & B. Sullivan n

co-author countries: Germany 🇩🇪 United States of America 🇺🇸

Contributors: M. Farrell*, T. Goodrich n, N. Lemons*, F. Reidl*, F. Villaamil* & B. Sullivan n

Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 article

Multi-Level Anomaly Detection on Time-Varying Graph Data

PROCEEDINGS OF THE 2015 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING (ASONAM 2015), pp. 579–583.

By: R. Bridges*, J. Collins*, E. Ferragut*, J. Laska* & B. Sullivan n

co-author countries: United States of America 🇺🇸

Contributors: R. Bridges*, J. Collins*, E. Ferragut*, J. Laska* & B. Sullivan n

Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 article

On the Threshold of Intractability

ALGORITHMS - ESA 2015, Vol. 9294, pp. 411–423.

By: P. Drange*, M. Dregi*, D. Lokshtanov* & B. Sullivan n

co-author countries: Norway 🇳🇴 United States of America 🇺🇸

Contributors: P. Drange*, M. Dregi*, D. Lokshtanov* & B. Sullivan n

Sources: Web Of Science, ORCID
Added: August 6, 2018

2015 journal article

Zig-Zag Numberlink is NP-Complete

Journal of Information Processing, 23(3), 239–245.

Contributors: A. Adcock*, E. Demaine*, M. Demaine*, . M.P. O'Brien, F. Reidl*, F. Villaamil*, B. Sullivan n

Source: ORCID
Added: August 6, 2022

2014 journal article

An integrated programming and development environment for adiabatic quantum optimization

Computational Science and Discovery, 7(1).

By: T. Humble*, A. McCaskey*, R. Bennink*, J. Billings*, E. Dazevedo*, B. Sullivan*, C. Klymko*, H. Seddiqi*

co-author countries: United States of America 🇺🇸

Contributors: T. Humble*, A. McCaskey*, R. Bennink*, J. Billings*, E. Dazevedo*, B. Sullivan*, C. Klymko*, H. Seddiqi*

Source: ORCID
Added: August 6, 2022

2014 conference paper

Locally Estimating Core Numbers

Proceedings - IEEE International Conference on Data Mining, ICDM, 2015-January(January), 460–469.

By: M. Obrien n & B. Sullivan n

co-author countries: United States of America 🇺🇸

Contributors: M. Obrien n & B. Sullivan n

Source: ORCID
Added: August 6, 2022

2013 journal article

Adiabatic quantum programming: minor embedding with hard faults

Quantum Information Processing, 13(3), 709–729.

By: C. Klymko*, B. Sullivan n & T. Humble*

co-author countries: United States of America 🇺🇸

Contributors: C. Klymko*, B. Sullivan n & T. Humble*

author keywords: Quantum computing; Adiabatic quantum optimization; Graph embedding; Fault-tolerant computing
Sources: ORCID, Crossref
Added: February 5, 2020

2013 chapter

Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity

In OpenMP in the Era of Low Power Devices and Accelerators: Vol. 8122 LNCS (pp. 71–83).

By: A. Adcock*, B. Sullivan*, O. Hernandez* & M. Mahoney*

co-author countries: United States of America 🇺🇸

Contributors: A. Adcock*, B. Sullivan*, O. Hernandez* & M. Mahoney*

Sources: Crossref, ORCID
Added: February 5, 2020

2013 journal article

On a conjecture of Andrica and Tomescu

Journal of Integer Sequences, 16(3). http://www.scopus.com/inward/record.url?eid=2-s2.0-84880061040&partnerID=MN8TOARS

By: B. Sullivan

Contributors: B. Sullivan

Source: ORCID
Added: August 6, 2022

2013 conference paper

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.

By: B. Sullivan*, D. Weerapurage* & C. Groer*

co-author countries: United States of America 🇺🇸

Contributors: B. Sullivan*, D. Weerapurage* & C. Groer*

Source: ORCID
Added: August 6, 2022

2013 conference paper

Tree-Like Structure in Large Social and Information Networks

2013 IEEE 13th International Conference on Data Mining, 1–10.

By: A. Adcock*, B. Sullivan n & M. Mahoney*

co-author countries: United States of America 🇺🇸

Contributors: B. Sullivan n

Source: ORCID
Added: August 6, 2022

2011 journal article

A mathematical analysis of the R-MAT random graph generator

Networks, 58(3), 159–170.

By: C. Groër*, B. Sullivan* & S. Poole*

co-author countries: United States of America 🇺🇸

Contributors: C. Groër*, B. Sullivan* & S. Poole*

author keywords: random graph; scale-free graph; R-MAT generator; occupancy problem
Sources: Crossref, ORCID
Added: February 5, 2020

2010 journal article

Counting paths in digraphs

European Journal of Combinatorics, 31(3), 961–975.

By: P. Seymour & B. Sullivan*

Contributors: P. Seymour & B. Sullivan*

Sources: Crossref, ORCID
Added: February 5, 2020

2008 journal article

Cycles in dense digraphs

Combinatorica, 28(1), 1–18.

By: M. Chudnovsky*, P. Seymour* & B. Sullivan*

co-author countries: United States of America 🇺🇸

Contributors: M. Chudnovsky*, P. Seymour* & B. Sullivan*

Sources: Crossref, ORCID
Added: February 5, 2020

Employment

Updated: November 5th, 2019 16:58

2019 - present

University of Utah Salt Lake City, UT, US
Associate Professor School of Computing

2013 - 2019

North Carolina State University Raleigh, NC, US
Computer Science

2008 - 2013

Oak Ridge National Laboratory Oak Ridge, TN, US
Computer Science & Mathematics Division

Education

Updated: July 7th, 2016 16:55

2003 - 2008

Princeton University Princeton, NJ, US
PhD Mathematics Mathematics

1999 - 2003

Georgia Institute of Technology Atlanta, GA, US
B.S. Applied Mathematics; B.S. Computer Science

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2024) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.