Follow
Peter Gartland
Peter Gartland
PhD Student, University of California, Santa Barbara
Verified email at ucsb.edu - Homepage
Title
Cited by
Cited by
Year
Independent Set on -Free Graphs in Quasi-Polynomial Time
P Gartland, D Lokshtanov
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
542020
Finding large induced sparse subgraphs in c>t -free graphs in quasipolynomial time
P Gartland, D Lokshtanov, M Pilipczuk, M Pilipczuk, P Rzążewski
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
362021
Perfect secure domination in graphs
SV Rashmi, S Arumugam, KR Bhutani, P Gartland
Categories and General Algebraic Structures with Applications 7 (Special …, 2017
122017
Maximum Weight Independent set in graphs with no long claws in quasi-polynomial time
P Gartland, D Lokshtanov, T Masařík, M Pilipczuk, M Pilipczuk, ...
arXiv preprint arXiv:2305.15738, 2023
72023
Graph classes with few minimal separators. I. finite forbidden induced subgraphs
P Gartland, D Lokshtanov
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
4*2023
A New Characterization of -Posets
J Cooper, P Gartland, H Whitlatch
Order 37 (2), 371-387, 2020
42020
On Induced Versions of Menger's Theorem on Sparse Graphs
P Gartland, T Korhonen, D Lokshtanov
arXiv preprint arXiv:2309.08169, 2023
22023
Graph classes with few minimal separators. ii. a dichotomy
P Gartland, D Lokshtanov
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
22023
Induced subgraphs and tree decompositions XV. Even-hole-free graphs with bounded clique number have logarithmic treewidth
M Chudnovsky, P Gartland, S Hajebi, D Lokshtanov, S Spirkl
arXiv preprint arXiv:2402.14211, 2024
2024
Quasi-Polynomial Time Techniques for Independent Set and Beyond in Hereditary Graph Classes
P Gartland
UC Santa Barbara, 2023
2023
The system can't perform the operation now. Try again later.
Articles 1–10