Novel Algorithmic Techniques through the Lens of Combinatorics

Informazioni relative al progetto

ALGOCom

ID dell’accordo di sovvenzione: 759557

DOI

10.3030/759557

Progetto chiuso

Data della firma CE 1 Settembre 2017

Data di avvio 1 Febbraio 2018

Data di completamento 31 Gennaio 2024

Finanziato da

• EXCELLENT SCIENCE - European Research Council (ERC)

Costo totale

€ 1 411 258,00

Contributo UE

€ 1 411 258,00

Coordinato da

AALTO KORKEAKOULUSAATIO SR
Finland

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Conference proceedings (29)

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

Autori: Chalermsook, Parinya; Huang, Chien-Chung; Nanongkai, Danupon; Saranurak, Thatchaphol; Sukprasert, Pattara; Yingchareonthawornchai, Sorrachai
Pubblicato in: ICALP, 2022
Editore: Lipics

On Minimum Generalized Manhattan Connections

Autori: Antonios Antoniadis; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nölke; Nidia Obscura Acosta; Joachim Spoerhase
Pubblicato in: WADS, Numero 14, 2021
Editore: DROPS
DOI: 10.48550/arxiv.2010.14338

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

Autori: Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb
Pubblicato in: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, 2020, Pagina/e 185-186, ISBN 9781450371278
Editore: ACM
DOI: 10.1145/3377929.3390073

New binary search tree bounds via geometric inversions

Autori: Chalermsook, Parinya; Jiamjitrak, Wanchote Po
Pubblicato in: ESA, 2020
Editore: Lipics
DOI: 10.4230/lipics.esa.2020.28

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition

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

Multi-transversal for Triangles and the Tuza conjecture

Autori: P. Chalermsook, S. Khuller, P. Sukprasert, S. Uniyal
Pubblicato in: SODA, 2020
Editore: ACM

Parameterized Approximation Schemes for Clustering with General Norm Objectives

Autori: Abbasi, Fateme; Banerjee, Sandip; Byrka, Jarosław; Chalermsook, Parinya; Gadekar, Ameet; Khodamoradi, Kamyar; Marx, Dániel; Sharma, Roohani; Spoerhase, Joachim
Pubblicato in: FOCS, 2023
Editore: IEEE
DOI: 10.1109/focs57990.2023.00085

The Group Access Bounds for Binary Search Trees

Autori: Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Pareek, Akash; Yingchareonthawornchai, Sorrachai
Pubblicato in: ICALP, 2024
Editore: Lipics
DOI: 10.48550/arxiv.2312.15426

Polynomial-time Approximation of Independent Set Parameterized by Treewidth

Autori: Chalermsook, Parinya; Fomin, Fedor; Hamm, Thekla; Korhonen, Tuukka; Nederlof, Jesper; Orgo, Ly
Pubblicato in: ESA, 2023
Editore: Lipics
DOI: 10.48550/arxiv.2307.01341

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

Autori: Chalermsook, Parinya; Gadekar, Ameet; Khodamoradi, Kamyar; Spoerhase, Joachim
Pubblicato in: Approximation and Online Algorithms ISBN: 9783031498145, 2023
Editore: Springer
DOI: 10.1007/978-3-031-49815-2_15

On the Complexity of Symmetric Polynomials

Autori: Bläser, Markus; Jindal, Gorav
Pubblicato in: ITCS, Numero 2, 2019
Editore: DROPs
DOI: 10.4230/LIPIcs.ITCS.2019.47

How many zeros of a random sparse polynomial are real

Autori: Jindal, Gorav; Pandey, Anurag; Shukla, Himanshu; Zisopoulos, Charilaos
Pubblicato in: ISSAC, Numero 4, 2020
Editore: ACM
DOI: 10.1145/3373207.3404031

Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

Autori: Franck, Max; Yingchareonthawornchai, Sorrachai
Pubblicato in: SEA, 2021
Editore: LiPics
DOI: 10.48550/arxiv.2103.15703

Vertex connectivity in poly-logarithmic max-flows

Autori: Jason Li; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai
Pubblicato in: STOC, 2021
Editore: ACM
DOI: 10.1145/3406325.3451088

Vertex Sparsification for Edge Connectivity

Autori: Chalermsook, Parinya; Das, Syamantak; Laekhanukit, Bundit; Kook, Yunbum; Liu, Yang P.; Peng, Richard; Sellke, Mark; Vaz, Daniel
Pubblicato in: SODA, 2021
Editore: SIAM

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials

