Rémi de Joannis de Verclos

According to our database, Rémi de Joannis de Verclos authored at least 21 papers between 2012 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Regular Turán numbers and some Gan-Loh-Sudakov-type problems.

Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang

J. Graph Theory, 2023

2022

Maximizing Line Subgraphs of Diameter at Most t.

Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang

SIAM J. Discret. Math., 2022

Strong chromatic index and Hadwiger number.

Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot

J. Graph Theory, 2022

Chordal Directed Graphs Are Not $\chi$-Bounded.

Pierre Aboulker, Nicolas Bousquet, Rémi de Joannis de Verclos

Electron. J. Comb., 2022

2021

Occupancy fraction, fractional colouring, and triangle fraction.

Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot

J. Graph Theory, 2021

Structure and Colour in Triangle-Free Graphs.

N. R. Aravind, Stijn Cambie, Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, Viresh Patel

Electron. J. Comb., 2021

An improved procedure for colouring graphs of bounded local density.

Eoin Hurley, Rémi de Joannis de Verclos, Ross J. Kang

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Improving Ultrametrics Embeddings Through Coresets.

Vincent Cohen-Addad, Rémi de Joannis de Verclos, Guillaume Lagarde

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

Coloring triangle-free graphs with local list sizes.

Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot

Random Struct. Algorithms, 2020

Bipartite Induced Density in Triangle-Free Graphs.

Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot

Electron. J. Comb., 2020

2019

Exact Distance Colouring in Trees.

Nicolas Bousquet, Louis Esperet, Ararat Harutyunyan, Rémi de Joannis de Verclos

Comb. Probab. Comput., 2019

Approximate Strong Edge-Colouring of Unit Disk Graphs.

Nicolas Grelier, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

2018

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).

Rémi de Joannis de Verclos

PhD thesis, 2018

Colouring triangle-free graphs with local list sizes.

Ewan Davies, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot

CoRR, 2018

2017

Equitable colorings of $K_4$-minor-free graphs.

Rémi de Joannis de Verclos, Jean-Sébastien Sereni

J. Graph Algorithms Appl., 2017

Colouring squares of claw-free graphs.

Rémi de Joannis de Verclos, Ross J. Kang, Lucas Pastor

Electron. Notes Discret. Math., 2017

Additive bases and flows in graphs.

Louis Esperet, Rémi de Joannis de Verclos, Tien-Nam Le, Stéphan Thomassé

Electron. Notes Discret. Math., 2017

2015

On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant.

Hervé Fournier, Sylvain Perifel, Rémi de Joannis de Verclos

Inf. Comput., 2015

Limits of Order Types.

Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, Jan Volec

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

The worst case behavior of randomized gossip protocols.

Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos

Theor. Comput. Sci., 2014

2012

The Worst Case Behavior of Randomized Gossip.

Hervé Baumann, Pierre Fraigniaud, Hovhannes A. Harutyunyan, Rémi de Joannis de Verclos

Proceedings of the Theory and Applications of Models of Computation, 2012