![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Matthew Drescher
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j6]Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion. Eur. J. Comb. 121: 103844 (2024) - 2023
- [j5]Manuel Aprile
, Matthew Drescher, Samuel Fiorini
, Tony Huynh
:
A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams. Discret. Appl. Math. 337: 149-160 (2023) - [j4]Manuel Aprile
, Matthew Drescher, Samuel Fiorini, Tony Huynh
:
A tight approximation algorithm for the cluster vertex deletion problem. Math. Program. 197(2): 1069-1091 (2023) - 2021
- [j3]Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo
, Tony Huynh
, Bojan Mohar
, Amanda Montejano
:
Short rainbow cycles in graphs and matroids. J. Graph Theory 96(2): 192-202 (2021) - 2019
- [j2]Matthew Drescher, Guy Louchard, Yvik Swan:
The Adaptive sampling revisited. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - 2010
- [j1]Matthew Drescher, Adrian Vetta:
An approximation algorithm for the maximum leaf spanning arborescence problem. ACM Trans. Algorithms 6(3): 46:1-46:18 (2010)
Conference and Workshop Papers
- 2021
- [c1]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh
:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. IPCO 2021: 340-353
Informal and Other Publications
- 2024
- [i5]Katie Clinch, Matthew Drescher, Tony Huynh, Abdallah Saffidine:
Constructions, bounds, and algorithms for peaceable queens. CoRR abs/2406.06974 (2024) - 2023
- [i4]Matthew Drescher, Muhammad A. Awad
, Serban D. Porumbescu, John D. Owens:
BOBA: A Parallel Lightweight Graph Reordering Algorithm with Heavyweight Implications. CoRR abs/2306.10410 (2023) - 2020
- [i3]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. CoRR abs/2007.08057 (2020) - [i2]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple 7/3-approximation algorithm for feedback vertex set in tournaments. CoRR abs/2008.08779 (2020) - [i1]Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ε)-approximation algorithm for Split Vertex Deletion. CoRR abs/2009.11056 (2020)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint