Large induced forests in planar graphs with girth 4 or 5. - François Dross; Mickaël Montassier; Alexandre Pinlou (CoRR, 2014)

Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs. - Konrad Kazimierz Dabrowski; François Dross; Daniël Paulusma (CoRR, 2015)

Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. - François Dross; Mickaël Montassier; Alexandre Pinlou (Electron. Notes Discret. Math., 2015)

A lower bound on the order of the largest induced forest in planar graphs with high girth. - François Dross; Mickaël Montassier; Alexandre Pinlou (Discret. Appl. Math., 2016)

Fractional Triangle Decompositions in Graphs with Large Minimum Degree. - François Dross (SIAM J. Discret. Math., 2016)

Vertex partitions of (C3, C4, C6)-free planar graphs. - François Dross; Pascal Ochem (CoRR, 2017)

Colouring diamond-free graphs. - Konrad K. Dabrowski; François Dross; Daniël Paulusma (J. Comput. Syst. Sci., 2017)

Computing Small Pivot-Minors. - Konrad K. Dabrowski; François Dross; Jisu Jeong; Mamadou Moustapha Kanté; O-joung Kwon; Sang-il Oum; Daniël Paulusma (WG, 2018)

Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. - François Dross; Mickaël Montassier; Alexandre Pinlou (Electron. J. Comb., 2018)

Vertex partition of sparse graphs. (Partition des sommets de graphes peu denses). - François Dross (2018)

Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. - Stéphane Bessy; François Dross; Martin Knor; Riste Skrekovski (CoRR, 2019)

Jones' Conjecture in subcubic graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (CoRR, 2019)

Large induced forests in planar graphs with girth 4. - François Dross; Mickaël Montassier; Alexandre Pinlou (Discret. Appl. Math., 2019)

Note on 3-choosability of planar graphs with maximum degree 4. - François Dross; Borut Luzar; Mária Maceková; Roman Soták (Discret. Math., 2019)

A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. - François Dross; Mickaël Montassier; Alexandre Pinlou (Discret. Math., 2019)

Vertex partitions of (C3, C4, C6)-free planar graphs. - François Dross; Pascal Ochem (Discret. Math., 2019)

On the Unavoidability of Oriented Trees. - François Dross; Frédéric Havet (LAGOS, 2019)

Filling the complexity gaps for colouring planar and bounded degree graphs. - Konrad K. Dabrowski; François Dross; Matthew Johnson 002; Daniël Paulusma (J. Graph Theory, 2019)

Maximal Wiener index for graphs with prescribed number of blocks. - Stéphane Bessy; François Dross; Katarína Hrináková; Martin Knor; Riste Skrekovski (Appl. Math. Comput., 2020)

Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. - Stéphane Bessy; François Dross; Martin Knor; Riste Skrekovski (Discret. Appl. Math., 2020)

Complexity of planar signed graph homomorphisms to cycles. - François Dross; Florent Foucaud; Valia Mitsou; Pascal Ochem; Théo Pierron (Discret. Appl. Math., 2020)

Partitioning sparse graphs into an independent set and a graph with bounded size components. - Ilkyoo Choi; François Dross; Pascal Ochem (Discret. Math., 2020)

From light edges to strong edge-colouring of 1-planar graphs. - Julien Bensmail; François Dross; Hervé Hocquard; Éric Sopena (Discret. Math. Theor. Comput. Sci., 2020)

Decomposing Degenerate Graphs into Locally Irregular Subgraphs. - Julien Bensmail; François Dross; Nicolas Nisse (Graphs Comb., 2020)

The structure of graphs with given number of blocks and the maximum Wiener index. - Stéphane Bessy; François Dross; Katarína Hrináková; Martin Knor; Riste Skrekovski (J. Comb. Optim., 2020)

Jones' Conjecture in Subcubic Graphs. - Marthe Bonamy; François Dross; Tomás Masarík; Andrea Munaro; Wojciech Nadara; Marcin Pilipczuk; Michal Pilipczuk (Electron. J. Comb., 2021)

Powers of paths in tournaments. - Nemanja Draganic; François Dross; Jacob Fox; António Girão; Frédéric Havet; Dániel Korándi; William Lochet; David Munhá Correia; Alex D. Scott; Benny Sudakov (Comb. Probab. Comput., 2021)

Tree Pivot-Minors and Linear Rank-Width. - Konrad K. Dabrowski; François Dross; Jisu Jeong; Mamadou Moustapha Kanté; O-joung Kwon; Sang-il Oum; Daniël Paulusma (SIAM J. Discret. Math., 2021)

Generalising the achromatic number to Zaslavsky's colourings of signed graphs. - Julien Bensmail; François Dross; Nacim Oijid; Éric Sopena (Theor. Comput. Sci., 2022)

Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. - François Dross; Krzysztof Fleszar 001; Karol Wegrzycki; Anna Zych-Pawlewicz (SODA, 2023)

Separating the edges of a graph by a linear number of paths. - Marthe Bonamy; Fábio Botler; François Dross; Tássio Naia; Jozef Skokan (CoRR, 2023)

Computing pivot-minors. - Konrad K. Dabrowski; François Dross; Jisu Jeong; Mamadou Moustapha Kanté; O-joung Kwon; Sang-il Oum; Daniël Paulusma (CoRR, 2023)

The Complexity of Two Colouring Games. - Stephan Dominique Andres; François Dross; Melissa A. Huggan; Fionn Mc Inerney; Richard J. Nowakowski (Algorithmica, 2023)

Partitions of planar (oriented) graphs into a connected acyclic and an independent set. - Stijn Cambie; François Dross; Kolja Knauer; Hoang La; Petru Valicov (CoRR, 2024)

Isometric-Universal Graphs for Trees. - Edgar Baucher; François Dross; Cyril Gavoille (MFCS, 2025)

On the proper interval completion problem within some chordal subclasses. - François Dross; Claire Hilaire; Ivo Koch; Valeria Leoni; Nina Pardal; María Inés Lopez Pujato; Vinícius Fernandes dos Santos (Discret. Math., 2025)