default search action
Clément Rambaud
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j5]Gwenaël Joret, Clément Rambaud:
Neighborhood Complexity of Planar Graphs. Comb. 44(5): 1115-1148 (2024) - [j4]Lucas Picasarri-Arrieta, Clément Rambaud:
Subdivisions in dicritical digraphs with large order or digirth. Eur. J. Comb. 122: 104022 (2024) - [j3]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the Minimum Number of Arcs in \(\boldsymbol{k}\)-Dicritical Oriented Graphs. SIAM J. Discret. Math. 38(2): 1863-1901 (2024) - 2023
- [j2]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference swaps for the stable matching problem. Theor. Comput. Sci. 940(Part): 222-230 (2023) - 2022
- [j1]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the Dichromatic Number of Surfaces. Electron. J. Comb. 29(1) (2022)
Conference and Workshop Papers
- 2024
- [c3]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The Grid-Minor Theorem Revisited. SODA 2024: 1241-1245 - 2023
- [c2]Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the Minimum Number of Arcs in 4-Dicritical Oriented Graphs. WG 2023: 376-387 - 2022
- [c1]Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the Parameterized Complexity of Symmetric Directed Multicut. IPEC 2022: 11:1-11:17
Informal and Other Publications
- 2024
- [i14]Lucas Picasarri-Arrieta, Clément Rambaud:
Subdivisions in dicritical digraphs with large order or digirth. CoRR abs/2401.05938 (2024) - [i13]Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud:
Quickly excluding an apex-forest. CoRR abs/2404.17306 (2024) - [i12]Frédéric Havet, Florian Hörsch, Clément Rambaud:
Diameter of the inversion graph. CoRR abs/2405.04119 (2024) - [i11]Jedrzej Hodor, Hoang La, Piotr Micek, Clément Rambaud:
Weak coloring numbers of minor-closed graph classes. CoRR abs/2407.04588 (2024) - 2023
- [i10]Gwenaël Joret, Clément Rambaud:
Neighborhood complexity of planar graphs. CoRR abs/2302.12633 (2023) - [i9]Julien Duron, Frédéric Havet, Florian Hörsch, Clément Rambaud:
On the minimum number of inversions to make a digraph k-(arc-)strong. CoRR abs/2303.11719 (2023) - [i8]Frédéric Havet, Lucas Picasarri-Arrieta, Clément Rambaud:
On the minimum number of arcs in 4-dicritical oriented graphs. CoRR abs/2306.10784 (2023) - [i7]Vida Dujmovic, Robert Hickingbotham, Jedrzej Hodor, Gwenaël Joret, Hoang La, Piotr Micek, Pat Morin, Clément Rambaud, David R. Wood:
The grid-minor theorem revisited. CoRR abs/2307.02816 (2023) - [i6]Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, Clément Rambaud, Amadeus Reinald:
The χ-binding function of d-directional segment graphs. CoRR abs/2309.06072 (2023) - 2022
- [i5]Pierre Aboulker, Thomas Bellitto, Frédéric Havet, Clément Rambaud:
On the minimum number of arcs in k-dicritical oriented graphs. CoRR abs/2207.01051 (2022) - [i4]Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the parameterized complexity of symmetric directed multicut. CoRR abs/2208.09017 (2022) - [i3]Guillaume Aubian, Frédéric Havet, Florian Hörsch, Felix Klingelhöfer, Nicolas Nisse, Clément Rambaud, Quentin Vermande:
Problems, proofs, and disproofs on the inversion number. CoRR abs/2212.09188 (2022) - 2021
- [i2]Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the dichromatic number of surfaces. CoRR abs/2102.01034 (2021) - [i1]Eduard Eiben, Gregory Z. Gutin, Philip R. Neary, Clément Rambaud, Magnus Wahlström, Anders Yeo:
Preference Swaps for the Stable Matching Problem. CoRR abs/2112.15361 (2021)
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-16 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint