共 50 条
- [1] Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 5276 - 5290
- [3] Independent Set on Pk-Free Graphs in Quasi-Polynomial Time 2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 613 - 624
- [5] Choosability of P5-Free Graphs MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009, 2009, 5734 : 382 - 391
- [7] A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 709 - 720
- [9] DOMINATION PROBLEMS ON P5-FREE GRAPHS RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2014, 48 (05): : 541 - 549