Pareto-Optimal Parameterized Algorithms

Project Information

PaPaAlg

Grant agreement ID: 715744

DOI 10.3030/715744

Project terminated on 31 December 2018

EC signature date 3 November 2016

Start date 1 February 2017

End date 31 January 2022

Funded under

• EXCELLENT SCIENCE - European Research Council (ERC)

Total cost € 1 499 557,00

EU contribution € 1 499 557,00

Coordinated by

UNIVERSITETET I BERGEN
Norway

Publications

Conference proceedings (24)

Covering Small Independent Sets and Separators with Applications to Parameterized Algorithms.

Author(s): Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Published in: 2018, Page(s) 2785-2800
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.177

Reducing CMSO Model Checking to Highly Connected Graphs

Author(s): Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav
Published in: Issue 3, 2018
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2018.135

The Parameterized Complexity of Finding Point Sets with Hereditary Properties.

Author(s): David Eppstein Daniel Lokshtanov
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

How to Navigate Through Obstacles?

Author(s): Eduard Eiben, Iyad A. Kanj
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Improved Results for Minimum Constraint Removal

Author(s): Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl
Published in: 2018
Publisher: AAAI Press

Algorithms for low-distortion embeddings into arbitrary 1-dimensional spaces

Author(s): Timothy Carpenter, Fedor Fomin, Daniel Lokshtanov, Saket Saurabh and Anastasios Sidiropoulos
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Author(s): Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov and Saket Saurabh
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Balanced Judicious Bipartition is FPT.

Author(s): Daniel Lokshtanov, Saket Saurabh, Roohani Sharma and Meirav Zehavi
Published in: 2017
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

On the Parameterized Complexity of Simultaneous Deletion Problems.

Author(s): Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad and M. S. Ramanujan
Published in: 2017
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

A Structural Approach to Activity Selection.

Author(s): Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Published in: 2018
Publisher: ijcai.org

Unary Integer Linear Programming with Structural Restrictions

Author(s): Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Published in: 2018
Publisher: icjai.org

Cliquewidth III: The Odd Case of Graph Coloring Parameterized by Cliquewidth.

Author(s): Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi
Published in: 2018
Publisher: SIAM

Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs.

Author(s): Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Meirav Zehavi
Published in: 2017
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing Problems.

Author(s): Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé and Meirav Zehavi
Published in: 2018
Publisher: SIAM

Erdös-Pósa Property of Obstructions to Interval Graphs.

Author(s): Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh and Meirav Zehavi
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

The complexity of independent set reconfiguration on bipartite graphs.

Author(s): Daniel Lokshtanov and Amer E. Mouawad
Published in: 2018
Publisher: SIAM

Small Resolution Proofs for QBF using Dependency Treewidth

Author(s): Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Beating Brute Force for (Quantified) Satisfiability of Circuits of Bounded Treewidth.

Author(s): Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi and Pavel Pudlak
Published in: 2018
Publisher: SIAM

When Recursion is Better than Iteration: A Linear-Time Algorithm for Acyclicity with Few Error Vertices.

Author(s): Daniel Lokshtanov, M. S. Ramanujan and Saket Saurabh
Published in: 2018
Publisher: SIAM

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

Author(s): Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh and Meirav Zehavi
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Covering vectors by spaces: Regular matroids (short version).

Author(s): Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov and Saket Saurabh
Published in: 2017
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

A Linear-Time Parameterized Algorithm for Node Unique Label Cover.

Author(s): Daniel Lokshtanov, M.S. Ramanujan and Saket Saurabh
Published in: 2017
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Packing Cycles Faster Than Erdos-Pósa.

Author(s): Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh and Meirav Zehavi
Published in: 2017
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

Author(s): Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Published in: 2018
Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Peer reviewed articles (6)

Subexponential-time Algorithms for Maximum Independent Set in Pt-free and Broom-free Graphs

Author(s): Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Published in: Algorithmica, 2019, ISSN 0178-4617
Publisher: Springer Verlag

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Author(s): Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Published in: ACM Transactions on Algorithms, Issue 15/1, 2019, Page(s) 1-28, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3284356

Complexity of the Steiner Network Problem withRespect to the Number of Terminals

Author(s): Eiben Eduard, Knop Dusan, Panolan Fahad, Suchý Ondrej
Published in: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), 2019, ISSN 1868-8969
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/lipics.stacs.2019.25

Slightly Superexponential Parameterized Problems

Author(s): Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Published in: SIAM Journal on Computing, Issue 47/3, 2018, Page(s) 675-702, ISSN 0097-5397
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1104834

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

Author(s): Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Published in: ACM Transactions on Algorithms, Issue 14/2, 2018, Page(s) 1-30, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3170442

The Complexity of Independent Set Reconfiguration on Bipartite Graphs

Author(s): Daniel Lokshtanov, Amer E. Mouawad
Published in: ACM Transactions on Algorithms, Issue 15/1, 2019, Page(s) 1-19, ISSN 1549-6325
Publisher: Association for Computing Machinary, Inc.
DOI: 10.1145/3280825

Book chapters (2)

Popular Matching in Roommates Setting is NP-hard

Author(s): Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 2810-2822, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.174

Interval Vertex Deletion Admits a Polynomial Kernel

Author(s): Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Page(s) 1711-1730, ISBN 978-1-61197-548-2
Publisher: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.103