| Fractional triangle decompositions in graphs with large minimum degree F Dross SIAM Journal on Discrete Mathematics 30 (1), 36-42, 2016 | 39 | 2016 |
| Colouring diamond-free graphs KK Dabrowski, F Dross, D Paulusma Journal of computer and system sciences 89, 410-431, 2017 | 32 | 2017 |
| Partitioning a triangle-free planar graph into a forest and a forest of bounded degree F Dross, M Montassier, A Pinlou European Journal of Combinatorics 66, 81-94, 2017 | 23 | 2017 |
| Partitioning sparse graphs into an independent set and a forest of bounded degree F Dross, M Montassier, A Pinlou arXiv preprint arXiv:1606.04394, 2016 | 12 | 2016 |
| Decomposing degenerate graphs into locally irregular subgraphs J Bensmail, F Dross, N Nisse Graphs and Combinatorics 36 (6), 1869-1889, 2020 | 11 | 2020 |
| Powers of paths in tournaments N Draganić, F Dross, J Fox, A Girão, F Havet, D Korándi, W Lochet, ... Combinatorics, Probability and Computing 30 (6), 894-898, 2021 | 10 | 2021 |
| A lower bound on the order of the largest induced forest in planar graphs with high girth F Dross, M Montassier, A Pinlou Discrete Applied Mathematics 214, 99-107, 2016 | 10 | 2016 |
| Filling the complexity gaps for colouring planar and bounded degree graphs KK Dabrowski, F Dross, M Johnson, D Paulusma Journal of Graph Theory 92 (4), 377-393, 2019 | 9 | 2019 |
| Computing small pivot-minors KK Dabrowski, F Dross, J Jeong, MM Kanté, O Kwon, S Oum, D Paulusma Graph-Theoretic Concepts in Computer Science: 44th International Workshop …, 2018 | 9 | 2018 |
| On the unavoidability of oriented trees F Dross, F Havet Journal of Combinatorial Theory, Series B 151, 83-110, 2021 | 8 | 2021 |
| Large induced forests in planar graphs with girth 4 or 5 F Dross, M Montassier, A Pinlou arXiv preprint arXiv:1409.1348, 2014 | 8 | 2014 |
| Maximal Wiener index for graphs with prescribed number of blocks S Bessy, F Dross, K Hriňáková, M Knor, R Škrekovski Applied Mathematics and Computation 380, 125274, 2020 | 7 | 2020 |
| Complexity of planar signed graph homomorphisms to cycles F Dross, F Foucaud, V Mitsou, P Ochem, T Pierron Discrete Applied Mathematics 284, 166-178, 2020 | 6 | 2020 |
| Graphs with the second and third maximum Wiener indices over the 2-vertex connected graphs S Bessy, F Dross, M Knor, R Škrekovski Discrete Applied Mathematics 284, 195-200, 2020 | 6 | 2020 |
| From light edges to strong edge-colouring of 1-planar graphs J Bensmail, F Dross, H Hocquard, E Sopena Discrete Mathematics & Theoretical Computer Science 22 (Graph Theory), 2020 | 6 | 2020 |
| Separating the edges of a graph by a linear number of paths M Bonamy, F Botler, F Dross, T Naia, J Skokan arXiv preprint arXiv:2301.08707, 2023 | 5 | 2023 |
| Tree pivot-minors and linear rank-width KK Dabrowski, F Dross, J Jeong, MM Kante, O Kwon, S Oum, D Paulusma SIAM Journal on Discrete Mathematics 35 (4), 2922-2945, 2021 | 5 | 2021 |
| Large induced forests in planar graphs with girth 4 F Dross, M Montassier, A Pinlou Discrete Applied Mathematics 254, 96-106, 2019 | 5 | 2019 |
| Partitioning sparse graphs into an independent set and a graph with bounded size components I Choi, F Dross, P Ochem Discrete Mathematics 343 (8), 111921, 2020 | 4 | 2020 |
| The structure of graphs with given number of blocks and the maximum Wiener index S Bessy, F Dross, K Hriňáková, M Knor, R Škrekovski Journal of Combinatorial Optimization 39 (1), 170-184, 2020 | 4 | 2020 |
