Marthe Bonamy

Most-cited papers

Asymptotic Dimension of Minor-Closed Families and Assouad-Nagata Dimension of Surfaces
Marthe Bonamy, N. Bousquet, L. Esperet, Carla Groenland +3 more
2020Journal of the European Mathematical Society (Print)63 citations Open access
Semantic Scholar
Recoloring graphs via tree decompositions
Marthe Bonamy, N. Bousquet
2014European journal of combinatorics (Print)60 citations Open access
Semantic Scholar
Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications
Marthe Bonamy, Thomas J. Perrett, Luke Postle
2018J. Comb. Theory B52 citations Open access
Semantic Scholar
On the Neighbor Sum Distinguishing Index of Planar Graphs
Marthe Bonamy, J. Przybyło
2014Journal of Graph Theory51 citations Open access
Semantic Scholar
Recoloring bounded treewidth graphs
Marthe Bonamy, N. Bousquet
2013Electron. Notes Discret. Math.49 citations Open access
Semantic Scholar
Token Sliding on Chordal Graphs
Marthe Bonamy, N. Bousquet
2016International Workshop on Graph-Theoretic Concepts in Computer Science46 citations Open access
Semantic Scholar
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
2014Discrete Mathematics44 citations Open access
Semantic Scholar
Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
Marthe Bonamy, Édouard Bonnet, Hugues Déprés, L. Esperet +4 more
2022ACM-SIAM Symposium on Discrete Algorithms41 citations Open access
Semantic Scholar
Independent Feedback Vertex Set for $$P_5$$P5-Free Graphs
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson +1 more
2017Algorithmica40 citations Open access
Semantic Scholar
A 13k-kernel for planar feedback vertex set via region decomposition
Marthe Bonamy, Lukasz Kowalik
2014Theoretical Computer Science39 citations Open access
Semantic Scholar
On a conjecture of Mohar concerning Kempe equivalence of regular graphs
Marthe Bonamy, N. Bousquet, Carl Feghali, Matthew P. Johnson
2015J. Comb. Theory B38 citations Open access
Semantic Scholar
Shorter Labeling Schemes for Planar Graphs
Marthe Bonamy, C. Gavoille, Michał Pilipczuk
2019ACM-SIAM Symposium on Discrete Algorithms37 citations Open access
Semantic Scholar
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Marthe Bonamy, Édouard Bonnet, N. Bousquet, Pierre Charbit +5 more
2021Journal of the ACM32 citations Open access
Semantic Scholar
Gallai's path decomposition conjecture for graphs of small maximum degree
Marthe Bonamy, Thomas J. Perrett
2016Discrete Mathematics31 citations Open access
Semantic Scholar
The Perfect Matching Reconfiguration Problem
Marthe Bonamy, N. Bousquet, Marc Heinrich, Takehiro Ito +4 more
2019International Symposium on Mathematical Foundations of Computer Science30 citations Open access
Semantic Scholar
Bounding χ by a fraction of Δ for graphs without large cliques
Marthe Bonamy, Tom Kelly, P. Nelson, Luke Postle
2022J. Comb. Theory B29 citations Open access
Semantic Scholar
Planar graphs of girth at least five are square (Δ + 2)-choosable
Marthe Bonamy, Daniel W. Cranston, Luke Postle
2015J. Comb. Theory B29 citations Open access
Semantic Scholar
Graphs of bounded cliquewidth are polynomially χ-bounded
Marthe Bonamy, Michał Pilipczuk
2020arXiv.org27 citations Open access
Semantic Scholar
The Erdös-Hajnal Conjecture for Long Holes and Antiholes
Marthe Bonamy, N. Bousquet, Stéphan Thomassé
2014SIAM Journal on Discrete Mathematics26 citations Open access
Semantic Scholar
Graphs with large chromatic number induce $3k$-cycles
Marthe Bonamy, Pierre Charbit, Stéphan Thomassé
2014arXiv.org25 citations
Semantic Scholar
Reconfiguring Independent Sets in Cographs
Marthe Bonamy, N. Bousquet
2014arXiv.org24 citations
Semantic Scholar
Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs
Marthe Bonamy, Nicolas Bousquet, Michał Pilipczuk, Paweł Rzaͅżewski +2 more
2022J. Comb. Theory B21 citations Open access
Semantic Scholar
Improved Pyrotechnics: Closer to the Burning Number Conjecture
P. Bastide, Marthe Bonamy, A. Bonato, Pierre Charbit +3 more
2021Electronic Journal of Combinatorics21 citations Open access
Semantic Scholar
Diameter of Colorings Under Kempe Changes
Marthe Bonamy, Marc Heinrich, Takehiro Ito, Yusuke Kobayashi +4 more
2019International Computing and Combinatorics Conference21 citations
Semantic Scholar
EPTAS for Max Clique on Disks and Unit Balls
Marthe Bonamy, Édouard Bonnet, N. Bousquet, Pierre Charbit +1 more
2018IEEE Annual Symposium on Foundations of Computer Science20 citations Open access
Semantic Scholar
On Directed Feedback Vertex Set parameterized by treewidth
Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michał Pilipczuk +2 more
2017International Workshop on Graph-Theoretic Concepts in Computer Science20 citations Open access
Semantic Scholar
Planar graphs with ∆ ≥ 8 are ( ∆ + 1 )-edge-choosable . ∗
Marthe Bonamy
201320 citations
Semantic Scholar
Independent Feedback Vertex Sets for Graphs of Bounded Diameter
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson +1 more
2017Information Processing Letters19 citations Open access
Semantic Scholar
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew P. Johnson +1 more
2017International Symposium on Mathematical Foundations of Computer Science18 citations Open access
Semantic Scholar
Enumerating minimal dominating sets in triangle-free graphs
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond
2018Symposium on Theoretical Aspects of Computer Science17 citations Open access
Semantic Scholar
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
Marthe Bonamy, Oscar Defrain, Marc Heinrich, Michał Pilipczuk +1 more
2018ACM Trans. Algorithms17 citations Open access
Semantic Scholar
Dominating sets reconfiguration under token sliding
Marthe Bonamy, Paul Dorbec, P. Ouvrard
2019Discrete Applied Mathematics16 citations Open access
Semantic Scholar
Distributed Coloring in Sparse Graphs with Fewer Colors
Pierre Aboulker, Marthe Bonamy, N. Bousquet, L. Esperet
2018ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing16 citations Open access
Semantic Scholar
On the difference between the Szeged and the Wiener index
Marthe Bonamy, M. Knor, Borut Lužar, Alexandre Pinlou +1 more
2016Applied Mathematics and Computation16 citations Open access
Semantic Scholar
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
Marthe Bonamy, Linda Cook, Carla Groenland, A. Wesolek
2021International Symposium on Distributed Computing15 citations
Semantic Scholar
Optimal labelling schemes for adjacency, comparability, and reachability
Marthe Bonamy, L. Esperet, Carla Groenland, A. Scott
2020Symposium on the Theory of Computing15 citations Open access
Semantic Scholar
Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable
Marthe Bonamy
2015SIAM Journal on Discrete Mathematics13 citations
Semantic Scholar
Distributed Recoloring
Marthe Bonamy, P. Ouvrard, M. Rabie, J. Suomela +1 more
2018International Symposium on Distributed Computing12 citations
Semantic Scholar
Edge-colouring graphs with local list sizes
Marthe Bonamy, Michelle Delcourt, R. Lang, Luke Postle
2020J. Comb. Theory B11 citations Open access
Semantic Scholar
Tight Lower Bounds for the Complexity of Multicoloring
Marthe Bonamy, Łukasz Kowalik, Michał Pilipczuk, Arkadiusz Socala +1 more
2016Embedded Systems and Applications11 citations Open access
Semantic Scholar
Improved pyrotechnics : Closer to the burning graph conjecture
P. Bastide, Marthe Bonamy, Pierre Charbit, Théo Pierron +1 more
2021arXiv.org9 citations
Semantic Scholar
On Vizing's edge colouring question
Marthe Bonamy, Oscar Defrain, Tereza Klimošová, Aurélie Lagoutte +1 more
2021J. Comb. Theory B9 citations Open access
Semantic Scholar
Avoidable paths in graphs
Marthe Bonamy, Oscar Defrain, Meike Hatzel, Jocelyn Thiebaut
2019Electronic Journal of Combinatorics9 citations Open access
Semantic Scholar
Strong edge coloring sparse graphs
Julien Bensmail, Marthe Bonamy, H. Hocquard
2015Electron. Notes Discret. Math.8 citations Open access
Semantic Scholar
On graph classes with constant domination-packing ratio
Marthe Bonamy, M'onika Csik'os, Anna Gujgiczer, Yelena Yuditsky
2025arXiv.org7 citations
Semantic Scholar
Gallai's path decomposition in planar graphs
Alexandre Blanché, Marthe Bonamy, Nicolas Bonichon
20217 citations
Semantic Scholar
Tuza's Conjecture for Threshold Graphs
Marthe Bonamy, Łukasz Bożyk, Andrzej Grzesik, Meike Hatzel +3 more
2021Discrete Mathematics & Theoretical Computer Science7 citations Open access
Semantic Scholar
Frozen (Δ + 1)-colourings of bounded degree graphs
Marthe Bonamy, N. Bousquet, G. Perarnau
2020Combinatorics, probability & computing7 citations Open access
Semantic Scholar
Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy
Marthe Bonamy, Konrad K. Dabrowski, Matthew P. Johnson, D. Paulusma
2018Workshop on Algorithms and Data Structures7 citations Open access
Semantic Scholar
The Structure of Binary Matroids with no Induced Claw or Fano Plane Restriction
P. Nelson, Luke Postle, Tom Kelly, František Kardoš +1 more
2018Advances in Combinatorics7 citations Open access
Semantic Scholar