Novel Algorithmic Techniques through the Lens of Combinatorics

Información del proyecto

ALGOCom

Identificador del acuerdo de subvención: 759557

DOI

10.3030/759557

Proyecto cerrado

Fecha de la firma de la CE 1 Septiembre 2017

Fecha de inicio 1 Febrero 2018

Fecha de finalización 31 Enero 2024

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 1 411 258,00

Aportación de la UE

€ 1 411 258,00

Coordinado por

AALTO KORKEAKOULUSAATIO SR
Finland

CORDIS proporciona enlaces a los documentos públicos y las publicaciones de los proyectos de los programas marco HORIZONTE.

Los enlaces a los documentos y las publicaciones de los proyectos del Séptimo Programa Marco, así como los enlaces a algunos tipos de resultados específicos, como conjuntos de datos y «software», se obtienen dinámicamente de OpenAIRE .

Publicaciones

Conference proceedings (29)

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

Autores: Chalermsook, Parinya; Huang, Chien-Chung; Nanongkai, Danupon; Saranurak, Thatchaphol; Sukprasert, Pattara; Yingchareonthawornchai, Sorrachai
Publicado en: ICALP, 2022
Editor: Lipics

On Minimum Generalized Manhattan Connections

Autores: Antonios Antoniadis; Margarita Capretto; Parinya Chalermsook; Christoph Damerius; Peter Kling; Lukas Nölke; Nidia Obscura Acosta; Joachim Spoerhase
Publicado en: WADS, Edición 14, 2021
Editor: DROPS
DOI: 10.48550/arxiv.2010.14338

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

Autores: Sorrachai Yingchareonthawornchai, Proteek Chandan Roy, Bundit Laekhanukit, Eric Torng, Kalyanmoy Deb
Publicado en: Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion, 2020, Página(s) 185-186, ISBN 9781450371278
Editor: ACM
DOI: 10.1145/3377929.3390073

New binary search tree bounds via geometric inversions

Autores: Chalermsook, Parinya; Jiamjitrak, Wanchote Po
Publicado en: ESA, 2020
Editor: Lipics
DOI: 10.4230/lipics.esa.2020.28

Improved Pattern-Avoidance Bounds for Greedy BSTs via Matrix Decomposition

Autores: Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Acosta, Nidia Obscura; Pareek, Akash; Yingchareonthawornchai, Sorrachai
Publicado en: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) ISBN: 9781611977554, Edición 6, 2023
Editor: ACM
DOI: 10.1137/1.9781611977554.ch22

Multi-transversal for Triangles and the Tuza conjecture

Autores: P. Chalermsook, S. Khuller, P. Sukprasert, S. Uniyal
Publicado en: SODA, 2020
Editor: ACM

Parameterized Approximation Schemes for Clustering with General Norm Objectives

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

The Group Access Bounds for Binary Search Trees

Autores: Chalermsook, Parinya; Gupta, Manoj; Jiamjitrak, Wanchote; Pareek, Akash; Yingchareonthawornchai, Sorrachai
Publicado en: ICALP, 2024
Editor: Lipics
DOI: 10.48550/arxiv.2312.15426

Polynomial-time Approximation of Independent Set Parameterized by Treewidth

Autores: Chalermsook, Parinya; Fomin, Fedor; Hamm, Thekla; Korhonen, Tuukka; Nederlof, Jesper; Orgo, Ly
Publicado en: ESA, 2023
Editor: Lipics
DOI: 10.48550/arxiv.2307.01341

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

Autores: Chalermsook, Parinya; Gadekar, Ameet; Khodamoradi, Kamyar; Spoerhase, Joachim
Publicado en: Approximation and Online Algorithms ISBN: 9783031498145, 2023
Editor: Springer
DOI: 10.1007/978-3-031-49815-2_15

On the Complexity of Symmetric Polynomials

Autores: Bläser, Markus; Jindal, Gorav
Publicado en: ITCS, Edición 2, 2019
Editor: DROPs
DOI: 10.4230/LIPIcs.ITCS.2019.47

How many zeros of a random sparse polynomial are real

Autores: Jindal, Gorav; Pandey, Anurag; Shukla, Himanshu; Zisopoulos, Charilaos
Publicado en: ISSAC, Edición 4, 2020
Editor: ACM
DOI: 10.1145/3373207.3404031

Engineering Nearly Linear-Time Algorithms for Small Vertex Connectivity

Autores: Franck, Max; Yingchareonthawornchai, Sorrachai
Publicado en: SEA, 2021
Editor: LiPics
DOI: 10.48550/arxiv.2103.15703

Vertex connectivity in poly-logarithmic max-flows

Autores: Jason Li; Danupon Nanongkai; Debmalya Panigrahi; Thatchaphol Saranurak; Sorrachai Yingchareonthawornchai
Publicado en: STOC, 2021
Editor: ACM
DOI: 10.1145/3406325.3451088

Vertex Sparsification for Edge Connectivity

