François Dross
Orcid: 0000-0002-0535-9640
According to our database1,
François Dross
authored at least 35 papers
between 2014 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
7
8
9
1
1
3
1
3
7
7
1
2
2
2
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
Discret. Math., 2025
2024
Partitions of planar (oriented) graphs into a connected acyclic and an independent set.
CoRR, 2024
2023
Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
2022
Theor. Comput. Sci., 2022
2021
2020
J. Comb. Optim., 2020
Discret. Math. Theor. Comput. Sci., 2020
Partitioning sparse graphs into an independent set and a graph with bounded size components.
Discret. Math., 2020
Discret. Appl. Math., 2020
Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs.
Discret. Appl. Math., 2020
Appl. Math. Comput., 2020
2019
J. Graph Theory, 2019
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs.
Discret. Math., 2019
Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs.
CoRR, 2019
2018
PhD thesis, 2018
Electron. J. Comb., 2018
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2018
2017
Vertex partitions of (C<sub>3</sub>, C<sub>4</sub>, C<sub>6</sub>)-free planar graphs.
CoRR, 2017
2016
SIAM J. Discret. Math., 2016
A lower bound on the order of the largest induced forest in planar graphs with high girth.
Discret. Appl. Math., 2016
2015
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree.
Electron. Notes Discret. Math., 2015
CoRR, 2015
2014