8 citations · 30 across the 29 of their papers we have counts for
4 papers · 1 filter
On Minimum Generalized Manhattan Connections
Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook +5
We consider minimum-cardinality Manhattan connected sets with arbitrary demands: Given a collection of points in the plane, together with a subset of pairs of points in (wh…
Coloring and Maximum Weight Independent Set of Rectangles
Parinya Chalermsook, Bartosz Walczak
In 1960, Asplund and Grünbaum proved that every intersection graph of axis-parallel rectangles in the plane admits an -coloring, where is the maximum size of a clique.…
Vertex Sparsification for Edge Connectivity
Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit +5
Graph compression or sparsification is a basic information-theoretic and computational question. A major open problem in this research area is whether -approximate cut-prese…
Multi-transversals for Triangles and the Tuza's Conjecture
Parinya Chalermsook, Samir Khuller, Pattara Sukprasert +1
In this paper, we study a primal and dual relationship about triangles: For any graph , let be the maximum number of edge-disjoint triangles in , and be the min…