Autori: Vishwas Bhargava, Markus Blaser, Gorav Jindal, Anurag Pandey
Pubblicato in: SODA, 2019
Editore: ACM

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Autori: Chalermsook, Parinya; Das, Syamantak; Even, Guy; Laekhanukit, Bundit; Vaz, Daniel
Pubblicato in: APPROX, 2018
Editore: LIPICS
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.8

Multi-Finger Binary Search Trees

Autori: Chalermsook, P.; Goswami, M.; Kozma, L.; Mehlhorn, K.; Saranurak, T.
Pubblicato in: ISAAC, 2018
Editore: LIPIcs
DOI: 10.4230/LIPIcs.ISAAC.2018.55

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

Autori: Chalermsook, Parinya; Schmid, Andreas; Uniyal, Sumedha
Pubblicato in: STACS, Numero 5, 2019
Editore: LIPIcs
DOI: 10.4230/LIPIcs.STACS.2019.19

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

Autori: Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
Pubblicato in: ICALP, 2019
Editore: LIPIcs

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

Autori: Timothy Chan, Thomas van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
Pubblicato in: ISAAC, 2018
Editore: LIPIcs

Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme

Autori: Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Pubblicato in: STOC, 2019
Editore: Association for Computing Machinery (ACM)

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

Autori: S. Thejaswi, A. Gadekar, B. Ordozgoiti, M. Osadnik
Pubblicato in: KDD, 2022
Editore: ACM

Deterministic Small Vertex Connectivity in Almost Linear Time

Autori: Saranurak, Thatchaphol; Yingchareonthawornchai, Sorrachai
Pubblicato in: FOCS, 2022
Editore: IEEE
DOI: 10.1109/focs54457.2022.00080

Coloring and Maximum Weight Independent Set of Rectangles

Autori: Chalermsook, Parinya; Walczak, Bartosz
Pubblicato in: SODA, 2021
Editore: SIAM

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

Autori: Abbasi, Fateme; Banerjee, Sandip; Byrka, Jarosław; Chalermsook, Parinya; Gadekar, Ameet; Khodamoradi, Kamyar; Marx, Dániel; Sharma, Roohani; Spoerhase, Joachim
Pubblicato in: ICALP, 2024
Editore: Lipics
DOI: 10.48550/arxiv.2305.07316

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

Autori: Chalermsook, Parinya; Pettie, Seth; Yingchareonthawornchai, Sorrachai
Pubblicato in: SODA, 2024
Editore: ACM
DOI: 10.1137/1.9781611977912.7

On Finding Balanced Bicliques via Matchings

Autori: Chalermsook, Parinya; Jiamjitrak, Wanchote Po; Orgo, Ly
Pubblicato in: WG, 2020
Editore: Springer

On the parameterized complexity of Compact Set Packing

Autori: Ameet Gadekar
Pubblicato in: WALCOM, 2023
Editore: Springer

Peer reviewed articles (4)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter

Autori: Parinya Chalermsook; Matthias Kaul; Matthias Mnich; Joachim Spoerhase; Sumedha Uniyal; Daniel Vaz
Pubblicato in: Transaction on Algorithms, 2024, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3632623

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

Autori: Chalermsook, Parinya; Chuzhoy, Julia; Saranurak, Thatchaphol
Pubblicato in: Theory of Computing, 2023, ISSN 1557-2862
Editore: University of Chicago
DOI: 10.48550/arxiv.1912.02900

New Tools and Connections for Exponential-Time Approximation

Autori: Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
Pubblicato in: Algorithmica, Numero 81/10, 2019, Pagina/e 3993-4009, ISSN 0178-4617
Editore: Springer Verlag
DOI: 10.1007/s00453-018-0512-8

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

Autori: P. Chalermsook, M. Cygan, G. Kortsarz, B. Laekhanukit, P. Manurangsi, D. Nanongkai, L. Trevisan.
Pubblicato in: SIAM Journal on Computing, 2020, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics

Book chapters (3)

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

Autori: Stephan Beyer, Markus Chimani, Joachim Spoerhase
Pubblicato in: Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings, Numero 12273, 2020, Pagina/e 347-359, ISBN 978-3-030-58149-7
Editore: Springer International Publishing
DOI: 10.1007/978-3-030-58150-3_28

Improved Learning of k-Parities

Autori: Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal
Pubblicato in: Computing and Combinatorics, Numero 10976, 2018, Pagina/e 542-553, ISBN 978-3-319-94775-4
Editore: 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

Autori: Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Pubblicato in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Pagina/e 2046-2065, ISBN 978-1-61197-599-4
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.126