François Dross

ORCID

Publication Activity (10 Years)

Years Active: 2014-2023
Publications (10 Years): 44

Top Venues

CoRR

Discret. Math.

Discret. Appl. Math.

SIAM J. Discret. Math.

University of Montpellier, France (PHD)

Education History

University of Montpellier, France

PHD

Publications

Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing pivot-minors. CoRR (2023)
Marthe Bonamy, Fábio Botler, François Dross, Tássio Naia, Jozef Skokan
Separating the edges of a graph by a linear number of paths. CoRR (2023)
François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. SODA (2023)
Stephan Dominique Andres, François Dross, Melissa A. Huggan, Fionn Mc Inerney, Richard J. Nowakowski
The Complexity of Two Colouring Games. Algorithmica 85 (4) (2023)
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. Theor. Comput. Sci. 923 (2022)
François Dross, Krzysztof Fleszar, Karol Wegrzycki, Anna Zych-Pawlewicz
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours. CoRR (2022)
Marthe Bonamy, François Dross, Tomás Masarík, Andrea Munaro, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in Subcubic Graphs. Electron. J. Comb. 28 (4) (2021)
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
Powers of paths in tournaments. Comb. Probab. Comput. 30 (6) (2021)
François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos
On the proper interval completion problem within some chordal subclasses. CoRR (2021)
François Dross, Frédéric Havet
On the unavoidability of oriented trees. J. Comb. Theory, Ser. B 151 (2021)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree Pivot-Minors and Linear Rank-Width. SIAM J. Discret. Math. 35 (4) (2021)
Julien Bensmail, François Dross, Nacim Oijid, Éric Sopena
Generalising the achromatic number to Zaslavsky's colourings of signed graphs. CoRR (2021)
Julien Bensmail, François Dross, Hervé Hocquard, Éric Sopena
From light edges to strong edge-colouring of 1-planar graphs. Discret. Math. Theor. Comput. Sci. 22 (1) (2020)
Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
Maximal Wiener index for graphs with prescribed number of blocks. Appl. Math. Comput. 380 (2020)
François Dross
1-planar graphs with minimum degree at least 3 have bounded girth. CoRR (2020)
Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
The structure of graphs with given number of blocks and the maximum Wiener index. J. Comb. Optim. 39 (1) (2020)
Julien Bensmail, François Dross, Nicolas Nisse
Decomposing Degenerate Graphs into Locally Irregular Subgraphs. Graphs Comb. 36 (6) (2020)
Ilkyoo Choi, François Dross, Pascal Ochem
Partitioning sparse graphs into an independent set and a graph with bounded size components. Discret. Math. 343 (8) (2020)
Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs. Discret. Appl. Math. 284 (2020)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. Discret. Appl. Math. 284 (2020)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Tree pivot-minors and linear rank-width. CoRR (2020)
François Dross, Pascal Ochem
Vertex partitions of (C3, C4, C6)-free planar graphs. Discret. Math. 342 (11) (2019)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. Discret. Math. 342 (4) (2019)
François Dross, Borut Luzar, Mária Maceková, Roman Soták
Note on 3-choosability of planar graphs with maximum degree 4. Discret. Math. 342 (11) (2019)
Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
Filling the complexity gaps for colouring planar and bounded degree graphs. J. Graph Theory 92 (4) (2019)
François Dross, Florent Foucaud, Valia Mitsou, Pascal Ochem, Théo Pierron
Complexity of planar signed graph homomorphisms to cycles. CoRR (2019)
Ilkyoo Choi, François Dross, Pascal Ochem
Partitioning sparse graphs into an independent set and a graph with bounded size components. CoRR (2019)
François Dross, Frédéric Havet
On the Unavoidability of Oriented Trees. LAGOS (2019)
François Dross, Mickaël Montassier, Alexandre Pinlou
Large induced forests in planar graphs with girth 4. Discret. Appl. Math. 254 (2019)
Marthe Bonamy, François Dross, Tomás Masarík, Wojciech Nadara, Marcin Pilipczuk, Michal Pilipczuk
Jones' Conjecture in subcubic graphs. CoRR (2019)
Stéphane Bessy, François Dross, Katarína Hrináková, Martin Knor, Riste Skrekovski
The structure of graphs with given number of blocks and the maximum Wiener index. CoRR (2019)
Stéphane Bessy, François Dross, Martin Knor, Riste Skrekovski
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. CoRR (2019)
François Dross, Frédéric Havet
On the unavoidability of oriented trees. CoRR (2018)
Konrad K. Dabrowski, François Dross, Jisu Jeong, Mamadou Moustapha Kanté, O-joung Kwon, Sang-il Oum, Daniël Paulusma
Computing Small Pivot-Minors. WG (2018)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning Sparse Graphs into an Independent Set and a Forest of Bounded Degree. Electron. J. Comb. 25 (1) (2018)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Eur. J. Comb. 66 (2017)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. CoRR (2017)
Konrad K. Dabrowski, François Dross, Daniël Paulusma
Colouring diamond-free graphs. J. Comput. Syst. Sci. 89 (2017)
François Dross, Pascal Ochem
)-free planar graphs. CoRR (2017)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. CoRR (2016)
Konrad K. Dabrowski, François Dross, Daniël Paulusma
Colouring Diamond-free Graphs. SWAT (2016)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced forest in planar graphs with high girth. Discret. Appl. Math. 214 (2016)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning sparse graphs into an independent set and a forest of bounded degree. CoRR (2016)
François Dross
Fractional Triangle Decompositions in Graphs with Large Minimum Degree. SIAM J. Discret. Math. 30 (1) (2016)
Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. IWOCA (2015)
Konrad Kazimierz Dabrowski, François Dross, Daniël Paulusma
Narrowing the gap in the clique-width dichotomy for $(H_1, H_2)$-free graphs. CoRR (2015)
François Dross, Mickaël Montassier, Alexandre Pinlou
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. Electron. Notes Discret. Math. 49 (2015)
Konrad Kazimierz Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. CoRR (2015)
François Dross, Mickaël Montassier, Alexandre Pinlou
A lower bound on the order of the largest induced forest in planar graphs with high girth. CoRR (2015)
François Dross, Mickaël Montassier, Alexandre Pinlou
Large induced forests in planar graphs with girth 4 or 5. CoRR (2014)

François Dross.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

François Dross