An approximation algorithm for the maximum leaf spanning arborescence problem M Drescher, A Vetta
ACM Transactions on Algorithms (TALG) 6 (3), 1-18, 2010
42 2010 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
11 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
10 2021 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
3 2020 Bacteria associated with leaf-cutter ants drive natural antibiotic resistance in soil bacteria S Simon, K Chai, M Drescher, J Chaves-Campos
Journal of Tropical Ecology 38 (6), 410-415, 2022
1 2022 A Simple M Drescher, S Fiorini, T Huynh
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
1 2021 The Adaptive sampling revisited M Drescher, G Louchard, Y Swan
arXiv preprint arXiv:1805.08043, 2018
1 2018 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 Two Approaches to Approximation Algorithms for Vertex Deletion Problems M Drescher
Université libre de Bruxelles, 2021
2021 