default search action
IPEC 2016: Aarhus, Denmark
- Jiong Guo, Danny Hermelin:
11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. LIPIcs 63, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-023-1 - Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors. 0:i-0:xiv
- Andreas Björklund:
Determinant Sums for Hamiltonicity (Invited Talk). 1:1-1:1 - Akanksha Agrawal
, Sushmita Gupta, Saket Saurabh, Roohani Sharma:
Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set. 2:1-2:14 - Gábor Bacsó, Dániel Marx, Zsolt Tuza:
H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms. 3:1-3:12 - Max Bannach, Till Tantau:
Parallel Multivariate Meta-Theorems. 4:1-4:17 - René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, Ondrej Suchý
Finding Secluded Places of Special Interest in Graphs. 5:1-5:16 - Thomas Bläsius, Tobias Friedrich, Martin Schirneck
The Parameterized Complexity of Dependency Detection in Relational Databases. 6:1-6:13 - Hans L. Bodlaender
A Faster Parameterized Algorithm for Pseudoforest Deletion. 7:1-7:12 - Glencora Borradaile, Hung Le:
Optimal Dynamic Program for r-Domination Problems over Tree Decompositions. 8:1-8:23 - Cornelius Brand
Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP. 9:1-9:14 - Robert Bredereck
A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs. 10:1-10:14 - L. Sunil Chandran, Davis Issac, Andreas Karrenbauer:
On the Parameterized Complexity of Biclique Cover and Partition. 11:1-11:13 - Khaled M. Elbassioni
Exact Algorithms for List-Coloring of Intersecting Hypergraphs. 12:1-12:15 - Serge Gaspers, Joachim Gudmundsson
Turbocharging Treewidth Heuristics. 13:1-13:13 - Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, Jan Arne Telle:
On Satisfiability Problems with a Linear Structure. 14:1-14:14 - Archontia C. Giannopoulou, Michal Pilipczuk
Cutwidth: Obstructions and Algorithmic Aspects. 15:1-15:13 - Thore Husfeldt:
Computing Graph Distances Parameterized by Treewidth and Diameter. 16:1-16:11 - Bart M. P. Jansen, Jules J. H. M. Wulms:
Lower Bounds for Protrusion Replacement by Counting Equivalence Classes. 17:1-17:12 - Yasuaki Kobayashi
Treedepth Parameterized by Vertex Cover Number. 18:1-18:11 - R. Krithika
Dynamic Parameterized Problems. 19:1-19:14 - Mithilesh Kumar
A 2lk Kernel for l-Component Order Connectivity. 20:1-20:14 - Diptapriyo Majumdar
Structural Parameterizations of Feedback Vertex Set. 21:1-21:16 - Kitty Meeks
Randomised Enumeration of Small Witnesses Using a Decision Oracle. 22:1-22:12 - Arne Meier
Backdoors for Linear Temporal Logic. 23:1-23:17 - Matthias Mnich
Improved Bounds for Minimal Feedback Vertex Sets in Tournaments. 24:1-24:10 - Mateus de Oliveira Oliveira:
Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth. 25:1-25:12 - Marcin Pilipczuk, Michal Pilipczuk, Marcin Wrochna:
Edge Bipartization Faster Than 2^k. 26:1-26:13 - Willem J. A. Pino, Hans L. Bodlaender
Cut and Count and Representative Sets on Branch Decompositions. 27:1-27:12 - Blair D. Sullivan
A Fast Parameterized Algorithm for Co-Path Set. 28:1-28:13 - Michal Wlodarczyk:
Clifford Algebras Meet Tree Decompositions. 29:1-29:18 - Holger Dell
The First Parameterized Algorithms and Computational Experiments Challenge. 30:1-30:9
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-26 01:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: