Coloring and Maximum Weight Independent Set of Rectangles

von Chalermsook, Parinya
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 2 of 4 (2021)

On Finding Balanced Bicliques via Matchings

von Chalermsook, Parinya
Veröffentlicht in WG (46. : 2020 : Online) Graph-theoretic concepts in computer science (2020)

Approximation and online algorithms : 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, proceedings

Veröffentlicht 2022

Independent Set in k-Claw-Free Graphs: Conditional x-Boundedness and the Power of LP/SDP Relaxations

von Chalermsook, Parinya
Veröffentlicht in WAOA (21. : 2023 : Amsterdam) Approximation and online algorithms (2023)

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition

von Chalermsook, Parinya
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (34. : 2023 : Florenz; Online) Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) ; Volume 1 of 7 (2023)

Vertex Sparsification for Edge Connectivity

von Chalermsook, Parinya
Veröffentlicht in ACM-SIAM Symposium on Discrete Algorithms (32. : 2021 : Online) Thirty-second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) ; Volume 2 of 4 (2021)

On Minimum Generalized Manhattan Connections

von Antoniadis, Antonios
Veröffentlicht in WADS (17. : 2021 : Online) Algorithms and data structures (2021)