Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarMarthe Bonamy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – today
- 2019
[j24]Marthe Bonamy, Daniel W. Cranston, Luke Postle:
Planar graphs of girth at least five are square (Δ + 2)-choosable. J. Comb. Theory, Ser. B 134: 218-238 (2019)- [j23]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: 179-199 (2019) - 2018
- [j22]Marthe Bonamy, Nicolas Bousquet:
Recoloring graphs via tree decompositions. Eur. J. Comb. 69: 200-213 (2018) - [j21]Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau:
Frozen colourings of bounded degree graphs. Electronic Notes in Discrete Mathematics 68: 167-172 (2018) - [j20]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: 26-32 (2018) - [c10]Marthe Bonamy, Edouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. FOCS 2018: 568-579 - [c9]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed Coloring in Sparse Graphs with Fewer Colors. PODC 2018: 419-425 - [c8]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. DISC 2018: 12:1-12:17 - [c7]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set Parameterized by Treewidth. WG 2018: 65-78 - [i29]Pierre Aboulker, Marthe Bonamy, Nicolas Bousquet, Louis Esperet:
Distributed coloring in sparse graphs with fewer colors. CoRR abs/1802.05582 (2018) - [i28]Marthe Bonamy, Paul Ouvrard, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Distributed Recoloring. CoRR abs/1802.06742 (2018) - [i27]Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé:
EPTAS for Max Clique on Disks and Unit Balls. CoRR abs/1803.01822 (2018) - [i26]Marthe Bonamy, Oscar Defrain, Marc Heinrich, Jean-Florent Raymond:
Enumerating minimal dominating sets in triangle-free graphs. CoRR abs/1810.00789 (2018) - [i25]Marthe Bonamy, Thomas Perrett, Luke Postle:
Colouring Graphs with Sparse Neighbourhoods: Bounds and Applications. CoRR abs/1810.06704 (2018) - [i24]Marthe Bonamy, Konrad K. Dabrowski, Matthew Johnson, Daniël Paulusma:
Graph Isomorphism for (H1, H2)-free Graphs: An Almost Complete Dichotomy. CoRR abs/1811.12252 (2018) - 2017
- [j19]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. Algorithmica 79(1): 159-188 (2017) - [j18]Marthe Bonamy, Martin Knor, Borut Luzar, Alexandre Pinlou, Riste Skrekovski:
On the difference between the Szeged and the Wiener index. Applied Mathematics and Computation 312: 202-213 (2017) - [j17]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. Discrete Applied Mathematics 227: 29-43 (2017) - [j16]Marthe Bonamy, Kitty Meeks:
The Interactive Sum Choice Number of Graphs. Electronic Notes in Discrete Mathematics 61: 139-145 (2017) - [j15]Marthe Bonamy, Ross J. Kang:
List Coloring with a Bounded Palette. Journal of Graph Theory 84(1): 93-103 (2017) - [j14]Marthe Bonamy, Jakub Przybylo:
On the Neighbor Sum Distinguishing Index of Planar Graphs. Journal of Graph Theory 85(3): 669-690 (2017) - [c6]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight Lower Bounds for the Complexity of Multicoloring. ESA 2017: 18:1-18:14 - [c5]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for P_5-free Graphs. ISAAC 2017: 16:1-16:12 - [c4]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing Graphs Close to Bipartite Graphs. MFCS 2017: 70:1-70:14 - [c3]
- [i23]
- [i22]Marthe Bonamy, Lukasz Kowalik, Jesper Nederlof, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
On Directed Feedback Vertex Set parameterized by treewidth. CoRR abs/1707.01470 (2017) - [i21]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Sets for Graphs of Bounded Diameter. CoRR abs/1707.09383 (2017) - [i20]Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Independent Feedback Vertex Set for $P_5$-free Graphs. CoRR abs/1707.09402 (2017) - [i19]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 abs/1707.09817 (2017) - 2016
- [j13]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable. Discrete Mathematics & Theoretical Computer Science 17(3): 131-146 (2016) - [j12]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdös-Hajnal Conjecture for Long Holes and Antiholes. SIAM J. Discrete Math. 30(2): 1159-1164 (2016) - [j11]Marthe Bonamy, Lukasz Kowalik:
A 13k-kernel for planar feedback vertex set via region decomposition. Theor. Comput. Sci. 645: 25-40 (2016) - [i18]
- [i17]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala, Marcin Wrochna:
Tight lower bounds for the complexity of multicoloring. CoRR abs/1607.03432 (2016) - [i16]Marthe Bonamy, Thomas Perrett:
Gallai's path decomposition conjecture for graphs of small maximum degree. CoRR abs/1609.06257 (2016) - 2015
- [j10]Julien Bensmail, Marthe Bonamy, Hervé Hocquard:
Strong edge coloring sparse graphs. Electronic Notes in Discrete Mathematics 49: 773-778 (2015) - [j9]Marthe Bonamy:
Planar graphs with Δ ≥ 8 are (Δ+1)-edge-choosable. SIAM J. Discrete Math. 29(3): 1735-1763 (2015) - [c2]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear Kernels for Outbranching Problems in Sparse Digraphs. IPEC 2015: 199-211 - [i15]Marthe Bonamy, Lukasz Kowalik, Michal Pilipczuk, Arkadiusz Socala:
Linear kernels for outbranching problems in sparse digraphs. CoRR abs/1509.01675 (2015) - [i14]Marthe Bonamy, Nicolas Bousquet, Carl Feghali, Matthew Johnson:
On a conjecture of Mohar concerning Kempe equivalence of regular graphs. CoRR abs/1510.06964 (2015) - 2014
- [j8]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Discrete Mathematics 317: 19-32 (2014) - [j7]Marthe Bonamy, Nicolas Bousquet:
Brooks' theorem on powers of graphs. Discrete Mathematics 325: 12-16 (2014) - [j6]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
List coloring the square of sparse graphs with large degree. Eur. J. Comb. 41: 128-137 (2014) - [j5]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs. J. Comb. Optim. 27(1): 132-143 (2014) - [j4]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-Distance Coloring of Sparse Graphs. Journal of Graph Theory 77(3): 190-218 (2014) - [c1]Marthe Bonamy, Lukasz Kowalik:
A 14k -Kernel for Planar Feedback Vertex Set via Region Decomposition. IPEC 2014: 97-109 - [i13]Marthe Bonamy, Nicolas Bousquet:
Recoloring graphs via tree decompositions. CoRR abs/1403.6386 (2014) - [i12]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C4 are minimally edge and total choosable. CoRR abs/1405.3422 (2014) - [i11]Marthe Bonamy, Nicolas Bousquet:
Reconfiguring Independent Sets in Cographs. CoRR abs/1406.1433 (2014) - [i10]Marthe Bonamy, Nicolas Bousquet, Stéphan Thomassé:
The Erdős-Hajnal Conjecture for Long Holes and Anti-holes. CoRR abs/1408.1964 (2014) - [i9]Marthe Bonamy, Pierre Charbit, Stéphan Thomassé:
Graphs with large chromatic number induce $3k$-cycles. CoRR abs/1408.2172 (2014) - [i8]Marthe Bonamy, Jakub Przybylo:
On the neighbour sum distinguishing index of planar graphs. CoRR abs/1408.3190 (2014) - [i7]Marthe Bonamy, Lukasz Kowalik:
A 13k-kernel for Planar Feedback Vertex Set via Region Decomposition. CoRR abs/1410.8336 (2014) - [i6]Marthe Bonamy, Hervé Hocquard, Samia Kerdjoudj, André Raspaud:
Incidence coloring of graphs with high maximum average degree. CoRR abs/1412.6803 (2014) - 2013
- [j3]Marthe Bonamy, Nicolas Bousquet:
Recoloring bounded treewidth graphs. Electronic Notes in Discrete Mathematics 44: 257-262 (2013) - [i5]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable. CoRR abs/1301.7090 (2013) - [i4]
- [i3]Marthe Bonamy:
Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable. CoRR abs/1303.4025 (2013) - [i2]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
List coloring the square of sparse graphs with large degree. CoRR abs/1308.4197 (2013) - [i1]
- 2011
- [j2]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-distance coloring of sparse graphs. Electronic Notes in Discrete Mathematics 38: 155-160 (2011) - [j1]Marthe Bonamy, Matthew Johnson, Ioannis Lignos, Viresh Patel, Daniël Paulusma:
On the diameter of reconfiguration graphs for vertex colourings. Electronic Notes in Discrete Mathematics 38: 161-166 (2011)
Coauthor Index
maintained by 
, founded at 
, founded at 
last updated on 2019-01-19 23:07 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