Autores: Chalermsook, Parinya; Das, Syamantak; Laekhanukit, Bundit; Kook, Yunbum; Liu, Yang P.; Peng, Richard; Sellke, Mark; Vaz, Daniel
Publicado en: SODA, 2021
Editor: SIAM

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials

Autores: Vishwas Bhargava, Markus Blaser, Gorav Jindal, Anurag Pandey
Publicado en: SODA, 2019
Editor: ACM

Survivable Network Design for Group Connectivity in Low-Treewidth Graphs

Autores: Chalermsook, Parinya; Das, Syamantak; Even, Guy; Laekhanukit, Bundit; Vaz, Daniel
Publicado en: APPROX, 2018
Editor: LIPICS
DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.8

Multi-Finger Binary Search Trees

Autores: Chalermsook, P.; Goswami, M.; Kozma, L.; Mehlhorn, K.; Saranurak, T.
Publicado en: ISAAC, 2018
Editor: LIPIcs
DOI: 10.4230/LIPIcs.ISAAC.2018.55

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

Autores: Chalermsook, Parinya; Schmid, Andreas; Uniyal, Sumedha
Publicado en: STACS, Edición 5, 2019
Editor: LIPIcs
DOI: 10.4230/LIPIcs.STACS.2019.19

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

Autores: Eyal Mizrachi, Roy Schwartz, Joachim Spoerhase, Sumedha Uniyal
Publicado en: ICALP, 2019
Editor: LIPIcs

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

Autores: Timothy Chan, Thomas van Dijk, Krzysztof Fleszar, Joachim Spoerhase, Alexander Wolff
Publicado en: ISAAC, 2018
Editor: LIPIcs

Breaking Quadratic Time for Small Vertex Connectivity and an Approximation Scheme

Autores: Danupon Nanongkai, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Publicado en: STOC, 2019
Editor: Association for Computing Machinery (ACM)

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

Autores: S. Thejaswi, A. Gadekar, B. Ordozgoiti, M. Osadnik
Publicado en: KDD, 2022
Editor: ACM

Deterministic Small Vertex Connectivity in Almost Linear Time

Autores: Saranurak, Thatchaphol; Yingchareonthawornchai, Sorrachai
Publicado en: FOCS, 2022
Editor: IEEE
DOI: 10.1109/focs54457.2022.00080

Coloring and Maximum Weight Independent Set of Rectangles

Autores: Chalermsook, Parinya; Walczak, Bartosz
Publicado en: SODA, 2021
Editor: SIAM

Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces

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

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

Autores: Chalermsook, Parinya; Pettie, Seth; Yingchareonthawornchai, Sorrachai
Publicado en: SODA, 2024
Editor: ACM
DOI: 10.1137/1.9781611977912.7

On Finding Balanced Bicliques via Matchings

Autores: Chalermsook, Parinya; Jiamjitrak, Wanchote Po; Orgo, Ly
Publicado en: WG, 2020
Editor: Springer

On the parameterized complexity of Compact Set Packing

Autores: Ameet Gadekar
Publicado en: WALCOM, 2023
Editor: Springer

Peer reviewed articles (4)

Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter

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

Pinning Down the Strong Wilber 1 Bound for Binary Search Trees

Autores: Chalermsook, Parinya; Chuzhoy, Julia; Saranurak, Thatchaphol
Publicado en: Theory of Computing, 2023, ISSN 1557-2862
Editor: University of Chicago
DOI: 10.48550/arxiv.1912.02900

New Tools and Connections for Exponential-Time Approximation

Autores: Nikhil Bansal, Parinya Chalermsook, Bundit Laekhanukit, Danupon Nanongkai, Jesper Nederlof
Publicado en: Algorithmica, Edición 81/10, 2019, Página(s) 3993-4009, ISSN 0178-4617
Editor: Springer Verlag
DOI: 10.1007/s00453-018-0512-8

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

Autores: P. Chalermsook, M. Cygan, G. Kortsarz, B. Laekhanukit, P. Manurangsi, D. Nanongkai, L. Trevisan.
Publicado en: SIAM Journal on Computing, 2020, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics

Book chapters (3)

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

Autores: Stephan Beyer, Markus Chimani, Joachim Spoerhase
Publicado en: Computing and Combinatorics - 26th International Conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020, Proceedings, Edición 12273, 2020, Página(s) 347-359, ISBN 978-3-030-58149-7
Editor: Springer International Publishing
DOI: 10.1007/978-3-030-58150-3_28

Improved Learning of k-Parities

Autores: Arnab Bhattacharyya, Ameet Gadekar, Ninad Rajgopal
Publicado en: Computing and Combinatorics, Edición 10976, 2018, Página(s) 542-553, ISBN 978-3-319-94775-4
Editor: 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

Autores: Sebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, Sorrachai Yingchareonthawornchai
Publicado en: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Página(s) 2046-2065, ISBN 978-1-61197-599-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.126