Benjamin Lévêque

65 papers A 2B 2Journal 59

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Reconfiguration of Digraph Homomorphisms. SIAM J. Discret. Math. Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
2023	J	`jnl`	Locating-dominating sets in local tournaments. Discret. Appl. Math. Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
2023	A	`conf`	Reconfiguration of Digraph Homomorphisms. STACS Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
2022	J	`jnl`	Local certification of graphs on surfaces. Theor. Comput. Sci. Louis Esperet, Benjamin Lévêque
2022	J	`jnl`	Reconfiguration of Digraph Homomorphisms. CoRR Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan
2021	J	`jnl`	A bijection for essentially 3-connected toroidal maps. Eur. J. Comb. Nicolas Bonichon, Éric Fusy, Benjamin Lévêque
2021	J	`jnl`	Local certification of graphs on surfaces. CoRR Louis Esperet, Benjamin Lévêque
2021	J	`jnl`	Locating Dominating Sets in local tournaments. CoRR Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau
2020	J	`jnl`	Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth. J. Comb. Theory A Éric Fusy, Benjamin Lévêque
2019	J	`jnl`	A Bijection for Essentially 4-Connected Toroidal Triangulations. Electron. J. Comb. Nicolas Bonichon, Benjamin Lévêque
2019	J	`jnl`	A bijection for essentially 3-connected toroidal maps. CoRR Nicolas Bonichon, Éric Fusy, Benjamin Lévêque
2019	J	`jnl`	Homothetic triangle representations of planar graphs. CoRR Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2019	J	`jnl`	On the structure of Schnyder woods on orientable surfaces. J. Comput. Geom. Kolja Knauer, Daniel Gonçalves, Benjamin Lévêque
2019	J	`jnl`	Scaling limits for random triangulations on the torus. CoRR Vincent Beffara, Cong Bang Huynh, Benjamin Lévêque
2018	J	`jnl`	Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth. CoRR Éric Fusy, Benjamin Lévêque
2017	J	`jnl`	A bijection for essentially 4-connected toroidal triangulations. CoRR Nicolas Bonichon, Benjamin Lévêque
2017	J	`jnl`	Encoding Toroidal Triangulations. Discret. Comput. Geom. Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
2017	J	`jnl`	Generalization of Schnyder woods to orientable surfaces and applications. CoRR Benjamin Lévêque
2016	—	`book`	Generalization of Schnyder woods to orientable surfaces and applications. Benjamin Lévêque
2016	J	`jnl`	Planar graphs with Δ≥7 and no triangle adjacent to a C Discret. Math. Theor. Comput. Sci. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2015	J	`jnl`	Asteroidal quadruples in non rooted path graphs. Discuss. Math. Graph Theory Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato
2015	J	`jnl`	Encoding toroidal triangulations. CoRR Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
2015	J	`jnl`	Structure of Schnyder labelings on orientable surfaces. CoRR Daniel Gonçalves, Kolja B. Knauer, Benjamin Lévêque
2014	J	`jnl`	2-Distance Coloring of Sparse Graphs. J. Graph Theory Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Contracting Graphs to Paths and Trees. Algorithmica Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2014	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2014	J	`jnl`	Graphs with maximum degree Δ≥17 and maximum average degree less than 3 are list 2-distance (Δ+2)-colorable. Discret. Math. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	List coloring the square of sparse graphs with large degree. Eur. J. Comb. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Planar graphs with $Δ\geq 7$ and no triangle adjacent to a C CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2014	J	`jnl`	Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. Discret. Comput. Geom. Daniel Gonçalves, Benjamin Lévêque
2013	J	`jnl`	Detecting induced subgraphs. CoRR Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
2013	J	`jnl`	Graphs with maximum degree D at least 17 and maximum average degree less than 3 are list 2-distance (D+2)-colorable CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2013	J	`jnl`	List coloring the square of sparse graphs with large degree. CoRR Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2012	J	`jnl`	Coloring vertices of a graph or finding a Meyniel obstruction. Theor. Comput. Sci. Kathie Cameron, Benjamin Lévêque, Frédéric Maffray
2012	J	`jnl`	Graph transformations preserving the stability number. Discret. Appl. Math. Benjamin Lévêque, Dominique de Werra
2012	J	`jnl`	On graphs with no induced subdivision of K J. Comb. Theory B Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon
2012	J	`jnl`	Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations CoRR Daniel Gonçalves, Benjamin Lévêque
2012	J	`jnl`	Triangle Contact Representations and Duality. Discret. Comput. Geom. Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2011	J	`jnl`	2-distance coloring of sparse graphs. Electron. Notes Discret. Math. Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou
2011	J	`jnl`	Characterizing directed path graphs by forbidden asteroids. J. Graph Theory Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
2011	J	`jnl`	Contracting Graphs to Paths and Trees CoRR Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	B	`conf`	Contracting Graphs to Paths and Trees. IPEC Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul
2011	J	`jnl`	Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Christophe Paul
2010	B	`conf`	From Path Graphs to Directed Path Graphs. WG Steven Chaplick, Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato
2010	A	`conf`	Triangle Contact Representations and Duality. GD Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2009	J	`jnl`	Asteroids in rooted and directed path graphs. Electron. Notes Discret. Math. Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
2009	J	`jnl`	Characterizing path graphs by forbidden induced subgraphs. J. Graph Theory Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
2009	J	`jnl`	Coloring Artemis graphs. Theor. Comput. Sci. Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
2009	J	`jnl`	Detecting induced subgraphs. Discret. Appl. Math. Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
2009	J	`jnl`	Graph transformations preserving the stability number. Electron. Notes Discret. Math. Benjamin Lévêque, Dominique de Werra
2008	J	`jnl`	Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. J. Interconnect. Networks Jean-Claude Bermond, David Coudert, Benjamin Lévêque
2008	J	`jnl`	Asteroids in rooted and directed path graphs CoRR Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
2008	J	`jnl`	Characterizing path graphs by forbidden induced subgraphs CoRR Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann
2008	J	`jnl`	Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discret. Math. Benjamin Lévêque, Frédéric Maffray
2008	J	`jnl`	Generating All Sets With Bounded Unions. Comb. Probab. Comput. Yannick Frein, Benjamin Lévêque, András Sebö
2007	—	`—`	Coloration de graphes : structures et algorithmes. (Coloring graphs : structures and algorithms). Benjamin Lévêque
2007	J	`jnl`	Detecting induced subgraphs. Electron. Notes Discret. Math. Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon
2007	J	`jnl`	Optimizing diversity CoRR Yannick Frein, Benjamin Lévêque, András Sebö
2007	J	`jnl`	Optimizing diversity. Electron. Notes Discret. Math. Yannick Frein, Benjamin Lévêque, András Sebö
2007	J	`jnl`	Precoloring Extension of Co-Meyniel Graphs. Graphs Comb. Vincent Jost, Benjamin Lévêque, Frédéric Maffray
2005	J	`jnl`	Coloring Artemis graphs CoRR Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon
2005	J	`jnl`	Coloring Meyniel graphs in linear time. Electron. Notes Discret. Math. Benjamin Lévêque, Frédéric Maffray
2005	J	`jnl`	Coloring vertices of a graph or finding a Meyniel obstruction CoRR Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray
2005	J	`jnl`	Precoloring co-Meyniel graphs CoRR Vincent Jost, Benjamin Lévêque, Frédéric Maffray
2004	J	`jnl`	Coloring Meyniel graphs in linear time CoRR Benjamin Lévêque, Frédéric Maffray