( en | de | ru )

 

Disambiguation of "Chalermsook, Parinya"

Author of the publication

copydeleteadd this publication to your clipboard
On Minimum Generalized Manhattan Connections

, , , , , , , and . Proc. 17th Algorithms and Data Structures Symposium (WADS'21), 12808, page 85--100. (2021)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Parinya Wilaiphan

Parinya Sirimachan

 

Other publications of authors with the same name

New Approximability Results for the Robust k-Median Problem., , , and . SWAT, volume 8503 of Lecture Notes in Computer Science, page 50-61. Springer, (2014)Coloring and Maximum Weight Independent Set of Rectangles., and . CoRR, (2020)On Survivable Set Connectivity., , and . SODA, page 25-36. SIAM, (2015)Parameterized Approximation Schemes for Clustering with General Norm Objectives., , , , , , , , and . FOCS, page 1377-1399. IEEE, (2023)From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More., , , , , , and . FOCS, page 743-754. IEEE Computer Society, (2017)Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs., , and . FOCS, page 444-453. IEEE Computer Society, (2014)On Minimum Generalized Manhattan Connections., , , , , , , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 85-100. Springer, (2021)Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More, , and . CoRR, (2012)Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation., , and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 409-420. Springer, (2014)Simple Distributed Algorithms for Approximating Minimum Steiner Trees., and . COCOON, volume 3595 of Lecture Notes in Computer Science, page 380-389. Springer, (2005)