Théo Pierron

Eur. J. Comb., March, 2024

Local certification of graph decompositions and applications to minor-free classes.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2024

A note on highly connected K2,-minor free graphs.

[BibT_eX]

[DOI]

Alexandra Wesolek

Discret. Math., 2024

Oriented total-coloring of oriented graphs.

[BibT_eX]

[DOI]

Discret. Math., 2024

How local constraints influence network diameter and applications to LCL generalizations.

[BibT_eX]

[DOI]

CoRR, 2024

Local certification of forbidden subgraphs.

[BibT_eX]

[DOI]

CoRR, 2024

Fast winning strategies for the attacker in eternal domination.

[BibT_eX]

[DOI]

CoRR, 2024

Reconfiguration of Plane Trees in Convex Geometric Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable.

[BibT_eX]

[DOI]

Marthe Bonamy

Éric Sopena

J. Graph Theory, September, 2023

The smallest 5-chromatic tournament.

[BibT_eX]

[DOI]

Math. Comput., August, 2023

Strengthening a Theorem of Meyniel.

[BibT_eX]

[DOI]

Quentin Deschamps

Carl Feghali

Frantisek Kardos

Clément Legrand-Duchesne

SIAM J. Discret. Math., June, 2023

Improved square coloring of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., April, 2023

Recoloring Planar Graphs of Girth at Least Five.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., March, 2023

A note on highly connected K2, 𝓁-minor free graphs.

[BibT_eX]

[DOI]

Alexandra Wesolek

CoRR, 2023

Extremal Independent Set Reconfiguration.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

Improved Pyrotechnics: Closer to the Burning Number Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

A Note on the Flip Distance between Non-crossing Spanning Trees.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

2022

On the signed chromatic number of some classes of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2022

What can be certified compactly?

[BibT_eX]

[DOI]

CoRR, 2022

Density Maximizers of Layered Permutations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity.

[BibT_eX]

[DOI]

Algorithmica, 2022

(Sub)linear Kernels for Edge Modification Problems Toward Structured Graph Classes.

[BibT_eX]

[DOI]

Algorithmica, 2022

What Can Be Certified Compactly? Compact local certification of MSO properties in tree-like graphs.

[BibT_eX]

[DOI]

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

2021

Pushable chromatic number of graphs with degree constraints.

[BibT_eX]

[DOI]

Discret. Math., 2021

Improved pyrotechnics : Closer to the burning graph conjecture.

[BibT_eX]

[DOI]

CoRR, 2021

Local certification of MSO properties for bounded treedepth graphs.

[BibT_eX]

[DOI]

CoRR, 2021

Graph Isomorphism for (H1, H2)-Free Graphs: An Almost Complete Dichotomy.

[BibT_eX]

[DOI]

Algorithmica, 2021

Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes.

[BibT_eX]

[DOI]

Gabriel Bathie

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: μSolver - Heuristic Track.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters.

[BibT_eX]

[DOI]

Proceedings of the 16th International Symposium on Parameterized and Exact Computation, 2021

2020

Complexity of planar signed graph homomorphisms to cycles.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles.

[BibT_eX]

[DOI]

Ilkyoo Choi

Daniel W. Cranston

Comb., 2020

2019

Induction Schemes : From Language Separation to Graph Colorings. (Schémas d'induction : from languages separation to graph colorings).

[BibT_eX]

[DOI]

PhD thesis, 2019

Coloring squares of graphs with mad constraints.

[BibT_eX]

[DOI]

Hervé Hocquard

Seog-Jin Kim

Discret. Appl. Math., 2019

Every planar graph with Δ≥8 is totally (Δ+2)-choosable.

[BibT_eX]

[DOI]

Marthe Bonamy

Éric Sopena

CoRR, 2019

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems.

[BibT_eX]

[DOI]

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2016

Quantifier Alternation for Infinite Words.

[BibT_eX]

[DOI]