Matthew Drescher

According to our database, Matthew Drescher authored at least 9 papers between 2010 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion.

Matthew Drescher, Samuel Fiorini, Tony Huynh

Eur. J. Comb., 2024

Constructions, bounds, and algorithms for peaceable queens.

Katie Clinch, Matthew Drescher, Tony Huynh, Abdallah Saffidine

CoRR, 2024

2023

A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams.

Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh

Discret. Appl. Math., October, 2023

A tight approximation algorithm for the cluster vertex deletion problem.

Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh

Math. Program., February, 2023

BOBA: A Parallel Lightweight Graph Reordering Algorithm with Heavyweight Implications.

Matthew Drescher, Muhammad A. Awad, Serban D. Porumbescu, John D. Owens

CoRR, 2023

2021

Short rainbow cycles in graphs and matroids.

Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo, Tony Huynh, Bojan Mohar, Amanda Montejano

J. Graph Theory, 2021

2020

A simple 7/3-approximation algorithm for feedback vertex set in tournaments.

Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh

CoRR, 2020

2019

The Adaptive sampling revisited.

Matthew Drescher, Guy Louchard, Yvik Swan

Discret. Math. Theor. Comput. Sci., 2019

2010

An approximation algorithm for the maximum leaf spanning arborescence problem.

Matthew Drescher, Adrian Vetta

ACM Trans. Algorithms, 2010