Precoloring co-Meyniel graphs - Vincent Jost; Benjamin Lévêque; Frédéric Maffray (CoRR, 2005)

Coloring vertices of a graph or finding a Meyniel obstruction - Kathie Cameron; Jack Edmonds 001; Benjamin Lévêque; Frédéric Maffray (CoRR, 2005)

Coloring Meyniel graphs in linear time. - Benjamin Lévêque; Frédéric Maffray (Electron. Notes Discret. Math., 2005)

Optimizing diversity. - Yannick Frein; Benjamin Lévêque; András Sebö (Electron. Notes Discret. Math., 2007)

Precoloring Extension of Co-Meyniel Graphs. - Vincent Jost; Benjamin Lévêque; Frédéric Maffray (Graphs Comb., 2007)

Coloration de graphes : structures et algorithmes. (Coloring graphs : structures and algorithms). - Benjamin Lévêque (2007)

Generating All Sets With Bounded Unions. - Yannick Frein; Benjamin Lévêque; András Sebö (Comb. Probab. Comput., 2008)

Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. - Jean-Claude Bermond; David Coudert; Benjamin Lévêque (J. Interconnect. Networks, 2008)

Coloring Bull-Free Perfectly Contractile Graphs. - Benjamin Lévêque; Frédéric Maffray (SIAM J. Discret. Math., 2008)

Detecting induced subgraphs. - Benjamin Lévêque; David Y. Lin; Frédéric Maffray; Nicolas Trotignon (Discret. Appl. Math., 2009)

Asteroids in rooted and directed path graphs. - Kathie Cameron; Chính T. Hoàng; Benjamin Lévêque (Electron. Notes Discret. Math., 2009)

Characterizing path graphs by forbidden induced subgraphs. - Benjamin Lévêque; Frédéric Maffray; Myriam Preissmann (J. Graph Theory, 2009)

Coloring Artemis graphs. - Benjamin Lévêque; Frédéric Maffray; Bruce A. Reed; Nicolas Trotignon (Theor. Comput. Sci., 2009)

From Path Graphs to Directed Path Graphs. - Steven Chaplick; Marisa Gutierrez; Benjamin Lévêque; Silvia B. Tondato (WG, 2010)

Characterizing directed path graphs by forbidden asteroids. - Kathie Cameron; Chính T. Hoàng; Benjamin Lévêque (J. Graph Theory, 2011)

Graph transformations preserving the stability number. - Benjamin Lévêque; Dominique de Werra (Discret. Appl. Math., 2012)

Triangle Contact Representations and Duality. - Daniel Gonçalves 001; Benjamin Lévêque; Alexandre Pinlou (Discret. Comput. Geom., 2012)

On graphs with no induced subdivision of K4. - Benjamin Lévêque; Frédéric Maffray; Nicolas Trotignon (J. Comb. Theory B, 2012)

Coloring vertices of a graph or finding a Meyniel obstruction. - Kathie Cameron; Benjamin Lévêque; Frédéric Maffray (Theor. Comput. Sci., 2012)

Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (CoRR, 2013)

Contracting Graphs to Paths and Trees. - Pinar Heggernes; Pim van 't Hof; Benjamin Lévêque; Daniel Lokshtanov; Christophe Paul (Algorithmica, 2014)

Planar graphs with $Δ geq 7$ and no triangle adjacent to a C4 are minimally edge and total choosable. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (CoRR, 2014)

Contracting chordal graphs and bipartite graphs to paths and trees. - Pinar Heggernes; Pim van 't Hof; Benjamin Lévêque; Christophe Paul (Discret. Appl. Math., 2014)

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. - Daniel Gonçalves 001; Benjamin Lévêque (Discret. Comput. Geom., 2014)

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 (Discret. Math., 2014)

List coloring the square of sparse graphs with large degree. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (Eur. J. Comb., 2014)

2-Distance Coloring of Sparse Graphs. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (J. Graph Theory, 2014)

Structure of Schnyder labelings on orientable surfaces. - Daniel Gonçalves 001; Kolja B. Knauer; Benjamin Lévêque (CoRR, 2015)

Asteroidal quadruples in non rooted path graphs. - Marisa Gutierrez; Benjamin Lévêque; Silvia B. Tondato (Discuss. Math. Graph Theory, 2015)

Generalization of Schnyder woods to orientable surfaces and applications. - Benjamin Lévêque (2016)

Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable. - Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou (Discret. Math. Theor. Comput. Sci., 2016)

Generalization of Schnyder woods to orientable surfaces and applications. - Benjamin Lévêque (CoRR, 2017)

Encoding Toroidal Triangulations. - Vincent Despré; Daniel Gonçalves 001; Benjamin Lévêque (Discret. Comput. Geom., 2017)

A Bijection for Essentially 4-Connected Toroidal Triangulations. - Nicolas Bonichon; Benjamin Lévêque (Electron. J. Comb., 2019)

Scaling limits for random triangulations on the torus. - Vincent Beffara; Cong Bang Huynh; Benjamin Lévêque (CoRR, 2019)

Homothetic triangle representations of planar graphs. - Daniel Gonçalves 001; Benjamin Lévêque; Alexandre Pinlou (CoRR, 2019)

On the structure of Schnyder woods on orientable surfaces. - Kolja Knauer; Daniel Gonçalves 001; Benjamin Lévêque (J. Comput. Geom., 2019)

Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth. - Éric Fusy; Benjamin Lévêque (J. Comb. Theory A, 2020)

A bijection for essentially 3-connected toroidal maps. - Nicolas Bonichon; Éric Fusy; Benjamin Lévêque (Eur. J. Comb., 2021)

Local certification of graphs on surfaces. - Louis Esperet; Benjamin Lévêque (Theor. Comput. Sci., 2022)

Locating-dominating sets in local tournaments. - Thomas Bellitto; Caroline Brosse; Benjamin Lévêque; Aline Parreau (Discret. Appl. Math., 2023)

Reconfiguration of Digraph Homomorphisms. - Benjamin Lévêque; Moritz Mühlenthaler; Thomas Suzan (SIAM J. Discret. Math., 2025)