default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParinya Chalermsook
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j7]Parinya Chalermsook
, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter. ACM Trans. Algorithms 20(1): 6:1-6:20 (2024)- [c45]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces. ICALP 2024: 6:1-6:19 - [c44]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai:
The Group Access Bounds for Binary Search Trees. ICALP 2024: 38:1-38:18 - [c43]Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai:
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. SODA 2024: 133-149 - 2023
- [c42]Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-Time Approximation of Independent Set Parameterized by Treewidth. ESA 2023: 33:1-33:13 - [c41]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. FOCS 2023: 1377-1399 - [c40]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai:
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. SODA 2023: 509-534 - [c39]Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
Independent Set in k-Claw-Free Graphs: Conditional χ-Boundedness and the Power of LP/SDP Relaxations. WAOA 2023: 205-218 - [i33]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation Schemes for Clustering with General Norm Objectives. CoRR abs/2304.03146 (2023) - [i32]Fateme Abbasi, Sandip Banerjee, Jaroslaw Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, Joachim Spoerhase:
Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces. CoRR abs/2305.07316 (2023) - [i31]Parinya Chalermsook, Fedor V. Fomin, Thekla Hamm, Tuukka Korhonen, Jesper Nederlof, Ly Orgo:
Polynomial-time Approximation of Independent Set Parameterized by Treewidth. CoRR abs/2307.01341 (2023) - [i30]Parinya Chalermsook, Seth Pettie, Sorrachai Yingchareonthawornchai:
Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns. CoRR abs/2307.02294 (2023) - [i29]Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Joachim Spoerhase:
Independent set in k-Claw-Free Graphs: Conditional χ-boundedness and the Power of LP/SDP Relaxations. CoRR abs/2308.16033 (2023) - [i28]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Akash Pareek, Sorrachai Yingchareonthawornchai:
The Group Access Bounds for Binary Search Trees. CoRR abs/2312.15426 (2023) - [i27]Karthik C. S., Parinya Chalermsook, Joachim Spoerhase, Meirav Zehavi, Martin G. Herold:
Parameterized Approximation: Algorithms and Hardness (Dagstuhl Seminar 23291). Dagstuhl Reports 13(7): 96-107 (2023) - 2022
- [c38]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. ICALP 2022: 37:1-37:20 - [e1]Parinya Chalermsook, Bundit Laekhanukit:
Approximation and Online Algorithms - 20th International Workshop, WAOA 2022, Potsdam, Germany, September 8-9, 2022, Proceedings. Lecture Notes in Computer Science 13538, Springer 2022, ISBN 978-3-031-18366-9 [contents] - [i26]Parinya Chalermsook, Chien-Chung Huang, Danupon Nanongkai, Thatchaphol Saranurak, Pattara Sukprasert, Sorrachai Yingchareonthawornchai:
Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver. CoRR abs/2205.14978 (2022) - [i25]Parinya Chalermsook, Manoj Gupta, Wanchote Jiamjitrak, Nidia Obscura Acosta, Akash Pareek, Sorrachai Yingchareonthawornchai:
Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition. CoRR abs/2211.04112 (2022) - 2021
- [c37]Parinya Chalermsook, Bartosz Walczak:
Coloring and Maximum Weight Independent Set of Rectangles. SODA 2021: 860-868 - [c36]Parinya Chalermsook, Syamantak Das, Yunbum Kook, Bundit Laekhanukit, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. SODA 2021: 1206-1225 - [c35]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. WADS 2021: 85-100 - [i24]Parinya Chalermsook, Matthias Kaul, Matthias Mnich, Joachim Spoerhase, Sumedha Uniyal, Daniel Vaz:
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter. CoRR abs/2111.06299 (2021) - 2020
- [j6]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More. SIAM J. Comput. 49(4): 772-810 (2020) - [c34]Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak:
Pinning down the Strong Wilber 1 Bound for Binary Search Trees. APPROX-RANDOM 2020: 33:1-33:21 - [c33]Parinya Chalermsook, Wanchote Po Jiamjitrak:
New Binary Search Tree Bounds via Geometric Inversions. ESA 2020: 28:1-28:16 - [c32]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. SODA 2020: 1955-1974 - [c31]Parinya Chalermsook, Wanchote Po Jiamjitrak, Ly Orgo:
On Finding Balanced Bicliques via Matchings. WG 2020: 238-247 - [i23]Parinya Chalermsook, Samir Khuller, Pattara Sukprasert, Sumedha Uniyal:
Multi-transversals for Triangles and the Tuza's Conjecture. CoRR abs/2001.00257 (2020) - [i22]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Yunbum Kook, Yang P. Liu, Richard Peng, Mark Sellke, Daniel Vaz:
Vertex Sparsification for Edge Connectivity. CoRR abs/2007.07862 (2020) - [i21]Parinya Chalermsook, Bartosz Walczak:
Coloring and Maximum Weight Independent Set of Rectangles. CoRR abs/2007.07880 (2020) - [i20]Antonios Antoniadis, Margarita Capretto, Parinya Chalermsook, Christoph Damerius, Peter Kling, Lukas Nölke, Nidia Obscura Acosta, Joachim Spoerhase:
On Minimum Generalized Manhattan Connections. CoRR abs/2010.14338 (2020)
2010 – 2019
- 2019
- [j5]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-Time Approximation. Algorithmica 81(10): 3993-4009 (2019) - [c30]Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal:
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. STACS 2019: 19:1-19:14 - [i19]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Mimicking Networks Parameterized by Connectivity. CoRR abs/1910.10665 (2019) - [i18]Parinya Chalermsook, Julia Chuzhoy, Thatchaphol Saranurak:
Pinning Down the Strong Wilber 1 Bound for Binary Search Trees. CoRR abs/1912.02900 (2019) - 2018
- [j4]Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese:
Submodular unsplittable flow on trees. Math. Program. 172(1-2): 565-589 (2018) - [c29]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. APPROX-RANDOM 2018: 8:1-8:19 - [c28]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-Finger Binary Search Trees. ISAAC 2018: 55:1-55:26 - [i17]Parinya Chalermsook, Syamantak Das, Guy Even, Bundit Laekhanukit, Daniel Vaz:
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs. CoRR abs/1802.10403 (2018) - [i16]Parinya Chalermsook, Andreas Schmid, Sumedha Uniyal:
A Tight Extremal Bound on the Lovász Cactus Number in Planar Graphs. CoRR abs/1804.03485 (2018) - [i15]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Multi-finger binary search trees. CoRR abs/1809.01759 (2018) - 2017
- [c27]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. FOCS 2017: 743-754 - [c26]Parinya Chalermsook, Syamantak Das, Bundit Laekhanukit, Daniel Vaz:
Beyond Metric Embedding: Approximating Group Steiner Trees on Bounded Treewidth Graphs. SODA 2017: 737-751 - [c25]Parinya Chalermsook, Andreas Schmid:
Finding Triangles for Maximum Planar Subgraphs. WALCOM 2017: 373-384 - [i14]Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof:
New Tools and Connections for Exponential-time Approximation. CoRR abs/1708.03515 (2017) - [i13]Parinya Chalermsook, Marek Cygan, Guy Kortsarz, Bundit Laekhanukit, Pasin Manurangsi, Danupon Nanongkai, Luca Trevisan:
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More. CoRR abs/1708.04218 (2017) - 2016
- [j3]Parinya Chalermsook, Daniel Vaz:
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set. Electron. Notes Discret. Math. 55: 113-116 (2016) - [c24]Anna Adamaszek, Parinya Chalermsook, Alina Ene, Andreas Wiese:
Submodular Unsplittable Flow on Trees. IPCO 2016: 337-349 - [c23]Parinya Chalermsook, Daniel Vaz:
New Integrality Gap Results for the Firefighters Problem on Trees. WAOA 2016: 65-77 - [i12]Parinya Chalermsook, Daniel Vaz:
New Integrality Gap Results for the Firefighters Problem on Trees. CoRR abs/1601.02388 (2016) - [i11]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
The landscape of bounds for binary search trees. CoRR abs/1603.04892 (2016) - 2015
- [j2]Parinya Chalermsook, Hiroshi Imai, Vorapong Suppakitpaisarn:
Two Lower Bounds for Shortest Double-Base Number System. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98-A(6): 1310-1312 (2015) - [c22]Fidaa Abed, Parinya Chalermsook, José Correa, Andreas Karrenbauer, Pablo Pérez-Lantero, José A. Soto, Andreas Wiese:
On Guillotine Cutting Sequences. APPROX-RANDOM 2015: 1-19 - [c21]Anna Adamaszek, Parinya Chalermsook, Andreas Wiese:
How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking. APPROX-RANDOM 2015: 43-60 - [c20]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Self-Adjusting Binary Search Trees: What Makes Them Tick? ESA 2015: 300-312 - [c19]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-Avoiding Access in Binary Search Trees. FOCS 2015: 410-423 - [c18]Parinya Chalermsook, Atish Das Sarma, Ashwin Lall, Danupon Nanongkai:
Social Network Monetization via Sponsored Viral Marketing. SIGMETRICS 2015: 259-270 - [c17]Parinya Chalermsook, Fabrizio Grandoni, Bundit Laekhanukit:
On Survivable Set Connectivity. SODA 2015: 25-36 - [c16]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. WADS 2015: 152-165 - [i10]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
A Global Geometric View of Splaying. CoRR abs/1503.03105 (2015) - [i9]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Greedy Is an Almost Optimal Deque. CoRR abs/1506.08319 (2015) - [i8]Parinya Chalermsook, Mayank Goswami, László Kozma, Kurt Mehlhorn, Thatchaphol Saranurak:
Pattern-avoiding access in binary search trees. CoRR abs/1507.06953 (2015) - 2014
- [c15]Parinya Chalermsook, Sandy Heydrich, Eugenia Holm, Andreas Karrenbauer:
Nearly Tight Approximability Results for Minimum Biclique Cover and Partition. ESA 2014: 235-246 - [c14]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Pre-reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. FOCS 2014: 444-453 - [c13]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation. LATIN 2014: 409-420 - [c12]Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann:
New Approximability Results for the Robust k-Median Problem. SWAT 2014: 50-61 - [i7]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Pre-Reduction Graph Products: Hardnesses of Properly Learning DFAs and Approximating EDP on DAGs. CoRR abs/1408.0828 (2014) - 2013
- [j1]Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs. Chic. J. Theor. Comput. Sci. 2013 (2013) - [c11]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. FOCS 2013: 370-379 - [c10]Parinya Chalermsook, Suresh Venkatasubramanian:
Clustering With Center Constraints. FSTTCS 2013: 401-412 - [c9]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. SODA 2013: 1557-1576 - [i6]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses. CoRR abs/1308.2617 (2013) - [i5]Sayan Bhattacharya, Parinya Chalermsook, Kurt Mehlhorn, Adrian Neumann:
New Approximability Results for the Robust k-Median Problem. CoRR abs/1309.4602 (2013) - 2012
- [c8]Parinya Chalermsook, Julia Chuzhoy, Sampath Kannan, Sanjeev Khanna:
Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply. APPROX-RANDOM 2012: 73-84 - [c7]Parinya Chalermsook, Julia Chuzhoy, Alina Ene, Shi Li:
Approximation algorithms and hardness of integral concurrent flow. STOC 2012: 689-708 - [i4]Parinya Chalermsook, Khaled M. Elbassioni, Danupon Nanongkai, He Sun:
Multi-Attribute Profit-Maximizing Pricing (Extended Abstract). CoRR abs/1202.2840 (2012) - [i3]Parinya Chalermsook, Shiva Kintali, Richard J. Lipton, Danupon Nanongkai:
Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-partite graphs. CoRR abs/1203.1940 (2012) - [i2]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Graph Products Revisited: Tight Approximation Hardness of Induced Matching, Poset Dimension and More. CoRR abs/1212.4129 (2012) - 2011
- [c6]Parinya Chalermsook:
Coloring and Maximum Independent Set of Rectangles. APPROX-RANDOM 2011: 123-134 - 2010
- [c5]Parinya Chalermsook, Julia Chuzhoy:
Resource Minimization for Fire Containment. SODA 2010: 1334-1349 - [c4]Patrick Briest, Parinya Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, Danupon Nanongkai:
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing. WINE 2010: 444-454
2000 – 2009
- 2009
- [c3]Parinya Chalermsook, Julia Chuzhoy:
Maximum independent set of rectangles. SODA 2009: 892-901 - [i1]Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai:
Stackelberg Pricing is Hard to Approximate within 2-ε. CoRR abs/0910.0443 (2009) - 2005
- [c2]Parinya Chalermsook, Jittat Fakcharoenphol:
Simple Distributed Algorithms for Approximating Minimum Steiner Trees. COCOON 2005: 380-389 - 2004
- [c1]Parinya Chalermsook, Jittat Fakcharoenphol, Danupon Nanongkai:
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs. SODA 2004: 828-829
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-28 20:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
