Lossy Preprocessing

Project Information

LOPRE

Grant agreement ID: 819416

DOI

10.3030/819416

EC signature date 17 December 2018

Start date 1 May 2019

End date 31 January 2026

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost

€ 2 000 000,00

EU contribution

€ 2 000 000,00

Coordinated by

UNIVERSITETET I BERGEN
Norway

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

Book chapters (7)

2-Approximating Feedback Vertex Set in Tournaments

Author(s): Daniel Lokshtanov, Pranabendu Misra, Joydeep Mukherjee, Fahad Panolan, Geevarghese Philip, Saket Saurabh
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 1010-1018, ISBN 978-1-61197-599-4
Publisher: 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)

Author(s): Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 179-198, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.13

Parameterized Complexity and Approximability of Directed Odd Cycle Transversal

Author(s): Daniel Lokshtanov, M. S. Ramanujan, Saket Saurab, Meirav Zehavi
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 2181-2200, ISBN 978-1-61197-599-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.134

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

Author(s): Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2020, Page(s) 2299-2318, ISBN 978-1-61197-599-4
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975994.141

Strong Connectivity Augmentation is FPT

Author(s): Kristine Vitting Klinkby, Pranabendu Misra, Saket Saurabh
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 219-234, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.15

FPT-approximation for FPT Problems

Author(s): Daniel Lokshtanov, Pranabendu Misra, M. S. Ramanujan, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 199-218, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.14

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

Author(s): Neeraj Kumar, Daniel Lokshtanov, Saket Saurabh, Subhash Suri
Published in: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), 2021, Page(s) 822-839, ISBN 978-1-61197-646-5
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611976465.52

Conference proceedings (6)

A Parameterized Approximation Scheme for Min k-Cut

Author(s): Daniel Lokshtanov, Saket Saurabh, Vaishali Surianarayanan
Published in: 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS,, 2020, Page(s) 798--809
Publisher: IEEE
DOI: 10.1109/focs46700.2020.00079

Diverse Collections in Matroids and Graphs

Author(s): Fomin, Fedor V.; Golovach, Petr A.; Panolan, Fahad; Philip, Geevarghese; Saurabh, Saket
Published in: Issue 10, 2021
Publisher: LIPICS
DOI: 10.4230/lipics.stacs.2021.31

The Parameterized Complexity of Guarding Almost Convex Polygons

Author(s): Agrawal, Akanksha; Knudsen, Kristine V. K.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav
Published in: Leibniz International Proceedings in Informatics, Issue 20, 2020
Publisher: Lipics
DOI: 10.4230/lipics.socg.2020.3

Hitting topological minors is FPT

Author(s): Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 1317-1326, ISBN 9781450369794
Publisher: ACM
DOI: 10.1145/3357713.3384318

Well-Structured Committees

Author(s): Sushmita Gupta, Pallavi Jain, Saket Saurabh
Published in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Page(s) 189-195, ISBN 978-0-9992411-6-5
Publisher: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/27

An exponential time parameterized algorithm for planar disjoint paths

Author(s): Daniel Lokshtanov, Pranabendu Misra, Michał Pilipczuk, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020, Page(s) 1307-1316, ISBN 9781450369794
Publisher: ACM
DOI: 10.1145/3357713.3384250

Peer reviewed articles (1)

Randomized Contractions Meet Lean Decompositions

Author(s): Marek Cygan, Paweł Komosa, Daniel Lokshtanov, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh, Magnus Wahlström
Published in: ACM Transactions on Algorithms, Issue 17/1, 2021, Page(s) 1-30, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3426738