| An approximation algorithm for the maximum leaf spanning arborescence problem M Drescher, A Vetta ACM Transactions on Algorithms (TALG) 6 (3), 1-18, 2010 | 46 | 2010 |
| A tight approximation algorithm for the cluster vertex deletion problem M Aprile, M Drescher, S Fiorini, T Huynh Mathematical Programming, 1-23, 2023 | 20 | 2023 |
| Short rainbow cycles in graphs and matroids M DeVos, M Drescher, D Funk, S Gonzalez Hermosillo de la Maza, K Guo, ... Journal of Graph Theory 96 (2), 192-202, 2021 | 13 | 2021 |
| A tight approximation algorithm for the cluster vertex deletion problem M Aprile, M Drescher, S Fiorini, T Huynh Integer Programming and Combinatorial Optimization: 22nd International …, 2021 | 8 | 2021 |
| A simple (2+ ϵ)-approximation algorithm for split vertex deletion M Drescher, S Fiorini, T Huynh European Journal of Combinatorics 121, 103844, 2024 | 4 | 2024 |
| A simple 7/3-approximation algorithm for feedback vertex set in tournaments M Aprile, M Drescher, S Fiorini, T Huynh arXiv preprint arXiv:2008.08779, 2020 | 4 | 2020 |
| The Adaptive sampling revisited M Drescher, G Louchard, Y Swan Discrete Mathematics & Theoretical Computer Science 21 (Analysis of Algorithms), 2019 | 2* | 2019 |
| Boba: A parallel lightweight graph reordering algorithm with heavyweight implications M Drescher, MA Awad, SD Porumbescu, JD Owens arXiv preprint arXiv:2306.10410, 2023 | 1 | 2023 |
| Two Approaches to Approximation Algorithms for Vertex Deletion Problems M Drescher PhD thesis, Université libre de bruxelles, 2021. URL: https://knavely …, 2021 | 1 | 2021 |
| Constructions, bounds, and algorithms for peaceable queens K Clinch, M Drescher, T Huynh, A Saffidine 2025 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2025 | | 2025 |
| A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali–Adams M Aprile, M Drescher, S Fiorini, T Huynh Discrete Applied Mathematics 337, 149-160, 2023 | | 2023 |
