Peter Gartland

According to our database, Peter Gartland authored at least 12 papers between 2020 and 2025.

Collaborative distances:

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

2025

Tree Independence Number IV. Even-hole-free graphs.

Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time.

Peter Gartland, Daniel Lokshtanov, Tomás Masarík, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023

Quasi-Polynomial Time Techniques for Independent Set and Beyond in Hereditary Graph Classes

Peter Gartland

PhD thesis, 2023

On Induced Versions of Menger's Theorem on Sparse Graphs.

Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov

CoRR, 2023

Graph Classes with Few Minimal Separators. II. A Dichotomy.

Peter Gartland, Daniel Lokshtanov

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs.

Peter Gartland, Daniel Lokshtanov

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2021

Finding large induced sparse subgraphs in <i>c_>t</i> -free graphs in quasipolynomial time.

Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Pawel Rzazewski

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

2020

A New Characterization of <i>V</i>-Posets.

Joshua Cooper, Peter Gartland, Hays Whitlatch

Order, 2020

Independent Set on C_≥-Free Graphs in Quasi-Polynomial Time.

Peter Gartland, Daniel Lokshtanov

CoRR, 2020

Dominated Minimal Separators are Tame (Nearly All Others are Feral).

Peter Gartland, Daniel Lokshtanov

CoRR, 2020

Independent Set on P_k-Free Graphs in Quasi-Polynomial Time.

Peter Gartland, Daniel Lokshtanov

CoRR, 2020

Independent Set on $\mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time.

Peter Gartland, Daniel Lokshtanov

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020