Density Maximizers of Layered Permutations
Adam Kabela
,
Daniel Kráľ
,
Jonathan A Noel
,
Théo Pierron
Journal articles
hal-03773074v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Improved pyrotechnics : Closer to the burning graph conjecture
Paul Bastide
,
Marthe Bonamy
,
Anthony Bonato
,
Pierre Charbit
,
Shahin Kamali
,
et al.
2022
Preprints, Working Papers, ...
hal-03773088v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
What Can Be Certified Compactly?
Nicolas Bousquet
,
Laurent Feuilloley
,
Théo Pierron
PODC '22: ACM Symposium on Principles of Distributed Computing , Jul 2022, Salerno, Italy. pp.131-140,
⟨10.1145/3519270.3538416⟩
Conference papers
hal-03773011v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Local Certification of Graph Decompositions and Applications to Minor-Free Classes
Nicolas Bousquet
,
Laurent Feuilloley
,
Théo Pierron
Conference papers
hal-03610456v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Induction Schemes : From Language Separation to Graph Colorings
Théo Pierron
Theses
tel-02303422v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
On the signed chromatic number of some classes of graphs
Julien Bensmail
,
Sandip Das
,
Soumen Nandi
,
Théo Pierron
,
Sagnik Sen
,
et al.
Journal articles
hal-02947399v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Coloring squares of graphs with mad constraints
Hervé Hocquard
,
Seog-Jin Kim
,
Théo Pierron
Journal articles
hal-03488602v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Recolouring planar graphs of girth at least five
Valentin Bartier
,
Nicolas Bousquet
,
Carl Feghali
,
Marc Heinrich
,
Benjamin Moore
,
et al.
2022
Preprints, Working Papers, ...
hal-03773048v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Pushable chromatic number of graphs with degree constraints
Julien Bensmail
,
Sandip Das
,
Soumen Nandi
,
Soumyajit Paul
,
Théo Pierron
,
et al.
Journal articles
hal-02373515v2
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems
Florent Foucaud
,
Hervé Hocquard
,
Dimitri Lajou
,
Valia Mitsou
,
Theo Pierron
Conference papers
hal-02491871v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Every planar graph of maximum degree 8 is totally 10-choosable
Marthe Bonamy
,
Theo Pierron
,
Eric Sopena
10th International Colloquium on Graph Theory and combinatorics, ICGT'18 , 2018, Lyon, France
Conference papers
hal-02264675v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
(Sub)linear kernels for edge modification problems toward structured graph classes
Gabriel Bathie
,
Nicolas Bousquet
,
Yixin Cao
,
Yuping Ke
,
Théo Pierron
Journal articles
hal-04084691v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Graph Modification for Edge-Coloured and Signed Graph Homomorphism Problems: Parameterized and Classical Complexity
Florent Foucaud
,
Hervé Hocquard
,
Dimitri Lajou
,
Valia Mitsou
,
Théo Pierron
Journal articles
hal-03658581v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Quantifier Alternation for Infinite Words
Théo Pierron
,
Thomas Place
,
Marc Zeitoun
9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16) , Apr 2016, Eindhoven, Netherlands. pp.234-251,
⟨10.1007/978-3-662-49630-5_14⟩
Conference papers
hal-02488310v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Every planar graph with $\Delta\geqslant 8$ is totally $(\Delta+2)$-choosable
Marthe Bonamy
,
Théo Pierron
,
Eric Sopena
2019
Preprints, Working Papers, ...
hal-02402914v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Graph Isomorphism for $(H_1,H_2)$-free Graphs: An Almost Complete Dichotomy
Marthe Bonamy
,
Nicolas Bousquet
,
Konrad K. Dabrowski
,
Matthew Johnson
,
Daniël Paulusma
,
et al.
2019
Preprints, Working Papers, ...
hal-02402919v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes
Gabriel Bathie
,
Nicolas Bousquet
,
Yixin Cao
,
Yuping Ke
,
Théo Pierron
Conference papers
hal-03773065v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Improved square coloring of planar graphs
Nicolas Bousquet
,
Quentin Deschamps
,
Lucas de Meyer
,
Théo Pierron
Journal articles
hal-03897415v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy
Nicolas Bousquet
,
Marthe Bonamy
,
Konrad Dabrowski
,
Matthew Johnson
,
Daniël Paulusma
,
et al.
Journal articles
hal-03394356v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Local certification of graph decompositions and applications to minor-free classes
Nicolas Bousquet
,
Laurent Feuilloley
,
Théo Pierron
25th International Conference on Principles of Distributed Systems, OPODIS 2021 , Dec 2021, Starsbourg, France. pp.22:1--22:17,
⟨10.4230/LIPIcs.OPODIS.2021.22⟩
Conference papers
hal-03772974v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
PACE Solver Description: µSolver - Heuristic Track *
Valentin Bartier
,
Gabriel Bathie
,
Nicolas Bousquet
,
Marc Heinrich
,
Théo Pierron
,
et al.
Conference papers
hal-04084587v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Every planar graph with \(Δ\)\(≥q\)8 is totally (\(Δ\)+2)-choosable
Marthe Bonamy
,
Théo Pierron
,
Eric Sopena
CoRR , 2019, abs/1904.12060
Journal articles
hal-02527065v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes
Nicolas Bousquet
,
Laurent Feuilloley
,
Théo Pierron
Conference papers
hal-03394564v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Complexity of planar signed graph homomorphisms to cycles
François Dross
,
Florent Foucaud
,
Valia Mitsou
,
Pascal Ochem
,
Théo Pierron
Journal articles
hal-02990576v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters
Valentin Bartier
,
Gabriel Bathie
,
Nicolas Bousquet
,
Marc Heinrich
,
Théo Pierron
,
et al.
16th International Symposium on Parameterized and Exact Computation, IPEC 2021 , Sep 2021, Lisbonne, Portugal. pp.29:1-29:4,
⟨10.4230/LIPIcs.IPEC.2021.29⟩
Conference papers
hal-03671173v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
PACE Challenge 2021: heuristique pour le cluster editing problem
Valentin Bartier
,
Bathie Gabriel
,
Nicolas Bousquet
,
Marc Heinrich
,
Théo Pierron
,
et al.
23ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision , INSA Lyon, Feb 2022, Villeurbanne - Lyon, France
Conference papers
hal-03596213v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More