Topological minors in graphs of large girth
Journal of Combinatorial Theory Series B
Turán Numbers of Bipartite Graphs and Related Ramsey-Type Questions
Combinatorics, Probability and Computing
Large Topological Cliques in Graphs Without a 4-Cycle
Combinatorics, Probability and Computing
A Note on Vertex-Disjoint Cycles
Combinatorics, Probability and Computing
Extremal connectivity for topological cliques in bipartite graphs
Journal of Combinatorial Theory Series B
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
Rank-width and tree-width of H-minor-free graphs
European Journal of Combinatorics
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
European Journal of Combinatorics
Minors in random and expanding hypergraphs
Proceedings of the twenty-seventh annual symposium on Computational geometry
List-coloring graphs without subdivisions and without immersions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
ACM Transactions on Algorithms (TALG)
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
European Journal of Combinatorics
| Hi-index | 0.00 |