Pareto-Optimal Parameterized Algorithms

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

Autores: Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Publicado en: 2018, Página(s) 2785-2800
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.177

Reducing CMSO Model Checking to Highly Connected Graphs

Autores: Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav
Publicado en: Edición 3, 2018
Editor: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2018.135

The Parameterized Complexity of Finding Point Sets with Hereditary Properties.

Autores: David Eppstein Daniel Lokshtanov
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

How to Navigate Through Obstacles?

Autores: Eduard Eiben, Iyad A. Kanj
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Improved Results for Minimum Constraint Removal

Autores: Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl
Publicado en: 2018
Editor: AAAI Press

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

Autores: Timothy Carpenter, Fedor Fomin, Daniel Lokshtanov, Saket Saurabh and Anastasios Sidiropoulos
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Autores: Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov and Saket Saurabh
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Balanced Judicious Bipartition is FPT.

Autores: Daniel Lokshtanov, Saket Saurabh, Roohani Sharma and Meirav Zehavi
Publicado en: 2017
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

On the Parameterized Complexity of Simultaneous Deletion Problems.

Autores: Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad and M. S. Ramanujan
Publicado en: 2017
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

A Structural Approach to Activity Selection.

Autores: Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Publicado en: 2018
Editor: ijcai.org

Unary Integer Linear Programming with Structural Restrictions

Autores: Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Publicado en: 2018
Editor: icjai.org

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

Autores: Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi
Publicado en: 2018
Editor: SIAM

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

Autores: Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Meirav Zehavi
Publicado en: 2017
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autores: Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé and Meirav Zehavi
Publicado en: 2018
Editor: SIAM

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

Autores: Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh and Meirav Zehavi
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

The complexity of independent set reconfiguration on bipartite graphs.

Autores: Daniel Lokshtanov and Amer E. Mouawad
Publicado en: 2018
Editor: SIAM

Small Resolution Proofs for QBF using Dependency Treewidth

Autores: Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autores: Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi and Pavel Pudlak
Publicado en: 2018
Editor: SIAM

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

Autores: Daniel Lokshtanov, M. S. Ramanujan and Saket Saurabh
Publicado en: 2018
Editor: SIAM

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

Autores: Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh and Meirav Zehavi
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autores: Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov and Saket Saurabh
Publicado en: 2017
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autores: Daniel Lokshtanov, M.S. Ramanujan and Saket Saurabh
Publicado en: 2017
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Packing Cycles Faster Than Erdos-Pósa.

Autores: Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh and Meirav Zehavi
Publicado en: 2017
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

Autores: Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Publicado en: 2018
Editor: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autores: Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Publicado en: Algorithmica, 2019, ISSN 0178-4617
Editor: Springer Verlag

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Autores: Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Publicado en: ACM Transactions on Algorithms, Edición 15/1, 2019, Página(s) 1-28, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3284356

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

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

Slightly Superexponential Parameterized Problems

Autores: Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Publicado en: SIAM Journal on Computing, Edición 47/3, 2018, Página(s) 675-702, ISSN 0097-5397
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1104834

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

Autores: Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Publicado en: ACM Transactions on Algorithms, Edición 14/2, 2018, Página(s) 1-30, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3170442

The Complexity of Independent Set Reconfiguration on Bipartite Graphs

Autores: Daniel Lokshtanov, Amer E. Mouawad
Publicado en: ACM Transactions on Algorithms, Edición 15/1, 2019, Página(s) 1-19, ISSN 1549-6325
Editor: Association for Computing Machinary, Inc.
DOI: 10.1145/3280825

Popular Matching in Roommates Setting is NP-hard

Autores: Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Publicado en: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Página(s) 2810-2822, ISBN 978-1-61197-548-2
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.174

Interval Vertex Deletion Admits a Polynomial Kernel

Autores: Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Publicado en: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Página(s) 1711-1730, ISBN 978-1-61197-548-2
Editor: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.103

Publicaciones

Compartir esta página

Descargar