default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Gartland
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c5]Peter Gartland, Daniel Lokshtanov
, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. STOC 2024: 683-691- [i6]Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl:
Tree Independence Number IV. Even-hole-free Graphs. CoRR abs/2407.08927 (2024) - 2023
- [b1]Peter Gartland:
Quasi-Polynomial Time Techniques for Independent Set and Beyond in Hereditary Graph Classes. University of California, Santa Barbara, USA, 2023 - [c4]Peter Gartland, Daniel Lokshtanov:
Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. SODA 2023: 3063-3097 - [c3]Peter Gartland, Daniel Lokshtanov:
Graph Classes with Few Minimal Separators. II. A Dichotomy. SODA 2023: 3098-3178 - [i5]Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time. CoRR abs/2305.15738 (2023) - [i4]Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov:
On Induced Versions of Menger's Theorem on Sparse Graphs. CoRR abs/2309.08169 (2023) - 2021
- [c2]Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski:
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. STOC 2021: 330-341 - 2020
- [j1]Joshua Cooper, Peter Gartland, Hays Whitlatch:
A New Characterization of V-Posets. Order 37(2): 371-387 (2020) - [c1]Peter Gartland, Daniel Lokshtanov:
Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time. FOCS 2020: 613-624 - [i3]Peter Gartland, Daniel Lokshtanov:
Independent Set on Pk-Free Graphs in Quasi-Polynomial Time. CoRR abs/2005.00690 (2020) - [i2]Peter Gartland, Daniel Lokshtanov:
Dominated Minimal Separators are Tame (Nearly All Others are Feral). CoRR abs/2007.08761 (2020) - [i1]Peter Gartland, Daniel Lokshtanov:
Independent Set on C≥-Free Graphs in Quasi-Polynomial Time. CoRR abs/2007.11402 (2020)
Coauthor Index
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-09-14 23:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
