Research output per year
Research output per year
Project Details
| Status | Finished |
|---|---|
| Effective start/end date | 01/09/2017 → 31/08/2022 |
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.
-
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
Chalermsook, P., Kaul, M., Mnich, M., Spoerhase, J., Uniyal, S. & Vaz, D., 22 Jan 2024, In: ACM Transactions on Algorithms. 20, 1, p. 1-20 6.Research output: Contribution to journal › Article › Scientific › peer-review
Open Access -
Independent Set in k-Claw-Free Graphs : Conditional X-Boundedness and the Power of LP/SDP Relaxations
Chalermsook, P., Gadekar, A., Khodamoradi, K. & Spoerhase, J., 2023, Approximation and Online Algorithms - 21st International Workshop, WAOA 2023, Proceedings. Byrka, J. & Wiese, A. (eds.). Springer, p. 205-218 14 p. (Lecture Notes in Computer Science; vol. 14297 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review
Open Access -
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver
Chalermsook, P., Huang, C. C., Nanongkai, D., Saranurak, T., Sukprasert, P. & Yingchareonthawornchai, S., 1 Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-20 20 p. 37. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 229).Research output: Chapter in Book/Report/Conference proceeding › Conference article in proceedings › Scientific › peer-review
Open AccessFile1 Citation (Scopus)55 Downloads (Pure)