default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRémi de Joannis de Verclos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Stijn Cambie
, Rémi de Joannis de Verclos, Ross J. Kang:
Regular Turán numbers and some Gan-Loh-Sudakov-type problems. J. Graph Theory 102(1): 67-85 (2023)- 2022
- [j14]Pierre Aboulker, Nicolas Bousquet, Rémi de Joannis de Verclos:
Chordal Directed Graphs Are Not $\chi$-Bounded. Electron. J. Comb. 29(2) (2022) - [j13]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Strong chromatic index and Hadwiger number. J. Graph Theory 100(3): 435-457 (2022) - [j12]Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang:
Maximizing Line Subgraphs of Diameter at Most t. SIAM J. Discret. Math. 36(2): 939-950 (2022) - 2021
- [j11]N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel:
Structure and Colour in Triangle-Free Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j10]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Occupancy fraction, fractional colouring, and triangle fraction. J. Graph Theory 97(4): 557-568 (2021) - [c6]Vincent Cohen-Addad, Rémi de Joannis de Verclos, Guillaume Lagarde:
Improving Ultrametrics Embeddings Through Coresets. ICML 2021: 2060-2068 - [c5]Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang:
An improved procedure for colouring graphs of bounded local density. SODA 2021: 135-148 - 2020
- [j9]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Bipartite Induced Density in Triangle-Free Graphs. Electron. J. Comb. 27(2): 2 (2020) - [j8]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Coloring triangle-free graphs with local list sizes. Random Struct. Algorithms 57(3): 730-744 (2020) - [i8]Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang:
An improved procedure for colouring graphs of bounded local density. CoRR abs/2007.07874 (2020)
2010 – 2019
- 2019
- [j7]Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos:
Exact Distance Colouring in Trees. Comb. Probab. Comput. 28(2): 177-186 (2019) - [c4]Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Approximate Strong Edge-Colouring of Unit Disk Graphs. WAOA 2019: 154-169 - [i7]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Strong chromatic index and Hadwiger number. CoRR abs/1905.06031 (2019) - [i6]N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel:
Structure and colour in triangle-free graphs. CoRR abs/1912.13328 (2019) - 2018
- [b1]Rémi de Joannis de Verclos:
Applications of limits of combinatorial structures in geometry and graph theory. (Applications des limites de structures combinatoires en géométrie et en théorie des graphes). Grenoble Alpes University, France, 2018 - [j6]Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé:
Additive Bases and Flows in Graphs. SIAM J. Discret. Math. 32(1): 534-542 (2018) - [i5]Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Bipartite induced density in triangle-free graphs. CoRR abs/1808.02512 (2018) - [i4]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Colouring triangle-free graphs with local list sizes. CoRR abs/1812.01534 (2018) - [i3]Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Occupancy fraction, fractional colouring, and triangle fraction. CoRR abs/1812.11152 (2018) - 2017
- [j5]Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé:
Additive bases and flows in graphs. Electron. Notes Discret. Math. 61: 399-405 (2017) - [j4]Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor:
Colouring squares of claw-free graphs. Electron. Notes Discret. Math. 61: 663-669 (2017) - [j3]Rémi de Joannis de Verclos, Jean-Sébastien Sereni:
Equitable colorings of $K_4$-minor-free graphs. J. Graph Algorithms Appl. 21(6): 1091-1105 (2017) - 2016
- [i2]Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor:
Colouring squares of claw-free graphs. CoRR abs/1609.08645 (2016) - 2015
- [j2]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. Inf. Comput. 240: 31-41 (2015) - [c3]Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec:
Limits of Order Types. SoCG 2015: 300-314 - 2014
- [j1]Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The worst case behavior of randomized gossip protocols. Theor. Comput. Sci. 560: 108-120 (2014) - 2013
- [c2]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On Fixed-Polynomial Size Circuit Lower Bounds for Uniform Polynomials in the Sense of Valiant. MFCS 2013: 433-444 - [i1]Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos:
On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant. CoRR abs/1304.5910 (2013) - 2012
- [c1]Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos:
The Worst Case Behavior of Randomized Gossip. TAMC 2012: 330-345
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-04-24 23:20 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:
