The Worst Case Behavior of Randomized Gossip. - Hervé Baumann; Pierre Fraigniaud; Hovhannes A. Harutyunyan; Rémi de Joannis de Verclos (TAMC, 2012)

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)

Limits of Order Types. - Xavier Goaoc; Alfredo Hubard; Rémi de Joannis de Verclos; Jean-Sébastien Sereni; Jan Volec (SoCG, 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)

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)

Colouring squares of claw-free graphs. - Rémi de Joannis de Verclos; Ross J. Kang; Lucas Pastor (Electron. Notes Discret. Math., 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 triangle-free graphs with local list sizes. - Ewan Davies; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (CoRR, 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 (2018)

Approximate Strong Edge-Colouring of Unit Disk Graphs. - Nicolas Grelier; Rémi de Joannis de Verclos; Ross J. Kang; François Pirot (WAOA, 2019)

Exact Distance Colouring in Trees. - Nicolas Bousquet 001; Louis Esperet; Ararat Harutyunyan; Rémi de Joannis de Verclos (Comb. Probab. Comput., 2019)

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)

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)

Improving Ultrametrics Embeddings Through Coresets. - Vincent Cohen-Addad; Rémi de Joannis de Verclos; Guillaume Lagarde (ICML, 2021)

An improved procedure for colouring graphs of bounded local density. - Eoin Hurley; Rémi de Joannis de Verclos; Ross J. Kang (SODA, 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)

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)

Chordal Directed Graphs Are Not $ chi$-Bounded. - Pierre Aboulker; Nicolas Bousquet 001; Rémi de Joannis de Verclos (Electron. J. Comb., 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)

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)

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)