Novel Algorithmic Techniques through the Lens of Combinatorics

Project Information

ALGOCom

Grant agreement ID: 759557

DOI

10.3030/759557

Project closed

EC signature date 1 September 2017

Start date 1 February 2018

End date 31 January 2024

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 1 411 258,00

EU contribution

€ 1 411 258,00

Coordinated by

AALTO KORKEAKOULUSAATIO SR
Finland

CORDIS provides links to public deliverables and publications of HORIZON projects.

Links to deliverables and publications from FP7 projects, as well as links to some specific result types such as dataset and software, are dynamically retrieved from OpenAIRE .

Publications

Conference proceedings (29)

Approximating k-Edge-Connected Spanning Subgraphs via a Near-Linear Time LP Solver

Author(s): Chalermsook, Parinya; Huang, Chien-Chung; Nanongkai, Danupon; Saranurak, Thatchaphol; Sukprasert, Pattara; Yingchareonthawornchai, Sorrachai
Published in: ICALP, 2022
Publisher: Lipics

On Minimum Generalized Manhattan Connections

Author(s): Antonios Antoniadis; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nölke; Nidia Obscura Acosta; Joachim Spoerhase
Published in: WADS, Issue 14, 2021
Publisher: DROPS
DOI: 10.48550/arxiv.2010.14338

Worst-case conditional hardness and fast algorithms with random inputs for non-dominated sorting

Author(s): Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb
Published in: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, 2020, Page(s) 185-186, ISBN 9781450371278
Publisher: ACM
DOI: 10.1145/3377929.3390073

New binary search tree bounds via geometric inversions

Author(s): Chalermsook, Parinya; Jiamjitrak, Wanchote Po
Published in: ESA, 2020
Publisher: Lipics
DOI: 10.4230/lipics.esa.2020.28

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition

Author(s): Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Acosta, Nidia Obscura; Pareek, Akash; Yingchareonthawornchai, Sorrachai
Published in: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554, Issue 6, 2023
Publisher: ACM
DOI: 10.1137/1.9781611977554.ch22

Multi-transversal for Triangles and the Tuza conjecture

Author(s): P. Chalermsook, S. Khuller, P. Sukprasert, S. Uniyal
Published in: SODA, 2020
Publisher: ACM

Parameterized Approximation Schemes for Clustering with General Norm Objectives

Author(s): Abbasi, Fateme; Banerjee, Sandip; Byrka, Jarosław; Chalermsook, Parinya; Gadekar, Ameet; Khodamoradi, Kamyar; Marx, Dániel; Sharma, Roohani; Spoerhase, Joachim
Published in: FOCS, 2023
Publisher: IEEE
DOI: 10.1109/focs57990.2023.00085

The Group Access Bounds for Binary Search Trees

Author(s): Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Pareek, Akash; Yingchareonthawornchai, Sorrachai
Published in: ICALP, 2024
Publisher: Lipics
DOI: 10.48550/arxiv.2312.15426

Polynomial-time Approximation of Independent Set Parameterized by Treewidth

Author(s): Chalermsook, Parinya; Fomin, Fedor; Hamm, Thekla; Korhonen, Tuukka; Nederlof, Jesper; Orgo, Ly
Published in: ESA, 2023
Publisher: Lipics
DOI: 10.48550/arxiv.2307.01341

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

Author(s): Chalermsook, Parinya; Gadekar, Ameet; Khodamoradi, Kamyar; Spoerhase, Joachim
Published in: Approximation and Online Algorithms ISBN: 9783031498145, 2023
Publisher: Springer
DOI: 10.1007/978-3-031-49815-2_15

On the Complexity of Symmetric Polynomials

Author(s): Bläser, Markus; Jindal, Gorav
Published in: ITCS, Issue 2, 2019
Publisher: DROPs
DOI: 10.4230/LIPIcs.ITCS.2019.47

How many zeros of a random sparse polynomial are real

Author(s): Jindal, Gorav; Pandey, Anurag; Shukla, Himanshu; Zisopoulos, Charilaos
Published in: ISSAC, Issue 4, 2020
Publisher: ACM
DOI: 10.1145/3373207.3404031

Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

Author(s): Franck, Max; Yingchareonthawornchai, Sorrachai
Published in: SEA, 2021
Publisher: LiPics
DOI: 10.48550/arxiv.2103.15703

Vertex connectivity in poly-logarithmic max-flows

Author(s): Jason Li; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai
Published in: STOC, 2021
Publisher: ACM
DOI: 10.1145/3406325.3451088

Vertex Sparsification for Edge Connectivity

Author(s): Chalermsook, Parinya; Das, Syamantak; Laekhanukit, Bundit; Kook, Yunbum; Liu, Yang P.; Peng, Richard; Sellke, Mark; Vaz, Daniel
Published in: SODA, 2021
Publisher: SIAM

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials

