Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

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

Strong edge coloring sparse graphs

 Julien Bensmail , Marthe Bonamy , Hervé Hocquard
Electronic Notes in Discrete Mathematics, 2015, The Eight European Conference on Combinatorics, Graph Theory and Applications, EuroComb 2015, 49, pp.773-778. ⟨10.1016/j.endm.2015.06.104⟩
Article dans une revue lirmm-01264420v1

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

Distributed Recoloring

 Marthe Bonamy , Paul Ouvrard , Mikaël Rabie , Jukka Suomela , Jara Uitto
32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15-19, 2018, 2018, London, United Kingdom. pp.12:1--12:17, ⟨10.4230/LIPIcs.DISC.2018.12⟩
Communication dans un congrès hal-02527069v1

The Interactive Sum Choice Number of Graphs

 Marthe Bonamy , Kitty Meeks
Electron. Notes Discret. Math., 2017, 61, pp.139--145. ⟨10.1016/j.endm.2017.06.031⟩
Article dans une revue hal-02527074v1

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

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

Frozen (Δ + 1)-colourings of bounded degree graphs

 Marthe Bonamy , Nicolas Bousquet , Guillem Perarnau
Combinatorics, Probability and Computing, 2021, 30 (3), pp.330-343. ⟨10.1017/S0963548320000139⟩
Article dans une revue hal-03829750v1

Graphs of bounded cliquewidth are polynomially $\chi$-bounded

 Marthe Bonamy , Michał Pilipczuk
2019
Pré-publication, Document de travail hal-02402904v1

Recognizing Graphs Close to Bipartite Graphs

 Marthe Bonamy , Konrad K. Dabrowski , Carl Feghali , Matthew Johnson , Daniël Paulusma
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017, August 21-25, 2017 - Aalborg, Denmark, 2017, Aalborg, Denmark. pp.70:1--70:14, ⟨10.4230/LIPIcs.MFCS.2017.70⟩
Communication dans un congrès hal-02527078v1
Image document

On the diameter of reconfiguration graphs for vertex colourings

 Marthe Bonamy , Matthew Johnson , Ioannis Lignos , Viresh Patel , Daniël Paulusma
EuroComb'11: European Conference on Combinatorics, Graph Theory and Applications, Aug 2011, Budapest, Hungary. pp.161-166
Communication dans un congrès lirmm-00782875v1

Gallai's path decomposition in planar graphs

 Alexandre Blanché , Marthe Bonamy , Nicolas Bonichon
2022
Pré-publication, Document de travail hal-03590639v1

Graphs of bounded cliquewidth are polynomially \(χ\)-bounded

 Marthe Bonamy , Michal Pilipczuk
CoRR, 2019, abs/1910.00697
Article dans une revue hal-02527066v1

On Directed Feedback Vertex Set parameterized by treewidth

 Marthe Bonamy , Lukasz Kowalik , Jesper Nederlof , Michal Pilipczuk , Arkadiusz Socala , et al.
CoRR, 2017, abs/1707.01470
Article dans une revue hal-02527080v1

Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable

 Marthe Bonamy , Benjamin Lévêque , Alexandre Pinlou
Discrete Mathematics, 2014, 317, pp.19-32. ⟨10.1016/j.disc.2013.10.022⟩
Article dans une revue lirmm-01233453v1

Independent feedback vertex sets for graphs of bounded diameter

 Marthe Bonamy , Konrad K. Dabrowski , Carl Feghali , Matthew Johnson , Daniël Paulusma
Inf. Process. Lett., 2018, 131, pp.26--32. ⟨10.1016/j.ipl.2017.11.004⟩
Article dans une revue hal-02527068v1

Incidence coloring of graphs with high maximum average degree

 Marthe Bonamy , Hervé Hocquard , Samia Kerdjoudj , André Raspaud
Discrete Applied Mathematics, 2017, 227, pp.29--43. ⟨10.1016/j.dam.2017.04.029⟩
Article dans une revue hal-02527073v1
Image document

Global discharging methods for coloring problems in graphs

 Marthe Bonamy
