( en | de | ru )

 

Disambiguation of "Drescher, Matthew"

Author of the publication

copydeleteadd this publication to your clipboard
An approximation algorithm for the maximum leaf spanning arborescence problem.

, and . ACM Trans. Algorithms, 6 (3): 46:1-46:18 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Matthew Mellon

Matthew David

Matthew Grum

Matthew The

Matthew Pugh

 

Other publications of authors with the same name

An approximation algorithm for the maximum leaf spanning arborescence problem., and . ACM Trans. Algorithms, 6 (3): 46:1-46:18 (2010)A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem., , , and . CoRR, (2020)A simple 7/3-approximation algorithm for feedback vertex set in tournaments., , , and . CoRR, (2020)A simple (2+ε)-approximation algorithm for Split Vertex Deletion., , and . CoRR, (2020)BOBA: A Parallel Lightweight Graph Reordering Algorithm with Heavyweight Implications., , , and . CoRR, (2023)The Adaptive sampling revisited., , and . Discret. Math. Theor. Comput. Sci., (2019)Short rainbow cycles in graphs and matroids., , , , , , , and . J. Graph Theory, 96 (2): 192-202 (2021)A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams., , , and . Discret. Appl. Math., (October 2023)A tight approximation algorithm for the cluster vertex deletion problem., , , and . Math. Program., 197 (2): 1069-1091 (February 2023)A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem., , , and . IPCO, volume 12707 of Lecture Notes in Computer Science, page 340-353. Springer, (2021)