Independent Set on $ mathrm{P}_{k}$-Free Graphs in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov (FOCS, 2020)

Independent Set on Pk-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 C≥-Free Graphs in Quasi-Polynomial Time. - Peter Gartland; Daniel Lokshtanov (CoRR, 2020)

A New Characterization of V-Posets. - Joshua Cooper 002; Peter Gartland; Hays Whitlatch (Order, 2020)

Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time. - Peter Gartland; Daniel Lokshtanov; Marcin Pilipczuk; Michal Pilipczuk; Pawel Rzazewski (STOC, 2021)

Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs. - Peter Gartland; Daniel Lokshtanov (SODA, 2023)

Graph Classes with Few Minimal Separators. II. A Dichotomy. - Peter Gartland; Daniel Lokshtanov (SODA, 2023)

On Induced Versions of Menger's Theorem on Sparse Graphs. - Peter Gartland; Tuukka Korhonen; Daniel Lokshtanov (CoRR, 2023)

Quasi-Polynomial Time Techniques for Independent Set and Beyond in Hereditary Graph Classes - Peter Gartland (2023)

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 (STOC, 2024)

Tree Independence Number IV. Even-hole-free graphs. - Maria Chudnovsky; Peter Gartland; Sepehr Hajebi; Daniel Lokshtanov; Sophie Spirkl (SODA, 2025)