Follow
matthew Drescher
matthew Drescher
Unknown affiliation
Verified email at ulb.be - Homepage
Title
Cited by
Cited by
Year
An approximation algorithm for the maximum leaf spanning arborescence problem
M Drescher, A Vetta
ACM Transactions on Algorithms (TALG) 6 (3), 1-18, 2010
422010
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
112021
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
112021
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
32020
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
22022
A Simple -Approximation Algorithm for Split Vertex Deletion
M Drescher, S Fiorini, T Huynh
Extended Abstracts EuroComb 2021: European Conference on Combinatorics …, 2021
22021
The Adaptive sampling revisited
M Drescher, G Louchard, Y Swan
Discrete Mathematics & Theoretical Computer Science 21 (Analysis of Algorithms), 2019
12019
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
BOBA: A Parallel Lightweight Graph Reordering Algorithm with Heavyweight Implications
M Drescher, MA Awad, SD Porumbescu, JD Owens
arXiv preprint arXiv:2306.10410, 2023
2023
Two Approaches to Approximation Algorithms for Vertex Deletion Problems
M Drescher
Université libre de Bruxelles, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–10