Jean-Florent Raymond

CoRR, July, 2025

Linear colorings of graphs.

[BibT_eX]

[DOI]

CoRR, May, 2025

Profile and neighbourhood complexity of graphs with excluded minors and tree-structured graphs.

[BibT_eX]

[DOI]

CoRR, January, 2025

Young domination on Hamming rectangles.

[BibT_eX]

[DOI]

CoRR, January, 2025

Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set.

[BibT_eX]

[DOI]

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

2024

Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746].

[BibT_eX]

[DOI]

Jan Dreier

Jakub Gajarský

Yiting Jiang

Patrice Ossona de Mendez

Discret. Math., January, 2024

Sparse graphs without long induced paths.

[BibT_eX]

[DOI]

Oscar Defrain

J. Comb. Theory B, 2024

Long induced paths and forbidden patterns: Polylogarithmic bounds.

[BibT_eX]

[DOI]

Julien Duron

Louis Esperet

CoRR, 2024

Long induced paths in sparse graphs and graphs with forbidden patterns.

[BibT_eX]

[DOI]

Julien Duron

Louis Esperet

Virginia Ardévol Martínez

CoRR, 2024

Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2024

Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Local Certification of Geometric Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Kick the Cliques.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Parameterized and Exact Computation, 2024

2023

A lower bound for constant-size local certification.

[BibT_eX]

[DOI]

Theor. Comput. Sci., September, 2023

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.

[BibT_eX]

[DOI]

CoRR, 2023

Long Induced Paths in Minor-Closed Graph Classes and Beyond.

[BibT_eX]

[DOI]

Claire Hilaire

Electron. J. Comb., 2023

2022

Twin-width and generalized coloring numbers.

[BibT_eX]

[DOI]

Jan Dreier

Jakub Gajarský

Yiting Jiang

Patrice Ossona de Mendez

Discret. Math., 2022

2021

Packing and Covering Induced Subdivisions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes.

[BibT_eX]

[DOI]

Michal Pilipczuk

Marcin Wrochna

SIAM J. Discret. Math., 2021

A Menger-like property of tree-cut width.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2021

2020

Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2020

On the Tractability of Optimization Problems on H-Graphs.

[BibT_eX]

[DOI]

Fedor V. Fomin

Petr A. Golovach

Algorithmica, 2020

2019

Induced minors and well-quasi-ordering.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Cutwidth: Obstructions and Algorithmic Aspects.

[BibT_eX]

[DOI]

Michal Pilipczuk

Marcin Wrochna

Algorithmica, 2019

Lean Tree-Cut Decompositions: Obstructions and Algorithms.

[BibT_eX]

[DOI]

Wouter Cames van Batenburg

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Enumerating Minimal Dominating Sets in Triangle-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

A tight Erdős-Pósa function for planar minors.

[BibT_eX]

[DOI]

Tony Huynh

Gwenaël Joret

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

A Tight Erdös-Pósa Function for Wheel Minors.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Multigraphs without large bonds are wqo by contraction.

[BibT_eX]

[DOI]

Marcin Jakub Kaminski

Théophile Trunck

J. Graph Theory, 2018

Polynomial expansion and sublinear separators.

[BibT_eX]

[DOI]

Louis Esperet

Eur. J. Comb., 2018

Hitting minors, subdivisions, and immersions in tournaments.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2018

Well-quasi-ordering H-contraction-free graphs.

[BibT_eX]

[DOI]

Marcin Jakub Kaminski

Théophile Trunck

Discret. Appl. Math., 2018

An O(log OPT)-Approximation for Covering and Packing Minor Models of θ<sub>r</sub>.

[BibT_eX]

[DOI]

Dimitris Chatzidimitriou

Algorithmica, 2018

2017

Low Polynomial Exclusion of Planar Graph Patterns.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Packing and covering immersion-expansions of planar sub-cubic graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Minors in graphs of large ϴ<sub>r</sub>-girth.

[BibT_eX]

[DOI]

Dimitris Chatzidimitriou

Eur. J. Comb., 2017

Recent techniques and results on the Erdős-Pósa property.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

2016

Structural and algorithmic aspects of partial orderings of graphs. (Aspects structurels et algorithmiques des ordres partiels sur les graphes).

[BibT_eX]

[DOI]

PhD thesis, 2016

Scattered packings of cycles.

[BibT_eX]

[DOI]

Aistis Atminas

Marcin Kaminski

Theor. Comput. Sci., 2016

An edge variant of the Erdős-Pósa property.

[BibT_eX]

[DOI]

Discret. Math., 2016

Packing and Covering Immersion Models of Planar Subcubic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2016

2015

An O(\log \mathrmOPT) O ( log OPT ) -Approximation for Covering/Packing Minor Models of θ _r θ r.

[BibT_eX]

[DOI]

Dimitris Chatzidimitriou

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014

Induced packings of cycles.

[BibT_eX]

[DOI]

Aistis Atminas

Marcin Kaminski

CoRR, 2014

2013

Polynomial Gap Extensions of the Erdős-Pósa Theorem.

[BibT_eX]

[DOI]