Discrete Mathematics [cs.DM]. Université de Montpellier, 2015. English. ⟨NNT : ⟩
Thèse tel-02083632v1

Token Sliding on Chordal Graphs

 Nicolas Bousquet , Marthe Bonamy
WG (Workshop on Graphs), Jun 2017, Heeze, Netherlands
Communication dans un congrès hal-01653135v1

Surfaces have (asymptotic) dimension 2

 Marthe Bonamy , Nicolas Bousquet , Louis Esperet , Carla Groenland , François Pirot , et al.
2020
Pré-publication, Document de travail hal-02893350v1

Recoloring bounded treewidth graphs

 Marthe Bonamy , Nicolas Bousquet
LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, 2013, Playa del Carmen, Mexico. pp.293-297, ⟨10.1016/j.endm.2013.10.040⟩
Communication dans un congrès lirmm-01264399v1

Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable

 Marthe Bonamy
SIAM Journal on Discrete Mathematics, 2015, 29 (3), pp.1735-1763. ⟨10.1137/130927449⟩
Article dans une revue lirmm-01264429v1

List coloring the square of sparse graphs with large degree

 Marthe Bonamy , Benjamin Lévêque , Alexandre Pinlou
European Journal of Combinatorics, 2014, 41, pp.128-137. ⟨10.1016/j.ejc.2014.03.006⟩
Article dans une revue lirmm-01233445v1

Frozen $(\Delta+1)$-colourings of bounded degree graphs

 Marthe Bonamy , Nicolas Bousquet , Guillem Perarnau
2019
Pré-publication, Document de travail hal-02402918v1
Image document

EPTAS for Max Clique on Disks and Unit Balls

 Marthe Bonamy , Edouard Bonnet , Nicolas Bousquet , Pierre Charbit , Stéphan Thomassé
FOCS: Foundations of Computer Science, Oct 2018, Paris, France. ⟨10.1109/FOCS.2018.00060⟩
Communication dans un congrès hal-01962198v1

Distributed coloring in sparse graphs with fewer colors

 Pierre Aboulker , Marthe Bonamy , Nicolas Bousquet , Louis Esperet
ACM Symposium on Principles of Distributed Computing (PODC 2018), Jul 2018, Egham, United Kingdom. pp.419-425, ⟨10.1145/3212734.3212740⟩
Communication dans un congrès hal-01710649v1
Image document

The Perfect Matching Reconfiguration Problem

 Marthe Bonamy , Nicolas Bousquet , Marc Heinrich , Takehiro Ito , Yusuke Kobayashi , et al.
MFCS 2019 - 44th International Symposium on Mathematical Foundations of Computer Science, Aug 2019, Aachen, Germany. pp.1-14, ⟨10.4230/LIPIcs.MFCS.2019.80⟩
Communication dans un congrès hal-02335588v1
Image document

EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs

 Marthe Bonamy , Edouard Bonnet , Nicolas Bousquet , Pierre Charbit , Panos Giannopoulos , et al.
Journal of the ACM (JACM), 2021, 68 (2), pp.1-38. ⟨10.1145/3433160⟩
Article dans une revue hal-03107441v1
Image document

A 14$k$-Kernel for Planar Feedback Vertex Set via Region Decomposition

 Marthe Bonamy , Lukasz Kowalik
IPEC 2014 - 9th International Symposium on Parameterized and Exact Computation, Sep 2014, Wroclaw, Poland. pp.97-109, ⟨10.1007/978-3-319-13524-3_9⟩
Communication dans un congrès lirmm-01264417v1
Image document

On the effect of symmetry requirement for rendezvous on the complete graph

 Marthe Bonamy , Michał Pilipczuk , Jean-Sébastien Sereni , Richard Weber
Mathematics of Operations Research, 2023, 48 (2), pp.942-953. ⟨10.1287/moor.2022.1288⟩
Article dans une revue hal-03797712v1
Image document

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

 Marthe Bonamy , Matthew Johnson , Ioannis Lignos , Viresh Patel , Daniël Paulusma
Journal of Combinatorial Optimization, 2012, pp.15. ⟨10.1007/s10878-012-9490-y⟩
Article dans une revue lirmm-00782882v1
Page :