default search action
Clément Requilé
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j11]Jordi Castellví, Michael Drmota, Marc Noy, Clément Requilé:
Chordal graphs with bounded tree-width. Adv. Appl. Math. 157: 102700 (2024) - 2023
- [j10]Michael Drmota, Marc Noy, Clément Requilé
, Juanjo Rué:
Random Cubic Planar Maps. Electron. J. Comb. 30(2) (2023) - [j9]Jordi Castellví, Marc Noy, Clément Requilé
Enumeration of chordal planar graphs and maps. Discret. Math. 346(1): 113163 (2023) - [j8]Marc Noy, Clément Requilé
Enumeration of labelled 4-regular planar graphs II: Asymptotics. Eur. J. Comb. 110: 103661 (2023) - 2022
- [i4]Jordi Castellví, Marc Noy, Clément Requilé:
Enumeration of chordal planar graphs and maps. CoRR abs/2202.13340 (2022) - 2021
- [c5]Marion Buffard, Aurélien Desoeuvres
LNetReduce: Tool for Reducing Linear Dynamic Networks with Separated Timescales. CMSB 2021: 238-244 - 2020
- [j7]Michael Drmota, Lander Ramos, Clément Requilé
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. Electron. J. Comb. 27(1): 1 (2020) - [j6]Marc Noy, Clément Requilé
Further results on random cubic planar graphs. Random Struct. Algorithms 56(3): 892-924 (2020) - [c4]Dimbinaina Ralaivaosaona, Clément Requilé
Block Statistics in Subcritical Graph Classes. AofA 2020: 24:1-24:14 - [i3]Marc Noy, Clément Requilé, Juanjo Rué:
On the expected number of perfect matchings in cubic planar graphs. CoRR abs/2005.13821 (2020)
2010 – 2019
- 2018
- [j5]Malgorzata Bednarska-Bzdega, Michael Krivelevich, Viola Mészáros, Clément Requilé
Proper colouring Painter-Builder game. Discret. Math. 341(3): 658-664 (2018) - [c3]Michael Drmota, Lander Ramos, Clément Requilé
Maximal Independent Sets and Maximal Matchings in Series-Parallel and Related Graph Classes. AofA 2018: 18:1-18:15 - 2017
- [j4]Marc Noy, Clément Requilé
Enumeration of labeled 4-regular planar graphs. Electron. Notes Discret. Math. 61: 933-939 (2017) - [j3]Dan Hefetz
Strong Ramsey games: Drawing on an infinite board. J. Comb. Theory A 150: 248-266 (2017) - 2016
- [j2]Marc Noy, Clément Requilé
Random cubic planar graphs revisited. Electron. Notes Discret. Math. 54: 211-216 (2016) - [c2]Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Spyridon Maniatis, Clément Requilé
FPT Algorithms for Plane Completion Problems. MFCS 2016: 26:1-26:13 - 2015
- [j1]Clément Requilé
Triangles in random cubic planar graphs. Electron. Notes Discret. Math. 49: 383-391 (2015) - [c1]Petr A. Golovach
Variants of Plane Diameter Completion. IPEC 2015: 30-42 - [i2]Dimitris Chatzidimitriou, Archontia C. Giannopoulou, Clément Requilé, Dimitrios M. Thilikos, Dimitris Zoros:
A Fixed Parameter Algorithm for Plane Subgraph Completion. CTW 2015: 97-100 - [i1]Petr A. Golovach, Clément Requilé, Dimitrios M. Thilikos:
Variants of Plane Diameter Completion. CoRR abs/1509.00757 (2015)
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 2024-10-09 20:31 CEST 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: