Titolo |
Pubblicato in |
Anno |

The Grid Theorem for vertex-minors |
JOURNAL OF COMBINATORIAL THEORY |
2023 |

Excluding a Ladder |
COMBINATORICA |
2022 |

Obstructions for bounded shrub-depth and rank-depth |
JOURNAL OF COMBINATORIAL THEORY |
2021 |

A Unified Erdős–Pósa Theorem for Constrained Cycles |
COMBINATORICA |
2019 |

Chi-boundedness of graph classes excluding wheel vertex-minors |
JOURNAL OF COMBINATORIAL THEORY |
2019 |

Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor |
JOURNAL OF GRAPH THEORY |
2019 |

Forcing clique immersions through chromatic number |
EUROPEAN JOURNAL OF COMBINATORICS |
2019 |

K-6 minors in large 6-connected graphs |
JOURNAL OF COMBINATORIAL THEORY |
2018 |

A new proof of the flat wall theorem |
JOURNAL OF COMBINATORIAL THEORY |
2018 |

Space proof complexity for random 3-CNFs |
INFORMATION AND COMPUTATION |
2017 |

Rooted grid minors |
JOURNAL OF COMBINATORIAL THEORY |
2017 |

Half-integral linkages in highly connected directed graphs |
Leibniz International Proceedings in Informatics, LIPIcs |
2017 |

K6minors in 6-connected graphs of bounded tree-width |
JOURNAL OF COMBINATORIAL THEORY |
2017 |

Displaying blocking pairs in signed graphs |
EUROPEAN JOURNAL OF COMBINATORICS |
2016 |

Stabilizer theorems for even cycle matroids |
JOURNAL OF COMBINATORIAL THEORY |
2016 |

A structure theorem for strong immersions |
JOURNAL OF GRAPH THEORY |
2016 |

An exact characterization of tractable demand patterns for maximum disjoint path problems |
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms |
2015 |

The structure of graphs not admitting a fixed immersion |
JOURNAL OF COMBINATORIAL THEORY |
2015 |