Author(s): Vishwas Bhargava, Markus Blaser, Gorav Jindal, Anurag Pandey
Published in: SODA, 2019
Publisher: ACM

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Author(s): Chalermsook, Parinya; Das, Syamantak; Even, Guy; Laekhanukit, Bundit; Vaz, Daniel
Published in: APPROX, 2018
Publisher: LIPICS
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.8

Multi-Finger Binary Search Trees

Author(s): Chalermsook, P.; Goswami, M.; Kozma, L.; Mehlhorn, K.; Saranurak, T.
Published in: ISAAC, 2018
Publisher: LIPIcs
DOI: 10.4230/LIPIcs.ISAAC.2018.55

A Tight Extremal Bound on the Lov\'{a}sz Cactus Number in Planar Graphs

Author(s): Chalermsook, Parinya; Schmid, Andreas; Uniyal, Sumedha
Published in: STACS, Issue 5, 2019
Publisher: LIPIcs
DOI: 10.4230/LIPIcs.STACS.2019.19

A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints

Author(s): Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
Published in: ICALP, 2019
Publisher: LIPIcs

Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity

Author(s): Timothy Chan, Thomas van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
Published in: ISAAC, 2018
Publisher: LIPIcs

Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme

Author(s): Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Published in: STOC, 2019
Publisher: Association for Computing Machinery (ACM)

Clustering with fair-center representation: Parameterized approximation algorithms and heuristics

Author(s): S. Thejaswi, A. Gadekar, B. Ordozgoiti, M. Osadnik
Published in: KDD, 2022
Publisher: ACM

Deterministic Small Vertex Connectivity in Almost Linear Time

Author(s): Saranurak, Thatchaphol; Yingchareonthawornchai, Sorrachai
Published in: FOCS, 2022
Publisher: IEEE
DOI: 10.1109/focs54457.2022.00080

Coloring and Maximum Weight Independent Set of Rectangles

Author(s): Chalermsook, Parinya; Walczak, Bartosz
Published in: SODA, 2021
Publisher: SIAM

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

Author(s): Abbasi, Fateme; Banerjee, Sandip; Byrka, Jarosław; Chalermsook, Parinya; Gadekar, Ameet; Khodamoradi, Kamyar; Marx, Dániel; Sharma, Roohani; Spoerhase, Joachim
Published in: ICALP, 2024
Publisher: Lipics
DOI: 10.48550/arxiv.2305.07316

Sorting Pattern-Avoiding Permutations via 0-1 Matrices Forbidding Product Patterns

Author(s): Chalermsook, Parinya; Pettie, Seth; Yingchareonthawornchai, Sorrachai
Published in: SODA, 2024
Publisher: ACM
DOI: 10.1137/1.9781611977912.7

On Finding Balanced Bicliques via Matchings

Author(s): Chalermsook, Parinya; Jiamjitrak, Wanchote Po; Orgo, Ly
Published in: WG, 2020
Publisher: Springer

On the parameterized complexity of Compact Set Packing

Author(s): Ameet Gadekar
Published in: WALCOM, 2023
Publisher: Springer

Peer reviewed articles (4)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter

Author(s): Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz
Published in: Transaction on Algorithms, 2024, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3632623

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

Author(s): Chalermsook, Parinya; Chuzhoy, Julia; Saranurak, Thatchaphol
Published in: Theory of Computing, 2023, ISSN 1557-2862
Publisher: University of Chicago
DOI: 10.48550/arxiv.1912.02900

New Tools and Connections for Exponential-Time Approximation

Author(s): Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
Published in: Algorithmica, Issue 81/10, 2019, Page(s) 3993-4009, ISSN 0178-4617
Publisher: Springer Verlag
DOI: 10.1007/s00453-018-0512-8

From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More

Author(s): P. Chalermsook, M. Cygan, G. Kortsarz, B. Laekhanukit, P. Manurangsi, D. Nanongkai, L. Trevisan.
Published in: SIAM Journal on Computing, 2020, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics

Book chapters (3)

A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs

Author(s): Stephan Beyer, Markus Chimani, Joachim Spoerhase
Published in: Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings, Issue 12273, 2020, Page(s) 347-359, ISBN 978-3-030-58149-7
Publisher: Springer International Publishing
DOI: 10.1007/978-3-030-58150-3_28

Improved Learning of k-Parities

Author(s): Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal
Published in: Computing and Combinatorics, Issue 10976, 2018, Page(s) 542-553, ISBN 978-3-319-94775-4
Publisher: Springer International Publishing
DOI: 10.1007/978-3-319-94776-1_45

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms

Author(s): Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 2046-2065, ISBN 978-1-61197-599-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.126