( en | de | ru )

 

Disambiguation of "Sullivan, Blair D."

Author of the publication

copydeleteadd this publication to your clipboard
Being Even Slightly Shallow Makes Life Hard.

, , , and . MFCS, volume 83 of LIPIcs, page 79:1-79:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Terence Sullivan

Mark Sullivan

Richard Anthony Blair

Alistair Blair

Judit M Blair

 

Other publications of authors with the same name

Parameterized algorithms for identifying gene co-expression modules via weighted clique decomposition., , , , and . ACDA, page 111-122. SIAM, (2021)Mining Maximal Induced Bicliques using Odd Cycle Transversals., , and . CoRR, (2018)Tree decompositions and social graphs., , and . CoRR, (2014)Reducing Access Disparities in Networks using Edge Augmentation., , , , and . CoRR, (2022)Open Problems in (Hyper)Graph Decomposition., , , , , , , , , and 19 other author(s). CoRR, (2023)Minimizing Congestion for Balanced Dominators., , and . KDD, page 1264-1274. ACM, (2022)Approximating Vertex Cover using Structural Rounding., , , and . ALENEX, page 70-80. SIAM, (2020)Structural sparsity of complex networks: Bounded expansion in random models and real-world graphs., , , , , and . J. Comput. Syst. Sci., (2019)Evaluating OpenMP Tasking at Scale for the Computation of Graph Hyperbolicity., , , and . IWOMP, volume 8122 of Lecture Notes in Computer Science, page 71-83. Springer, (2013)Polynomial Treedepth Bounds in Linear Colorings., , , and . Algorithmica, 83 (1): 361-386 (2021)