Marthe Bonamy

ORCID

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 109

Top Venues

CoRR

J. Comb. Theory, Ser. B

J. Graph Theory

Electron. J. Comb.

University of Montpellier, France (PHD)

Education History

University of Montpellier, France

PHD

Publications

Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni
On a recolouring version of Hadwiger's conjecture. J. Comb. Theory, Ser. B 164 (2024)
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. J. Comb. Theory B 167 (2024)
Marthe Bonamy, Michelle Delcourt, Richard Lang, Luke Postle
Edge-colouring graphs with local list sizes. J. Comb. Theory, Ser. B 165 (2024)
Marthe Bonamy, Vincent Delecroix, Clément Legrand-Duchesne
Kempe changes in degenerate graphs. Eur. J. Comb. 119 (2024)
Marthe Bonamy, Théo Pierron, Éric Sopena
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory 104 (1) (2023)
Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan
Separating the edges of a graph by a linear number of paths. CoRR (2023)
Marthe Bonamy
Exploring the Space of Colourings with Kempe Changes (Invited Talk). MFCS (2023)
Marthe Bonamy, Edouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. SODA (2023)
Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
On Vizing's edge colouring question. J. Comb. Theory, Ser. B 159 (2023)
Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory 104 (3) (2023)
Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni, Richard Weber
On the Effect of Symmetry Requirement for Rendezvous on the Complete Graph. Math. Oper. Res. 48 (2) (2023)
Marthe Bonamy, Patrice Ossona de Mendez, Éric Colin de Verdière, Mathilde Bouvel
Forty years of history. Eur. J. Comb. 111 (2023)
Paul Bastide, Marthe Bonamy, Anthony Bonato, Pierre Charbit, Shahin Kamali, Théo Pierron, Mikaël Rabie
Improved Pyrotechnics: Closer to the Burning Number Conjecture. Electron. J. Comb. 30 (4) (2023)
Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk
Partitioning edges of a planar graph into linear forests and a matching. CoRR (2023)
Marthe Bonamy, Thomas Perrett, Luke Postle
Colouring graphs with sparse neighbourhoods: Bounds and applications. J. Comb. Theory, Ser. B 155 (2022)
Marthe Bonamy, Tom Kelly, Peter Nelson, Luke Postle
by a fraction of Δ for graphs without large cliques. J. Comb. Theory, Ser. B 157 (2022)
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
Shorter Labeling Schemes for Planar Graphs. SIAM J. Discret. Math. 36 (3) (2022)
Marthe Bonamy, Nicolas Bousquet, Michal Pilipczuk, Pawel Rzazewski, Stéphan Thomassé, Bartosz Walczak
-free graphs with no large complete bipartite subgraphs. J. Comb. Theory, Ser. B 152 (2022)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24 (1) (2022)
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, Louis Esperet, Colin Geniet, Claire Hilaire, Stéphan Thomassé, Alexandra Wesolek
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth. CoRR (2022)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. CoRR (2021)
Marthe Bonamy, Paul Dorbec, Paul Ouvrard
Dominating sets reconfiguration under token sliding. Discret. Appl. Math. 301 (2021)
Marthe Bonamy, Oscar Defrain, Tereza Klimosová, Aurélie Lagoutte, Jonathan Narboni
On Vizing's edge colouring question. CoRR (2021)
Marthe Bonamy, Carla Groenland, Carole Muller, Jonathan Narboni, Jakub Pekárek, Alexandra Wesolek
A note on connected greedy edge colouring. Discret. Appl. Math. 304 (2021)
Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28 (4) (2021)
Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
A Tight Local Algorithm for the Minimum Dominating Set Problem in Outerplanar Graphs. DISC (2021)
Marthe Bonamy, Vincent Delecroix, Clément Legrand-Duchesne
Kempe changes in degenerate graphs. CoRR (2021)
Marthe Bonamy
Decomposing the edges of a graph into simpler structures. BCC (2021)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, Florian Sikora, Stéphan Thomassé
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs. J. ACM 68 (2) (2021)
Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. 30 (3) (2021)
Marthe Bonamy, Nicolas Bousquet, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma, Théo Pierron
-Free Graphs: An Almost Complete Dichotomy. Algorithmica 83 (3) (2021)
Marthe Bonamy, Kitty Meeks
The interactive sum choice number of graphs. Discret. Appl. Math. 292 (2021)
Marthe Bonamy, Marc Heinrich, Clément Legrand-Duchesne, Jonathan Narboni
On a recolouring version of Hadwiger's conjecture. CoRR (2021)
Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa
Tuza's Conjecture for Threshold Graphs. CoRR (2021)
Marthe Bonamy, Linda Cook, Carla Groenland, Alexandra Wesolek
A tight local algorithm for the minimum dominating set problem in outerplanar graphs. CoRR (2021)
Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni
A note on deterministic zombies. Discret. Appl. Math. 301 (2021)
Paul Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron, Mikaël Rabie
Improved pyrotechnics : Closer to the burning graph conjecture. CoRR (2021)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. J. Graph Theory 98 (1) (2021)
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
Optimal labelling schemes for adjacency, comparability, and reachability. STOC (2021)
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
Shorter Labeling Schemes for Planar Graphs. SODA (2020)
Marthe Bonamy, Bojan Mohar, Alexandra Wesolek
Limiting crossing numbers for geodesic drawings on the sphere. CoRR (2020)
Valentin Bartier, Laurine Bénéteau, Marthe Bonamy, Hoang La, Jonathan Narboni
A note on deterministic zombies. CoRR (2020)
Marthe Bonamy, Pierre Charbit, Oscar Defrain, Gwenaël Joret, Aurélie Lagoutte, Vincent Limouzy, Lucas Pastor, Jean-Sébastien Sereni
Revisiting a Theorem by Folkman on Graph Colouring. Electron. J. Comb. 27 (1) (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of colorings under Kempe changes. Theor. Comput. Sci. 838 (2020)
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michal Pilipczuk, Jean-Florent Raymond
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants. ACM Trans. Algorithms 16 (3) (2020)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Shortest Reconfiguration of Colorings Under Kempe Changes. STACS (2020)
Marthe Bonamy, Michal Pilipczuk, Jean-Sébastien Sereni
On the effect of symmetry requirement for rendezvous on the complete graph. CoRR (2020)
Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
Avoidable Paths in Graphs. Electron. J. Comb. 27 (4) (2020)
Marthe Bonamy, Louis Esperet, Carla Groenland, Alex D. Scott
Optimal labelling schemes for adjacency, comparability and reachability. CoRR (2020)
Marthe Bonamy, Bojan Mohar, Alexandra Wesolek
Limiting Crossing Numbers for Geodesic Drawings on the Sphere. Graph Drawing (2020)
Marthe Bonamy, Nicolas Bousquet, Louis Esperet, Carla Groenland, Chun-Hung Liu, François Pirot, Alex D. Scott
Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces. CoRR (2020)
Marthe Bonamy, Natasha Morrison, Alex Scott
Partitioning the vertices of a torus into isomorphic subgraphs. J. Comb. Theory, Ser. A 174 (2020)
Marthe Bonamy, Oscar Defrain, Piotr Micek, Lhouari Nourine
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets. CoRR (2020)
Marthe Bonamy, Théo Pierron, Éric Sopena
Every planar graph with Δ≥8 is totally (Δ+2)-choosable. CoRR (2019)
Marthe Bonamy, Cyril Gavoille, Michal Pilipczuk
Shorter Labeling Schemes for Planar Graphs. CoRR (2019)
Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. J. Comb. Theory, Ser. B 135 (2019)
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
Distributed Coloring in Sparse Graphs with Fewer Colors. Electron. J. Comb. 26 (4) (2019)
Marthe Bonamy, Michal Pilipczuk
Graphs of bounded cliquewidth are polynomially χ-bounded. CoRR (2019)
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
Enumerating Minimal Dominating Sets in Triangle-Free Graphs. STACS (2019)
Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
)-Free Graphs: An Almost Complete Dichotomy. WADS (2019)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
-Free Graphs. Algorithmica 81 (4) (2019)
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Haruka Mizuta, Moritz Mühlenthaler, Akira Suzuki, Kunihiro Wasa
Diameter of Colorings Under Kempe Changes. COCOON (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. MFCS (2019)
Marthe Bonamy, Daniel W. Cranston, Luke Postle
Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory, Ser. B 134 (2019)
Marthe Bonamy, Nicolas Bousquet, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi, Arnaud Mary, Moritz Mühlenthaler, Kunihiro Wasa
The Perfect Matching Reconfiguration Problem. CoRR (2019)
Marthe Bonamy, Thomas J. Perrett
Gallai's path decomposition conjecture for graphs of small maximum degree. Discret. Math. 342 (5) (2019)
Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
Avoidable paths in graphs. CoRR (2019)
Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in subcubic graphs. CoRR (2019)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
Tight Lower Bounds for the Complexity of Multicoloring. ACM Trans. Comput. Theory 11 (3) (2019)
Marthe Bonamy, Paul Dorbec, Paul Ouvrard
Dominating sets reconfiguration under token sliding. CoRR (2019)
Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto
Distributed Recoloring. DISC (2018)
Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma
)-free Graphs: An Almost Complete Dichotomy. CoRR (2018)
Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
EPTAS for Max Clique on Disks and Unit Balls. FOCS (2018)
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
Enumerating minimal dominating sets in triangle-free graphs. CoRR (2018)
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé
EPTAS for Max Clique on Disks and Unit Balls. CoRR (2018)
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
On Directed Feedback Vertex Set Parameterized by Treewidth. WG (2018)
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
Distributed coloring in sparse graphs with fewer colors. CoRR (2018)
Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet
Distributed Coloring in Sparse Graphs with Fewer Colors. PODC (2018)
Marthe Bonamy, Thomas Perrett, Luke Postle
Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications. CoRR (2018)
Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto
Distributed Recoloring. CoRR (2018)
Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
Frozen colourings of bounded degree graphs. Electron. Notes Discret. Math. 68 (2018)
Marthe Bonamy, Nicolas Bousquet
Recoloring graphs via tree decompositions. Eur. J. Comb. 69 (2018)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent feedback vertex sets for graphs of bounded diameter. Inf. Process. Lett. 131 (2018)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing Graphs Close to Bipartite Graphs with an Application to Colouring Reconfiguration. CoRR (2017)
Marthe Bonamy, Kitty Meeks
The Interactive Sum Choice Number of Graphs. Electron. Notes Discret. Math. 61 (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Recognizing Graphs Close to Bipartite Graphs. MFCS (2017)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79 (1) (2017)
Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
Tight Lower Bounds for the Complexity of Multicoloring. ESA (2017)
Marthe Bonamy, Nicolas Bousquet
Token Sliding on Chordal Graphs. WG (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR (2017)
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna
On Directed Feedback Vertex Set parameterized by treewidth. CoRR (2017)
Marthe Bonamy, Kitty Meeks
The Interactive Sum Choice Number of Graphs. CoRR (2017)
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR (2017)
Marthe Bonamy, Jakub Przybylo
On the Neighbor Sum Distinguishing Index of Planar Graphs. J. Graph Theory 85 (3) (2017)
Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski
On the difference between the Szeged and the Wiener index. Appl. Math. Comput. 312 (2017)
Marthe Bonamy, Ross J. Kang
List Coloring with a Bounded Palette. J. Graph Theory 84 (1) (2017)
Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud
Incidence coloring of graphs with high maximum average degree. Discret. Appl. Math. 227 (2017)
Marthe Bonamy, Lukasz Kowalik
A 13k-kernel for planar feedback vertex set via region decomposition. Theor. Comput. Sci. 645 (2016)
Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
are minimally edge and total choosable. Discret. Math. Theor. Comput. Sci. 17 (3) (2016)

Marthe Bonamy.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Marthe Bonamy