Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

30 résultats
Page :
triés par
Image document

Fast winning strategies for the attacker in eternal domination

 Guillaume Bagan , Nicolas Bousquet , Nacim Oijid , Théo Pierron
2024
Pré-publication, Document de travail hal-04501118v1
Image document

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⟩
Communication dans un congrès hal-03773011v1

Extremal Independent Set Reconfiguration

 Nicolas Bousquet , Bastien Durain , Théo Pierron , Stéphan Thomassé
The Electronic Journal of Combinatorics, 2023, 30 (3), ⟨10.37236/11771⟩
Article dans une revue hal-04323655v1

Density Maximizers of Layered Permutations

 Adam Kabela , Daniel Kráľ , Jonathan A Noel , Théo Pierron
The Electronic Journal of Combinatorics, 2022, 29 (3), ⟨10.37236/10781⟩
Article dans une revue hal-03773074v1

Improved pyrotechnics : Closer to the burning graph conjecture

 Paul Bastide , Marthe Bonamy , Anthony Bonato , Pierre Charbit , Shahin Kamali , et al.
2022
Pré-publication, Document de travail hal-03773088v1
Image document

Induction Schemes : From Language Separation to Graph Colorings

 Théo Pierron
Programming Languages [cs.PL]. Université de Bordeaux, 2019. English. ⟨NNT : 2019BORD0119⟩
Thèse tel-02303422v1
Image document

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, Strasbourg, France. ⟨10.4230/LIPIcs.OPODIS.2021.22⟩
Communication dans un congrès hal-03610456v1
Image document

On the signed chromatic number of some classes of graphs

 Julien Bensmail , Sandip Das , Soumen Nandi , Théo Pierron , Sagnik Sen , et al.
Discrete Mathematics, 2022, 345 (2), pp.112664. ⟨10.1016/j.disc.2021.112664⟩
Article dans une revue hal-02947399v2

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
Communication dans un congrès hal-02264675v1
Image document

(Sub)linear kernels for edge modification problems toward structured graph classes

 Gabriel Bathie , Nicolas Bousquet , Yixin Cao , Yuping Ke , Théo Pierron
Algorithmica, 2022, 84 (11), pp.3338-3364. ⟨10.1007/s00453-022-00969-1⟩
Article dans une revue hal-04084691v1
Image document

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
Algorithmica, 2022, 84 (5), pp.1183-1212. ⟨10.1007/s00453-021-00918-4⟩
Article dans une revue hal-03658581v1

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⟩
Communication dans un congrès hal-02488310v1

Parameterized Complexity of Edge-Coloured and Signed Graph Homomorphism Problems

 Florent Foucaud , Hervé Hocquard , Dimitri Lajou , Valia Mitsou , Theo Pierron
IPEC 2019, Sep 2019, Munich, Germany. pp.15:1-16, ⟨10.4230/LIPIcs.IPEC.2019.15⟩
Communication dans un congrès hal-02491871v1
Image document

Coloring squares of graphs with mad constraints

 Hervé Hocquard , Seog-Jin Kim , Théo Pierron
Discrete Applied Mathematics, 2019, 271, pp.64 - 73. ⟨10.1016/j.dam.2019.08.011⟩
Article dans une revue hal-03488602v1
Image document

Pushable chromatic number of graphs with degree constraints

 Julien Bensmail , Sandip Das , Soumen Nandi , Soumyajit Paul , Théo Pierron , et al.
Discrete Mathematics, 2021, 344 (1), pp.112151. ⟨10.1016/j.disc.2020.112151⟩
Article dans une revue hal-02373515v2

The smallest 5-chromatic tournament

 Thomas Bellitto , Nicolas Bousquet , Adam Kabela , Théo Pierron
Mathematics of Computation, In press, 93 (345), pp.443-458. ⟨10.1090/mcom/3887⟩
Article dans une revue hal-04323716v1
Image document

Recolouring planar graphs of girth at least five

 Valentin Bartier , Nicolas Bousquet , Carl Feghali , Marc Heinrich , Benjamin Moore , et al.
2022
Pré-publication, Document de travail hal-03773048v1

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

 Nicolas Bousquet , Valentin Gledel , Jonathan Narboni , Théo Pierron
Computing in Geometry and Topology, 2023, ⟨10.57717/cgt.v2i1.36⟩
Article dans une revue hal-04323643v1

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

 Nicolas Bousquet , Laurent Feuilloley , Théo Pierron
35th International Symposium on Distributed Computing, (DISC)2021,, Oct 2021, Freiburg, Germany. ⟨10.4230/LIPIcs.DISC.2021.49⟩
Communication dans un congrès hal-03394564v1

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

 Marthe Bonamy , Théo Pierron , Eric Sopena
CoRR, 2019, abs/1904.12060
Article dans une revue hal-02527065v1
Image document

Complexity of planar signed graph homomorphisms to cycles

 François Dross , Florent Foucaud , Valia Mitsou , Pascal Ochem , Théo Pierron
Discrete Applied Mathematics, 2020, 284, pp.166-178. ⟨10.1016/j.dam.2020.03.029⟩
Article dans une revue hal-02990576v1
Image document

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⟩
Communication dans un congrès hal-03671173v1

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
Communication dans un congrès hal-03596213v1
Image document

PACE Solver Description: µSolver - Heuristic Track *

 Valentin Bartier , Gabriel Bathie , Nicolas Bousquet , Marc Heinrich , Théo Pierron , et al.
16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Nov 2021, Lisbon, Portugal. ⟨10.4230/LIPIcs.IPEC.2021.33⟩
Communication dans un congrès hal-04084587v1
Image document

Improved square coloring of planar graphs

 Nicolas Bousquet , Quentin Deschamps , Lucas de Meyer , Théo Pierron
Discrete Mathematics, 2022, 346 (4), pp.113288. ⟨10.1016/j.disc.2022.113288⟩
Article dans une revue hal-03897415v1

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.
Algorithmica, 2021, 83 (3), pp.822-852. ⟨10.1007/s00453-020-00747-x⟩
Article dans une revue hal-03394356v1
Image document

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⟩
Communication dans un congrès hal-03772974v1
Image document

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

 Gabriel Bathie , Nicolas Bousquet , Yixin Cao , Yuping Ke , Théo Pierron
16th International Symposium on Parameterized and Exact Computation (IPEC 2021), Sep 2021, Lisboa, Portugal. ⟨10.4230/LIPIcs.IPEC.2021.8⟩
Communication dans un congrès hal-03773065v1

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
Pré-publication, Document de travail hal-02402919v1

Every planar graph with $\Delta\geqslant 8$ is totally $(\Delta+2)$-choosable

 Marthe Bonamy , Théo Pierron , Eric Sopena
2019
Pré-publication, Document de travail hal-02402914v1
Page :