LIPIcs, Volume 63, IPEC 2016

• Jiong Guo and Danny Hermelin LIPIcs, Volume 63, IPEC'16, Complete Volume 10.4230/LIPIcs.IPEC.2016
• Jiong Guo and Danny Hermelin Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors 10.4230/LIPIcs.IPEC.2016.0
• Andreas Björklund Determinant Sums for Hamiltonicity (Invited Talk) 10.4230/LIPIcs.IPEC.2016.1
• Akanksha Agrawal, Sushmita Gupta, Saket Saurabh, and Roohani Sharma Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set 10.4230/LIPIcs.IPEC.2016.2
• Gábor Bacsó, Dániel Marx, and Zsolt Tuza H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms 10.4230/LIPIcs.IPEC.2016.3
• Max Bannach and Till Tantau Parallel Multivariate Meta-Theorems 10.4230/LIPIcs.IPEC.2016.4
• René van Bevern, Till Fluschnik, George B. Mertzios, Hendrik Molter, Manuel Sorge, and Ondrej Suchý Finding Secluded Places of Special Interest in Graphs 10.4230/LIPIcs.IPEC.2016.5
• Thomas Bläsius, Tobias Friedrich, and Martin Schirneck The Parameterized Complexity of Dependency Detection in Relational Databases 10.4230/LIPIcs.IPEC.2016.6
• Hans L. Bodlaender, Hirotaka Ono, and Yota Otachi A Faster Parameterized Algorithm for Pseudoforest Deletion 10.4230/LIPIcs.IPEC.2016.7
• Glencora Borradaile and Hung Le Optimal Dynamic Program for r-Domination Problems over Tree Decompositions 10.4230/LIPIcs.IPEC.2016.8
• Cornelius Brand, Holger Dell, and Marc Roth Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP 10.4230/LIPIcs.IPEC.2016.9
• Robert Bredereck, Vincent Froese, Marcel Koseler, Marcelo Garlet Millani, André Nichterlein, and Rolf Niedermeier A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs 10.4230/LIPIcs.IPEC.2016.10
• Sunil Chandran, Davis Issac, and Andreas Karrenbauer On the Parameterized Complexity of Biclique Cover and Partition 10.4230/LIPIcs.IPEC.2016.11
• Khaled Elbassioni Exact Algorithms for List-Coloring of Intersecting Hypergraphs 10.4230/LIPIcs.IPEC.2016.12
• Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, and Stefan Rümmele Turbocharging Treewidth Heuristics 10.4230/LIPIcs.IPEC.2016.13
• Serge Gaspers, Christos H. Papadimitriou, Sigve Hortemo Sæther, and Jan Arne Telle On Satisfiability Problems with a Linear Structure 10.4230/LIPIcs.IPEC.2016.14
• Archontia C. Giannopoulou, Michal Pilipczuk, Jean-Florent Raymond, Dimitrios M. Thilikos, and Marcin Wrochna Cutwidth: Obstructions and Algorithmic Aspects 10.4230/LIPIcs.IPEC.2016.15
• Thore Husfeldt Computing Graph Distances Parameterized by Treewidth and Diameter 10.4230/LIPIcs.IPEC.2016.16
• Bart M. P. Jansen and Jules J. H. M. Wulms Lower Bounds for Protrusion Replacement by Counting Equivalence Classes 10.4230/LIPIcs.IPEC.2016.17
• Yasuaki Kobayashi and Hisao Tamaki Treedepth Parameterized by Vertex Cover Number 10.4230/LIPIcs.IPEC.2016.18
• R. Krithika, Abhishek Sahu, and Prafullkumar Tale Dynamic Parameterized Problems 10.4230/LIPIcs.IPEC.2016.19
• Mithilesh Kumar and Daniel Lokshtanov A 2lk Kernel for l-Component Order Connectivity 10.4230/LIPIcs.IPEC.2016.20
• Diptapriyo Majumdar Structural Parameterizations of Feedback Vertex Set 10.4230/LIPIcs.IPEC.2016.21
• Kitty Meeks Randomised Enumeration of Small Witnesses Using a Decision Oracle 10.4230/LIPIcs.IPEC.2016.22
• Arne Meier, Sebastian Ordyniak, Ramanujan Sridharan, and Irena Schindler Backdoors for Linear Temporal Logic 10.4230/LIPIcs.IPEC.2016.23
• Matthias Mnich and Eva-Lotta Teutrine Improved Bounds for Minimal Feedback Vertex Sets in Tournaments 10.4230/LIPIcs.IPEC.2016.24
• Mateus de Oliveira Oliveira Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth 10.4230/LIPIcs.IPEC.2016.25
• Marcin Pilipczuk, Michal Pilipczuk, and Marcin Wrochna Edge Bipartization Faster Than 2^k 10.4230/LIPIcs.IPEC.2016.26
• Willem J. A. Pino, Hans L. Bodlaender, and Johan M. M. van Rooij Cut and Count and Representative Sets on Branch Decompositions 10.4230/LIPIcs.IPEC.2016.27
• Blair D. Sullivan and Andrew van der Poel A Fast Parameterized Algorithm for Co-Path Set 10.4230/LIPIcs.IPEC.2016.28
• Michal Wlodarczyk Clifford Algebras Meet Tree Decompositions 10.4230/LIPIcs.IPEC.2016.29
• Holger Dell, Thore Husfeldt, Bart M. P. Jansen, Petteri Kaski, Christian Komusiewicz, and Frances A. Rosamond The First Parameterized Algorithms and Computational Experiments Challenge 10.4230/LIPIcs.IPEC.2016.30