New Tools and Connections for Exponential-Time Approximation
Bansal, Nikhil, Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon, Nederlof, Jesper
Published in Algorithmica (01.10.2019)
Published in Algorithmica (01.10.2019)
Get full text
Journal Article
From Gap-ETH to FPT-Inapproximability: Clique, Dominating Set, and More
Chalermsook, Parinya, Cygan, Marek, Kortsarz, Guy, Laekhanukit, Bundit, Manurangsi, Pasin, Nanongkai, Danupon, Trevisan, Luca
Published in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2017)
Published in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (01.10.2017)
Get full text
Conference Proceeding
Submodular unsplittable flow on trees
Adamaszek, Anna, Chalermsook, Parinya, Ene, Alina, Wiese, Andreas
Published in Mathematical programming (01.11.2018)
Published in Mathematical programming (01.11.2018)
Get full text
Journal Article
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set
Chalermsook, Parinya, Vaz, Daniel
Published in Electronic notes in discrete mathematics (01.11.2016)
Published in Electronic notes in discrete mathematics (01.11.2016)
Get full text
Journal Article
Parameterized Approximation Schemes for Clustering with General Norm Objectives
Abbasi, Fateme, Banerjee, Sandip, Byrka, Jaroslaw, Chalermsook, Parinya, Gadekar, Ameet, Khodamoradi, Kamyar, Marx, Daniel, Sharma, Roohani, Spoerhase, Joachim
Published in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (06.11.2023)
Published in 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (06.11.2023)
Get full text
Conference Proceeding
On Finding Balanced Bicliques via Matchings
Chalermsook, Parinya, Jiamjitrak, Wanchote Po, Orgo, Ly
Published in Graph-Theoretic Concepts in Computer Science (2020)
Published in Graph-Theoretic Concepts in Computer Science (2020)
Get full text
Book Chapter
Submodular Unsplittable Flow on Trees
Adamaszek, Anna, Chalermsook, Parinya, Ene, Alina, Wiese, Andreas
Published in Integer Programming and Combinatorial Optimization (2016)
Published in Integer Programming and Combinatorial Optimization (2016)
Get full text
Book Chapter
The Group Access Bounds for Binary Search Trees
Chalermsook, Parinya, Gupta, Manoj, Jiamjitrak, Wanchote, Pareek, Akash, Yingchareonthawornchai, Sorrachai
Year of Publication 24.12.2023
Year of Publication 24.12.2023
Get full text
Journal Article
Simple Distributed Algorithms for Approximating Minimum Steiner Trees
Get full text
Book Chapter
Conference Proceeding
Independent set in $k$-Claw-Free Graphs: Conditional $\chi$-boundedness and the Power of LP/SDP Relaxations
Chalermsook, Parinya, Gadekar, Ameet, Khodamoradi, Kamyar, Spoerhase, Joachim
Year of Publication 30.08.2023
Year of Publication 30.08.2023
Get full text
Journal Article
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses
Chalermsook, Parinya, Laekhanukit, Bundit, Nanongkai, Danupon
Published in 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (01.10.2013)
Published in 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (01.10.2013)
Get full text
Conference Proceeding