Pareto-Optimal Parameterized Algorithms

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

Autori: Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Roohani Sharma, Meirav Zehavi
Pubblicato in: 2018, Pagina/e 2785-2800
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975031.177

Reducing CMSO Model Checking to Highly Connected Graphs

Autori: Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket; Zehavi, Meirav
Pubblicato in: Numero 3, 2018
Editore: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
DOI: 10.4230/LIPIcs.ICALP.2018.135

The Parameterized Complexity of Finding Point Sets with Hereditary Properties.

Autori: David Eppstein Daniel Lokshtanov
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

How to Navigate Through Obstacles?

Autori: Eduard Eiben, Iyad A. Kanj
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Improved Results for Minimum Constraint Removal

Autori: Eduard Eiben, Jonathan Gemmell, Iyad A. Kanj, Andrew Youngdahl
Pubblicato in: 2018
Editore: AAAI Press

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

Autori: Timothy Carpenter, Fedor Fomin, Daniel Lokshtanov, Saket Saurabh and Anastasios Sidiropoulos
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Conflict Free Feedback Vertex Set: A Parameterized Dichotomy

Autori: Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Daniel Lokshtanov and Saket Saurabh
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Balanced Judicious Bipartition is FPT.

Autori: Daniel Lokshtanov, Saket Saurabh, Roohani Sharma and Meirav Zehavi
Pubblicato in: 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

On the Parameterized Complexity of Simultaneous Deletion Problems.

Autori: Akanksha Agrawal, R. Krithika, Daniel Lokshtanov, Amer E. Mouawad and M. S. Ramanujan
Pubblicato in: 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

A Structural Approach to Activity Selection.

Autori: Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Pubblicato in: 2018
Editore: ijcai.org

Unary Integer Linear Programming with Structural Restrictions

Autori: Eduard Eiben, Robert Ganian, Dusan Knop, Sebastian Ordyniak
Pubblicato in: 2018
Editore: icjai.org

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

Autori: Petr A. Golovach, Daniel Lokshtanov, Saket Saurabh and Meirav Zehavi
Pubblicato in: 2018
Editore: SIAM

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

Autori: Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh and Meirav Zehavi
Pubblicato in: 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autori: Tien-Nam Le, Daniel Lokshtanov, Saket Saurabh, Stéphan Thomassé and Meirav Zehavi
Pubblicato in: 2018
Editore: SIAM

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

Autori: Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh and Meirav Zehavi
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

The complexity of independent set reconfiguration on bipartite graphs.

Autori: Daniel Lokshtanov and Amer E. Mouawad
Pubblicato in: 2018
Editore: SIAM

Small Resolution Proofs for QBF using Dependency Treewidth

Autori: Eduard Eiben, Robert Ganian, Sebastian Ordyniak
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autori: Daniel Lokshtanov, Ivan Mikhailin, Ramamohan Paturi and Pavel Pudlak
Pubblicato in: 2018
Editore: SIAM

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

Autori: Daniel Lokshtanov, M. S. Ramanujan and Saket Saurabh
Pubblicato in: 2018
Editore: SIAM

Quasipolynomial Representation of Transversal Matroids with Applications in Parameterized Complexity.

Autori: Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh and Meirav Zehavi
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autori: Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov and Saket Saurabh
Pubblicato in: 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autori: Daniel Lokshtanov, M.S. Ramanujan and Saket Saurabh
Pubblicato in: 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Packing Cycles Faster Than Erdos-Pósa.

Autori: Daniel Lokshtanov, Amer E. Mouawad, Saket Saurabh and Meirav Zehavi
Pubblicato in: 2017
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

Lossy Kernels for Connected Dominating Set on Sparse Graphs.

Autori: Eduard Eiben, Mithilesh Kumar, Amer E. Mouawad, Fahad Panolan, Sebastian Siebertz
Pubblicato in: 2018
Editore: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik

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

Autori: Gábor Bacsó, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Zsolt Tuza, Erik Jan van Leeuwen
Pubblicato in: Algorithmica, 2019, ISSN 0178-4617
Editore: Springer Verlag

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

Autori: Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Pubblicato in: ACM Transactions on Algorithms, Numero 15/1, 2019, Pagina/e 1-28, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3284356

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

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

Slightly Superexponential Parameterized Problems

Autori: Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Pubblicato in: SIAM Journal on Computing, Numero 47/3, 2018, Pagina/e 675-702, ISSN 0097-5397
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/16m1104834

Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal

Autori: Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Pubblicato in: ACM Transactions on Algorithms, Numero 14/2, 2018, Pagina/e 1-30, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3170442

The Complexity of Independent Set Reconfiguration on Bipartite Graphs

Autori: Daniel Lokshtanov, Amer E. Mouawad
Pubblicato in: ACM Transactions on Algorithms, Numero 15/1, 2019, Pagina/e 1-19, ISSN 1549-6325
Editore: Association for Computing Machinary, Inc.
DOI: 10.1145/3280825

Popular Matching in Roommates Setting is NP-hard

Autori: Sushmita Gupta, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Pubblicato in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Pagina/e 2810-2822, ISBN 978-1-61197-548-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.174

Interval Vertex Deletion Admits a Polynomial Kernel

Autori: Akanksha Agrawal, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
Pubblicato in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019, Pagina/e 1711-1730, ISBN 978-1-61197-548-2
Editore: Society for Industrial and Applied Mathematics
DOI: 10.1137/1.9781611975482.103

Pubblicazioni

Condividi questa pagina

Scarica