Maria Chudnovsky, Peter Gartland, Daniel Lokshtanov Independent Set on Even-Hole-Free Graphs in Quasi-Polynomial Time in preparation
Maria Chudnovsky, Peter Gartland, Daniel Lokshtanov Independent Set on {Theta, Pyramid}-Free Graphs in Quasi-Polynomial Time in preparation
Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl Induced Subgraphs and Tree Decompositions XV. Even-Hole-Free Graphs with Bounded Clique Number of Logrithmic Treewidth submitted
Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov On Induced Versions of Menger's Theorem on Sparse Graphs submitted
Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Symposium on Theory of Computing (STOC) 2024
Peter Gartland and Daniel Lokshtanov Graph Classes with Few Minimal Separators. II. A Dichotomy Symposium on Discrete Algorithms (SODA) 2023
Peter Gartland and Daniel Lokshtanov Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs Symposium on Discrete Algorithms (SODA) 2023
Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski Finding Large Induced Sparse Subgraphs in C>t -Free Graphs in Quasipolynomial Time Symposium on Theory of Computing (STOC) 2021
Peter Gartland and Daniel Lokshtanov Independent Set on P_k-Free Graphs in Quasi-Polynomial Time Foundations of Computer Science (FOCS) 2020.
Joshua Cooper, Peter Gartland, Hays Whitlatch A New Characterization of V-Posets Order, 2020
Maria Chudnovsky, Peter Gartland, Daniel Lokshtanov Independent Set on {Theta, Pyramid}-Free Graphs in Quasi-Polynomial Time in preparation
Maria Chudnovsky, Peter Gartland, Sepehr Hajebi, Daniel Lokshtanov, Sophie Spirkl Induced Subgraphs and Tree Decompositions XV. Even-Hole-Free Graphs with Bounded Clique Number of Logrithmic Treewidth submitted
Peter Gartland, Tuukka Korhonen, Daniel Lokshtanov On Induced Versions of Menger's Theorem on Sparse Graphs submitted
Peter Gartland, Daniel Lokshtanov, Tomáš Masařík, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time Symposium on Theory of Computing (STOC) 2024
Peter Gartland and Daniel Lokshtanov Graph Classes with Few Minimal Separators. II. A Dichotomy Symposium on Discrete Algorithms (SODA) 2023
Peter Gartland and Daniel Lokshtanov Graph Classes with Few Minimal Separators. I. Finite Forbidden Induced Subgraphs Symposium on Discrete Algorithms (SODA) 2023
Peter Gartland, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Paweł Rzążewski Finding Large Induced Sparse Subgraphs in C>t -Free Graphs in Quasipolynomial Time Symposium on Theory of Computing (STOC) 2021
Peter Gartland and Daniel Lokshtanov Independent Set on P_k-Free Graphs in Quasi-Polynomial Time Foundations of Computer Science (FOCS) 2020.
Joshua Cooper, Peter Gartland, Hays Whitlatch A New Characterization of V-Posets Order, 2020