| Publication | Date of Publication | Type |
|---|
Hardness of the generalized coloring numbers
European Journal of Combinatorics | 2024-10-07 | Paper |
| Parameterized complexity of gerrymandering | 2024-05-29 | Paper |
A color-avoiding approach to subgraph counting in bounded expansion classes
Algorithmica | 2023-08-17 | Paper |
An Updated Experimental Evaluation of Graph Bipartization Methods
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
scientific article; zbMATH DE number 7525474 (Why is no real title available?)
(available as arXiv preprint) | 2022-05-11 | Paper |
On the threshold of intractability
Journal of Computer and System Sciences | 2021-11-25 | Paper |
Tree decompositions and social graphs
Internet Mathematics | 2021-03-26 | Paper |
Polynomial treedepth bounds in linear colorings
Algorithmica | 2021-02-01 | Paper |
Approximating V<scp>ertex</scp> C<scp>over</scp> using Structural Rounding
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
scientific article; zbMATH DE number 7204413 (Why is no real title available?)
(available as arXiv preprint) | 2020-05-26 | Paper |
A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
Journal of Computer and System Sciences | 2019-08-07 | Paper |
Subgraph centrality and walk-regularity
Linear Algebra and its Applications | 2019-05-29 | Paper |
Treedepth bounds in linear colorings
(available as arXiv preprint) | 2018-11-22 | Paper |
Optimizing adiabatic quantum program compilation using a graph-theoretic framework
Quantum Information Processing | 2018-08-07 | Paper |
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
(available as arXiv preprint) | 2018-06-07 | Paper |
Walk entropy and walk-regularity
Linear Algebra and its Applications | 2018-04-12 | Paper |
Walk entropy and walk-regularity
Linear Algebra and its Applications | 2018-04-12 | Paper |
A fast parameterized algorithm for co-path set
(available as arXiv preprint) | 2018-04-10 | Paper |
Hyperbolicity, degeneracy, and expansion of random intersection graphs
Lecture Notes in Computer Science | 2016-01-08 | Paper |
On the threshold of intractability
Lecture Notes in Computer Science | 2015-11-19 | Paper |
Adiabatic quantum programming: minor embedding with hard faults
Quantum Information Processing | 2014-06-13 | Paper |
| On a conjecture of Andrica and Tomescu | 2014-03-24 | Paper |
On a conjecture of Andrica and Tomescu
(available as arXiv preprint) | 2014-03-24 | Paper |
A mathematical analysis of the R-MAT random graph generator
Networks | 2011-11-21 | Paper |
Counting paths in digraphs
European Journal of Combinatorics | 2010-04-27 | Paper |
| Heights in finite projective space, and a problem on directed graphs | 2009-05-26 | Paper |
Heights in finite projective space, and a problem on directed graphs
(available as arXiv preprint) | 2009-05-26 | Paper |
| Heights in finite projective space, and a problem on directed graphs | 2009-05-26 | Paper |
Cycles in dense digraphs
Combinatorica | 2008-10-21 | Paper |
