Research

Published articles:

  1. J. Bensmail, F. Dross, N. Oijid, and É. Sopena. Generalising the achromatic number to Zaslavsky's colourings of signed graphs. In Theoretical Computer Science, 2022. Arxiv version.

  2. S. D. Andres, F. Dross, M. Huggan, F. Mc Inerney, and R. Nowakowski. On the Complexity of Orthogonal Colouring Games and the NP-Completeness of Recognising Graphs Admitting a Strictly Matched Involution. In Algorithmica. 2022.

  3. N. Draganić, F. Dross, J. Fox, A. Girão, F. Havet, D. Korándi, W. Lochet, D. Munhá Correia, A Scott, and B. Sudakov. Powers of paths in tournaments. In Combinatorics, Probability and Computing, 30(6), 894-898. 2021. Arxiv version.

  4. K. Dabrowski, F. Dross, J. Jeong, M. Kanté, O-j. Kwon, S-i. Oum, and D. Paulusma. Tree pivot-minors and linear rank-width. In SIAM Journal on Discrete Mathematics, 35(4), 2922-2945. 2021. Arxiv version.

  5. F. Dross and F. Havet. On the unavoidability of oriented trees. In Journal of Combinatorial Theory, Series B, 151, 83-110. 2021. Arxiv version.

  6. M. Bonamy, F. Dross, T. Masařík, W. Nadara, M. Pilipczuk, and M. Pilipczuk. Jones’ Conjecture in subcubic graphs. In Electronic Journal of Combinatorics, 8(4) 2021. Arxiv version.

  7. F. Dross, F. Foucaud, V. Mitsou, P. Ochem, and T. Pierron. Complexity of planar signed graph homomorphisms to cycles. In Discrete Applied Mathematics, 284, 166-178, 2020. Arxiv version.

  8. I. Choi, F. Dross, and P. Ochem. Partitioning sparse graphs into an independent set and a graph with bounded size components. In Discrete Mathematics, 343(8), 2020. Arxiv version.

  9. S. Bessy, F. Dross, K. Hrinakova, M. Knor, and R. Skrekovski. Maximal Wiener index for graphs with prescribed number of blocks. In Applied Mathematics and Computation, 380, 2020.

  10. J. Bensmail, F. Dross, and N. Nisse. Decomposing degenerate graphs into locally irregular subgraphs. In Graphs and Combinatorics, 2020.

  11. S. Bessy, F. Dross, M. Knor et R. Skrekovski. Graphs with the second and third maximum Wiener index over the 2-vertex connected graphs. In Discrete Applied Mathematics, 284, 2020. Arxiv version.

  12. J. Bensmail, F. Dross, H. Hocquard, and E. Sopena. From light edges to strong edge-colouring of 1-planar graphs. In Discrete Mathematics & Theoretical Computer Science, 22(1), 2020.

  13. S. Bessy, F. Dross, K. Hrinakova, M. Knor, and R. Skrekovski. The structure of graphs with given number of blocks and the maximum Wiener index. In Journal of Combinatorial Optimization, 39, 170-184, 2020. Arxiv version.

  14. F. Dross, B. Lužar, M. Maceková, and R. Soták. Note on 3-Choosability of Planar Graphs with Maximum Degree 4. In Discrete Mathematics, 342(11), 3123-3129, 2019. Arxiv version.

  15. F. Dross and P. Ochem. Vertex partitions of (C3,C4,C6)-free planar graphs. In Discrete Mathematics, 342(11), 3229–3236, 2019. Arxiv version.

  16. K. Dabrowski, F. Dross, M. Johnson, and D. Paulusma. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. In Journal of Graph Theory, 92(4), 377–393, 2019. Arxiv version.

  17. F. Dross, M. Montassier, and A. Pinlou. Large induced forests in planar graphs with girth 4. In Discrete Mathematics, 342(4), 943–950, 2019. Arxiv version.

  18. F. Dross, M. Montassier, and A. Pinlou. Partitioning sparse graphs into an independent set and a forest of bounded degree. In The Electronic Journal of Combinatorics, 25(1), 2018. Arxiv version.

  19. F. Dross, M. Montassier, and A. Pinlou. A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. In Discrete Mathematics 342(4), 943–950, 2019. Arxiv version.

  20. K. Dabrowski, F. Dross, and D. Paulusma. Colouring diamond-free graphs. Journal of Computer and System Science, 89, 410–431, 2017. Arxiv version.

  21. F. Dross, M. Montassier, and A. Pinlou. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. European Journal of Combinatorics, 66(C), 81–94, 2017. Selected papers of EuroComb15. Arxiv version.

  22. F. Dross, M. Montassier, and A. Pinlou. A lower bound on the order of the largest induced forest in planar graphs with high girth. Discrete Applied Mathematics, 214, 99–107, 2016. Arxiv version.

  23. F. Dross. Fractional triangle decompositions in graphs with large minimum degree. SIAM Journal on Discrete Mathematics, 30(1), 36–42, 2016. Arxiv version.

International conferences:

  1. F. Dross, K. Fleszar, K. Węgrzycki, and A. Zych-Pawlewicz. Gap-ETH-Tight Approximation Schemes for Red-Green-Blue Separation and Bicolored Noncrossing Euclidean Travelling Salesman Tours, In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (1433-1463) (SODA 2023), 2023. Arxiv version.

  2. K. Dabrowski, F. Dross, J. Jeong, M. Kanté, O-j. Kwon, S-i. Oum, and D. Paulusma. Tree Pivot-Minors and Linear Rank-Width. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2019), 2019.

  3. F. Dross and F. Havet. On the unavoidability of oriented trees. In Electronic Notes in Theoretical Computer Science 346, 425–436 (LAGOS 2019).

  4. K. Dabrowski, F. Dross, J. Jeong, M. Kanté, O. Kwon, S. Oum, and D. Paulusma. Computing Small Pivot-Minors. In the 44th International Workshop on Graph-Theoretic Concepts in Computer Science (WG2018), 2018.

  5. K. Dabrowski, F. Dross, and D. Paulusma. Colouring diamond-free graphs. In the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016.

  6. K. Dabrowski, F. Dross, M. Johnson, and D. Paulusma. Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs. In the 26th International Workshop on Combinatorial Algorithms (IWOCA 2015), Lecture Notes in Computer Science, 9538, 100–111, 2016.

  7. F. Dross, M. Montassier, and A. Pinlou. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. In European Conference on Combinatorics, Graph Theory and Applications (Eurocomb 2015), Electronic Notes in Discrete Mathematics, 49, 269–275, 2015.

Submitted articles:

  1. M. Bonamy, F. Botler, F. Dross, T. Naia, and J. Skokan. Separating the edges of a graph by a linear number of paths. 2023.

  2. F. Dross, C. Hilaire, I. Koch, V. Leoni, N. Pardal, M.I. Lopez Pujato, and V. Fernandez dos Santos. On the proper interval completion problem within some chordal subclasses, to appear in Discrete Mathematics, 2021. Arxiv version.


Here is my Phd. Thesis.