François Dross

55 papers A* 1B 2C 2Journal 48Unranked 1

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