Lossy Preprocessing

Información del proyecto

LOPRE

Identificador del acuerdo de subvención: 819416

DOI

10.3030/819416

Fecha de la firma de la CE 17 Diciembre 2018

Fecha de inicio 1 Mayo 2019

Fecha de finalización 31 Enero 2026

Financiado con arreglo a

• EXCELLENT SCIENCE - European Research Council (ERC)

Coste total

€ 2 000 000,00

Aportación de la UE

€ 2 000 000,00

Coordinado por

UNIVERSITETET I BERGEN
Norway

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

Book chapters (7)

2-Approximating Feedback Vertex Set in Tournaments

Autores: Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Publicado en: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Página(s) 1010-1018, ISBN 978-1-61197-599-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.61

Efficient Computation of Representative Weight Functions with Applications to Parameterized Counting (Extended Version)

Autores: Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 179-198, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.13

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

Autores: Daniel Lokshtanov, M. S. Ramanujan, Saket Saurab, Meirav Zehavi
Publicado en: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Página(s) 2181-2200, ISBN 978-1-61197-599-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.134

Approximation Schemes via Width/Weight Trade-offs on Minor-free Graphs

Autores: Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Publicado en: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Página(s) 2299-2318, ISBN 978-1-61197-599-4
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.141

Strong Connectivity Augmentation is FPT

Autores: Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 219-234, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.15

FPT-approximation for FPT Problems

Autores: Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 199-218, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.14

A Constant Factor Approximation for Navigating Through Connected Obstacles in the Plane

Autores: Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
Publicado en: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Página(s) 822-839, ISBN 978-1-61197-646-5
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.52

Conference proceedings (6)

A Parameterized Approximation Scheme for Min k-Cut

Autores: Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
Publicado en: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS,, 2020, Página(s) 798--809
Editor: IEEE
DOI: 10.1109/focs46700.2020.00079

Diverse Collections in Matroids and Graphs

Autores: Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
Publicado en: Edición 10, 2021
Editor: LIPICS
DOI: 10.4230/lipics.stacs.2021.31

The Parameterized Complexity of Guarding Almost Convex Polygons

Autores: Agrawal, Akanksha; Knudsen, Kristine V. K.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
Publicado en: Leibniz International Proceedings in Informatics, Edición 20, 2020
Editor: Lipics
DOI: 10.4230/lipics.socg.2020.3

Hitting topological minors is FPT

Autores: Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Publicado en: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Página(s) 1317-1326, ISBN 9781450369794
Editor: ACM
DOI: 10.1145/3357713.3384318

Well-Structured Committees

Autores: Sushmita Gupta, Pallavi Jain, Saket Saurabh
Publicado en: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Página(s) 189-195, ISBN 978-0-9992411-6-5
Editor: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/27

An exponential time parameterized algorithm for planar disjoint paths

Autores: Daniel Lokshtanov, Pranabendu Misra, Michał Pilipczuk, Saket Saurabh, Meirav Zehavi
Publicado en: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Página(s) 1307-1316, ISBN 9781450369794
Editor: ACM
DOI: 10.1145/3357713.3384250

Peer reviewed articles (1)

Randomized Contractions Meet Lean Decompositions

Autores: Marek Cygan, Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh, Magnus Wahlström
Publicado en: ACM Transactions on Algorithms, Edición 17/1, 2021, Página(s) 1-30, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3426738