default search action
Benjamin Lévêque
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j35]Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan:
Reconfiguration of Digraph Homomorphisms. SIAM J. Discret. Math. 39(1): 327-360 (2025) - 2023
- [j34]Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau:
Locating-dominating sets in local tournaments. Discret. Appl. Math. 337: 14-24 (2023) - [c4]Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan:
Reconfiguration of Digraph Homomorphisms. STACS 2023: 43:1-43:21 - 2022
- [j33]Louis Esperet
, Benjamin Lévêque:
Local certification of graphs on surfaces. Theor. Comput. Sci. 909: 68-75 (2022) - [i24]Benjamin Lévêque, Moritz Mühlenthaler, Thomas Suzan:
Reconfiguration of Digraph Homomorphisms. CoRR abs/2205.09210 (2022) - 2021
- [j32]Nicolas Bonichon, Éric Fusy, Benjamin Lévêque:
A bijection for essentially 3-connected toroidal maps. Eur. J. Comb. 95: 103290 (2021) - [i23]Louis Esperet, Benjamin Lévêque:
Local certification of graphs on surfaces. CoRR abs/2102.04133 (2021) - [i22]Thomas Bellitto, Caroline Brosse, Benjamin Lévêque, Aline Parreau:
Locating Dominating Sets in local tournaments. CoRR abs/2109.03102 (2021) - 2020
- [j31]Éric Fusy, Benjamin Lévêque:
Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth. J. Comb. Theory A 175: 105270 (2020)
2010 – 2019
- 2019
- [j30]Nicolas Bonichon, Benjamin Lévêque:
A Bijection for Essentially 4-Connected Toroidal Triangulations. Electron. J. Comb. 26(1): 1 (2019) - [j29]Kolja Knauer, Daniel Gonçalves
On the structure of Schnyder woods on orientable surfaces. J. Comput. Geom. 10(1): 127-163 (2019) - [i21]Vincent Beffara, Cong Bang Huynh, Benjamin Lévêque:
Scaling limits for random triangulations on the torus. CoRR abs/1905.01873 (2019) - [i20]Nicolas Bonichon, Éric Fusy, Benjamin Lévêque:
A bijection for essentially 3-connected toroidal maps. CoRR abs/1907.04016 (2019) - [i19]Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou:
Homothetic triangle representations of planar graphs. CoRR abs/1908.11749 (2019) - 2018
- [i18]Éric Fusy, Benjamin Lévêque:
Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth. CoRR abs/1807.00522 (2018) - 2017
- [j28]Vincent Despré, Daniel Gonçalves
Encoding Toroidal Triangulations. Discret. Comput. Geom. 57(3): 507-544 (2017) - [i17]Benjamin Lévêque:
Generalization of Schnyder woods to orientable surfaces and applications. CoRR abs/1702.07589 (2017) - [i16]Nicolas Bonichon, Benjamin Lévêque:
A bijection for essentially 4-connected toroidal triangulations. CoRR abs/1707.08191 (2017) - 2016
- [b2]Benjamin Lévêque:
Generalization of Schnyder woods to orientable surfaces and applications. Grenoble Alpes University, France, 2016 - [j27]Marthe Bonamy
Planar graphs with Δ≥7 and no triangle adjacent to a C4 are minimally edge and total choosable. Discret. Math. Theor. Comput. Sci. 17(3): 131-146 (2016) - 2015
- [j26]Marisa Gutierrez, Benjamin Lévêque, Silvia B. Tondato:
Asteroidal quadruples in non rooted path graphs. Discuss. Math. Graph Theory 35(4): 603-614 (2015) - [i15]Daniel Gonçalves, Kolja B. Knauer, Benjamin Lévêque:
Structure of Schnyder labelings on orientable surfaces. CoRR abs/1501.05475 (2015) - [i14]Vincent Despré, Daniel Gonçalves, Benjamin Lévêque:
Encoding toroidal triangulations. CoRR abs/1507.05461 (2015) - 2014
- [j25]Pinar Heggernes
Contracting Graphs to Paths and Trees. Algorithmica 68(1): 109-132 (2014) - [j24]Pinar Heggernes
Contracting chordal graphs and bipartite graphs to paths and trees. Discret. Appl. Math. 164: 444-449 (2014) - [j23]Daniel Gonçalves
Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations. Discret. Comput. Geom. 51(1): 67-131 (2014) - [j22]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. Discret. Math. 317: 19-32 (2014) - [j21]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) - [j20]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-Distance Coloring of Sparse Graphs. J. Graph Theory 77(3): 190-218 (2014) - [i13]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) - 2013
- [i12]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) - [i11]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
List coloring the square of sparse graphs with large degree. CoRR abs/1308.4197 (2013) - [i10]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. CoRR abs/1309.0971 (2013) - 2012
- [j19]Benjamin Lévêque, Dominique de Werra:
Graph transformations preserving the stability number. Discret. Appl. Math. 160(18): 2752-2759 (2012) - [j18]Daniel Gonçalves
Triangle Contact Representations and Duality. Discret. Comput. Geom. 48(1): 239-254 (2012) - [j17]Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon:
On graphs with no induced subdivision of K4. J. Comb. Theory B 102(4): 924-947 (2012) - [j16]Kathie Cameron, Benjamin Lévêque, Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction. Theor. Comput. Sci. 428: 10-17 (2012) - [i9]Daniel Gonçalves
Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations. CoRR abs/1202.0911 (2012) - 2011
- [j15]Pinar Heggernes
Contracting chordal graphs and bipartite graphs to paths and trees. Electron. Notes Discret. Math. 37: 87-92 (2011) - [j14]Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou:
2-distance coloring of sparse graphs. Electron. Notes Discret. Math. 38: 155-160 (2011) - [j13]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Characterizing directed path graphs by forbidden asteroids. J. Graph Theory 68(2): 103-112 (2011) - [c3]Pinar Heggernes
Contracting Graphs to Paths and Trees. IPEC 2011: 55-66 - [i8]Pinar Heggernes, Pim van 't Hof, Benjamin Lévêque, Daniel Lokshtanov, Christophe Paul:
Contracting Graphs to Paths and Trees. CoRR abs/1104.3677 (2011) - 2010
- [c2]Daniel Gonçalves
Triangle Contact Representations and Duality. GD 2010: 262-273 - [c1]Steven Chaplick
From Path Graphs to Directed Path Graphs. WG 2010: 256-265
2000 – 2009
- 2009
- [j12]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. Discret. Appl. Math. 157(17): 3540-3551 (2009) - [j11]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Asteroids in rooted and directed path graphs. Electron. Notes Discret. Math. 32: 67-74 (2009) - [j10]Benjamin Lévêque, Dominique de Werra:
Graph transformations preserving the stability number. Electron. Notes Discret. Math. 35: 3-8 (2009) - [j9]Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs. J. Graph Theory 62(4): 369-384 (2009) - [j8]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. Theor. Comput. Sci. 410(21-23): 2234-2240 (2009) - 2008
- [j7]Yannick Frein, Benjamin Lévêque, András Sebö:
Generating All Sets With Bounded Unions. Comb. Probab. Comput. 17(5): 641-660 (2008) - [j6]Jean-Claude Bermond, David Coudert, Benjamin Lévêque:
Approximations for All-to-All Uniform Traffic Grooming on Unidirectional Rings. J. Interconnect. Networks 9(4): 471-486 (2008) - [j5]Benjamin Lévêque, Frédéric Maffray:
Coloring Bull-Free Perfectly Contractile Graphs. SIAM J. Discret. Math. 21(4): 999-1018 (2008) - [i7]Benjamin Lévêque, Frédéric Maffray, Myriam Preissmann:
Characterizing path graphs by forbidden induced subgraphs. CoRR abs/0803.0956 (2008) - [i6]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Asteroids in rooted and directed path graphs. CoRR abs/0812.2734 (2008) - 2007
- [b1]Benjamin Lévêque:
Coloration de graphes : structures et algorithmes. (Coloring graphs : structures and algorithms). Joseph Fourier University, Grenoble, France, 2007 - [j4]Yannick Frein, Benjamin Lévêque, András Sebö:
Optimizing diversity. Electron. Notes Discret. Math. 29: 73-77 (2007) - [j3]Benjamin Lévêque, David Y. Lin, Frédéric Maffray, Nicolas Trotignon:
Detecting induced subgraphs. Electron. Notes Discret. Math. 29: 207-211 (2007) - [j2]Vincent Jost
Precoloring Extension of Co-Meyniel Graphs. Graphs Comb. 23(3): 291-301 (2007) - [i5]Yannick Frein, Benjamin Lévêque, András Sebö:
Optimizing diversity. CoRR abs/0711.2998 (2007) - 2005
- [j1]Benjamin Lévêque, Frédéric Maffray:
Coloring Meyniel graphs in linear time. Electron. Notes Discret. Math. 22: 25-28 (2005) - [i4]Benjamin Lévêque, Frédéric Maffray, Bruce A. Reed, Nicolas Trotignon:
Coloring Artemis graphs. CoRR abs/cs/0504082 (2005) - [i3]Vincent Jost, Benjamin Lévêque, Frédéric Maffray:
Precoloring co-Meyniel graphs. CoRR abs/cs/0509004 (2005) - [i2]Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction. CoRR abs/cs/0509023 (2005) - 2004
- [i1]Benjamin Lévêque, Frédéric Maffray:
Coloring Meyniel graphs in linear time. CoRR cs.DM/0405059 (2004)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-24 00:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: