Minors in graphs of large girth
Random Structures & Algorithms
Graphs without Large Complete Minors are Quasi-Random
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Forcing unbalanced complete bipartite minors
European Journal of Combinatorics
Disjoint Kr-minors in large graphs with given average degree
European Journal of Combinatorics - Special issue: Topological graph theory II
On the structure of k-connected graphs without Kk-minor
European Journal of Combinatorics - Special issue: Topological graph theory II
Algorithmic Graph Minor Theory: Decomposition, Approximation, and Coloring
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Extremal connectivity for topological cliques in bipartite graphs
Journal of Combinatorial Theory Series B
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Object location using path separators
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
A relaxed Hadwiger's Conjecture for list colorings
Journal of Combinatorial Theory Series B
Strong-diameter decompositions of minor free graphs
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Disjoint complete minors and bipartite minors
European Journal of Combinatorics
The extremal function for K9 minors
Journal of Combinatorial Theory Series B
Fractional coloring and the odd Hadwiger's conjecture
European Journal of Combinatorics
Grad and classes with bounded expansion I. Decompositions
European Journal of Combinatorics
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Additive approximation algorithms for list-coloring minor-closed class of graphs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized Complexity for Domination Problems on Degenerate Graphs
Graph-Theoretic Concepts in Computer Science
List-coloring graphs without K4,k-minors
Discrete Applied Mathematics
A weakening of the odd hadwiger's conjecture
Combinatorics, Probability and Computing
Linear connectivity forces large complete bipartite minors
Journal of Combinatorial Theory Series B
Hadwiger's conjecture is decidable
Proceedings of the forty-first annual ACM symposium on Theory of computing
Note: Note on coloring graphs without odd-Kk-minors
Journal of Combinatorial Theory Series B
Approximation Algorithms via Structural Results for Apex-Minor-Free Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
A linear-time algorithm to find a separator in a graph excluding a minor
ACM Transactions on Algorithms (TALG)
Proceedings of the forty-second ACM symposium on Theory of computing
The parameterized complexity of editing graphs for bounded degeneracy
Theoretical Computer Science
Rank-width and tree-width of H-minor-free graphs
European Journal of Combinatorics
Contractibility and the Hadwiger Conjecture
European Journal of Combinatorics
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Decomposition, approximation, and coloring of odd-minor-free graphs
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
An (almost) linear time algorithm for odd cycles transversal
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
The edge-density for K2,t minors
Journal of Combinatorial Theory Series B
Kernelization hardness of connectivity problems in d-degenerate graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Contraction decomposition in h-minor-free graphs and algorithmic applications
Proceedings of the forty-third annual ACM symposium on Theory of computing
Minors in random and expanding hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
Complete Minors and Independence Number
SIAM Journal on Discrete Mathematics
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
European Journal of Combinatorics
Kernelization hardness of connectivity problems in d-degenerate graphs
Discrete Applied Mathematics
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Finding a maximum induced degenerate subgraph faster than 2n
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Linear kernels and single-exponential algorithms via protrusion decompositions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Beautiful conjectures in graph theory
European Journal of Combinatorics
| Hi-index | 0.00 |