Ka,k minors in graphs of bounded tree-width
Journal of Combinatorial Theory Series B
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Terminal backup, 3D matching, and covering cubic graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Half integral packing, Erdős-Posá-property and graph minors
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
The extremal function for 3-linked graphs
Journal of Combinatorial Theory Series B
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
List-coloring graphs without K4,k-minors
Discrete Applied Mathematics
A shorter proof of the graph minor algorithm: the unique linkage theorem
Proceedings of the forty-second ACM symposium on Theory of computing
Proceedings of the forty-second ACM symposium on Theory of computing
Linkless and flat embeddings in 3-space and the unknot problem
Proceedings of the twenty-sixth annual symposium on Computational geometry
Large non-planar graphs and an application to crossing-critical graphs
Journal of Combinatorial Theory Series B
A simpler algorithm and shorter proof for the graph minor decomposition
Proceedings of the forty-third annual ACM symposium on Theory of computing
Terminal Backup, 3D Matching, and Covering Cubic Graphs
SIAM Journal on Computing
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Minors in large almost-5-connected non-planar graphs
Journal of Graph Theory
Hi-index | 0.00 |