Ikuti
Peter Gartland
Peter Gartland
CS PhD @ UCSB 2019-2023. Quant Researcher @ Optiver 2023-present
Email yang diverifikasi di ucsb.edu - Beranda
Judul
Dikutip oleh
Dikutip oleh
Tahun
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
612020
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
422021
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, ...
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 683-691, 2024
152024
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
6*2023
On Induced Versions of Menger's Theorem on Sparse Graphs
P Gartland, T Korhonen, D Lokshtanov
arXiv preprint arXiv:2309.08169, 2023
52023
Quasi-Polynomial Time Techniques for Independent Set and Beyond in Hereditary Graph Classes
P Gartland
University of California, Santa Barbara, 2023
42023
A New Characterization of -Posets
J Cooper, P Gartland, H Whitlatch
Order 37 (2), 371-387, 2020
42020
Tree Independence Number IV. Even-hole-free Graphs
M Chudnovsky, P Gartland, S Hajebi, D Lokshtanov, S Spirkl
Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025
32025
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
32023
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
Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.
Artikel 1–10