@Proceedings{guo_et_al:LIPIcs.IPEC.2016,
title = {{LIPIcs, Volume 63, IPEC'16, Complete Volume}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016},
URN = {urn:nbn:de:0030-drops-69572},
doi = {10.4230/LIPIcs.IPEC.2016},
annote = {Keywords: Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Discrete Mathematics}
}
@InProceedings{guo_et_al:LIPIcs.IPEC.2016.0,
author = {Guo, Jiong and Hermelin, Danny},
title = {{Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {0:i--0:xiv},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.0},
URN = {urn:nbn:de:0030-drops-69180},
doi = {10.4230/LIPIcs.IPEC.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Program Committee, External Reviewers, List of Authors}
}
@InProceedings{bjorklund:LIPIcs.IPEC.2016.1,
author = {Bj\"{o}rklund, Andreas},
title = {{Determinant Sums for Hamiltonicity}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.1},
URN = {urn:nbn:de:0030-drops-69485},
doi = {10.4230/LIPIcs.IPEC.2016.1},
annote = {Keywords: Hamiltonian cycle, exact algorithms, matrix determinant, algebraic techniques}
}
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2016.2,
author = {Agrawal, Akanksha and Gupta, Sushmita and Saurabh, Saket and Sharma, Roohani},
title = {{Improved Algorithms and Combinatorial Bounds for Independent Feedback Vertex Set}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {2:1--2:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.2},
URN = {urn:nbn:de:0030-drops-69400},
doi = {10.4230/LIPIcs.IPEC.2016.2},
annote = {Keywords: independent feedback vertex set, fixed parameter tractable, exact algorithm, enumeration}
}
@InProceedings{bacso_et_al:LIPIcs.IPEC.2016.3,
author = {Bacs\'{o}, G\'{a}bor and Marx, D\'{a}niel and Tuza, Zsolt},
title = {{H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {3:1--3:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.3},
URN = {urn:nbn:de:0030-drops-69397},
doi = {10.4230/LIPIcs.IPEC.2016.3},
annote = {Keywords: independent set, scattered set, subexponential algorithms, H-free graphs}
}
@InProceedings{bannach_et_al:LIPIcs.IPEC.2016.4,
author = {Bannach, Max and Tantau, Till},
title = {{Parallel Multivariate Meta-Theorems}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.4},
URN = {urn:nbn:de:0030-drops-69227},
doi = {10.4230/LIPIcs.IPEC.2016.4},
annote = {Keywords: Parallel computation, FPT, meta-theorems, tree width, tree depth}
}
@InProceedings{vanbevern_et_al:LIPIcs.IPEC.2016.5,
author = {van Bevern, Ren\'{e} and Fluschnik, Till and Mertzios, George B. and Molter, Hendrik and Sorge, Manuel and Such\'{y}, Ondrej},
title = {{Finding Secluded Places of Special Interest in Graphs}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.5},
URN = {urn:nbn:de:0030-drops-69380},
doi = {10.4230/LIPIcs.IPEC.2016.5},
annote = {Keywords: Neighborhood, Feedback Vertex Set, Vertex Deletion, Separator, Dominating Set}
}
@InProceedings{blasius_et_al:LIPIcs.IPEC.2016.6,
author = {Bl\"{a}sius, Thomas and Friedrich, Tobias and Schirneck, Martin},
title = {{The Parameterized Complexity of Dependency Detection in Relational Databases}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.6},
URN = {urn:nbn:de:0030-drops-69202},
doi = {10.4230/LIPIcs.IPEC.2016.6},
annote = {Keywords: parameterized complexity, unique column combination, functional dependency, inclusion dependency, profiling relational data}
}
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2016.7,
author = {Bodlaender, Hans L. and Ono, Hirotaka and Otachi, Yota},
title = {{A Faster Parameterized Algorithm for Pseudoforest Deletion}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {7:1--7:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.7},
URN = {urn:nbn:de:0030-drops-69246},
doi = {10.4230/LIPIcs.IPEC.2016.7},
annote = {Keywords: pseudoforest deletion, graph class, width parameter, parameterized complexity}
}
@InProceedings{borradaile_et_al:LIPIcs.IPEC.2016.8,
author = {Borradaile, Glencora and Le, Hung},
title = {{Optimal Dynamic Program for r-Domination Problems over Tree Decompositions}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {8:1--8:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.8},
URN = {urn:nbn:de:0030-drops-69199},
doi = {10.4230/LIPIcs.IPEC.2016.8},
annote = {Keywords: r-dominating set, Exponential Time Hypothesis, Dynamic Programming}
}
@InProceedings{brand_et_al:LIPIcs.IPEC.2016.9,
author = {Brand, Cornelius and Dell, Holger and Roth, Marc},
title = {{Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.9},
URN = {urn:nbn:de:0030-drops-69426},
doi = {10.4230/LIPIcs.IPEC.2016.9},
annote = {Keywords: computational complexity, counting problems, Tutte polynomial, exponential time hypothesis, forests, independent sets}
}
@InProceedings{bredereck_et_al:LIPIcs.IPEC.2016.10,
author = {Bredereck, Robert and Froese, Vincent and Koseler, Marcel and Millani, Marcelo Garlet and Nichterlein, Andr\'{e} and Niedermeier, Rolf},
title = {{A Parameterized Algorithmics Framework for Degree Sequence Completion Problems in Directed Graphs}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {10:1--10:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.10},
URN = {urn:nbn:de:0030-drops-69353},
doi = {10.4230/LIPIcs.IPEC.2016.10},
annote = {Keywords: NP-hard graph problem, graph realizability, graph modification, arc insertion, fixed-parameter tractability, kernelization}
}
@InProceedings{chandran_et_al:LIPIcs.IPEC.2016.11,
author = {Chandran, Sunil and Issac, Davis and Karrenbauer, Andreas},
title = {{On the Parameterized Complexity of Biclique Cover and Partition}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.11},
URN = {urn:nbn:de:0030-drops-69293},
doi = {10.4230/LIPIcs.IPEC.2016.11},
annote = {Keywords: Biclique Cover/Partition, Linear algebra in finite fields, Lower bound}
}
@InProceedings{elbassioni:LIPIcs.IPEC.2016.12,
author = {Elbassioni, Khaled},
title = {{Exact Algorithms for List-Coloring of Intersecting Hypergraphs}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.12},
URN = {urn:nbn:de:0030-drops-69444},
doi = {10.4230/LIPIcs.IPEC.2016.12},
annote = {Keywords: Hypergraph coloring, monotone Boolean duality, list coloring, exact algorithms, quasi-polynomial time}
}
@InProceedings{gaspers_et_al:LIPIcs.IPEC.2016.13,
author = {Gaspers, Serge and Gudmundsson, Joachim and Jones, Mitchell and Mestre, Juli\'{a}n and R\"{u}mmele, Stefan},
title = {{Turbocharging Treewidth Heuristics}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.13},
URN = {urn:nbn:de:0030-drops-69322},
doi = {10.4230/LIPIcs.IPEC.2016.13},
annote = {Keywords: tree decomposition, heuristic, fixed-parameter tractability, local search}
}
@InProceedings{gaspers_et_al:LIPIcs.IPEC.2016.14,
author = {Gaspers, Serge and Papadimitriou, Christos H. and S{\ae}ther, Sigve Hortemo and Telle, Jan Arne},
title = {{On Satisfiability Problems with a Linear Structure}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {14:1--14:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.14},
URN = {urn:nbn:de:0030-drops-69412},
doi = {10.4230/LIPIcs.IPEC.2016.14},
annote = {Keywords: Satisfiability, interval graphs, FPT algorithms}
}
@InProceedings{giannopoulou_et_al:LIPIcs.IPEC.2016.15,
author = {Giannopoulou, Archontia C. and Pilipczuk, Michal and Raymond, Jean-Florent and Thilikos, Dimitrios M. and Wrochna, Marcin},
title = {{Cutwidth: Obstructions and Algorithmic Aspects}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.15},
URN = {urn:nbn:de:0030-drops-69306},
doi = {10.4230/LIPIcs.IPEC.2016.15},
annote = {Keywords: cutwidth, obstructions, immersions, fixed-parameter tractability}
}
@InProceedings{husfeldt:LIPIcs.IPEC.2016.16,
author = {Husfeldt, Thore},
title = {{Computing Graph Distances Parameterized by Treewidth and Diameter}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {16:1--16:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.16},
URN = {urn:nbn:de:0030-drops-69476},
doi = {10.4230/LIPIcs.IPEC.2016.16},
annote = {Keywords: Graph algorithms, diameter, treewidth, Strong Exponential Time Hypothesis}
}
@InProceedings{jansen_et_al:LIPIcs.IPEC.2016.17,
author = {Jansen, Bart M. P. and Wulms, Jules J. H. M.},
title = {{Lower Bounds for Protrusion Replacement by Counting Equivalence Classes}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {17:1--17:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.17},
URN = {urn:nbn:de:0030-drops-69275},
doi = {10.4230/LIPIcs.IPEC.2016.17},
annote = {Keywords: protrusions, boundaried graphs, independent set, equivalence classes, finite integer index}
}
@InProceedings{kobayashi_et_al:LIPIcs.IPEC.2016.18,
author = {Kobayashi, Yasuaki and Tamaki, Hisao},
title = {{Treedepth Parameterized by Vertex Cover Number}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {18:1--18:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.18},
URN = {urn:nbn:de:0030-drops-69438},
doi = {10.4230/LIPIcs.IPEC.2016.18},
annote = {Keywords: Fixed-parameter algorithm, Polynomial kernelization, Structural parameterization, Treedepth, Vertex cover}
}
@InProceedings{krithika_et_al:LIPIcs.IPEC.2016.19,
author = {Krithika, R. and Sahu, Abhishek and Tale, Prafullkumar},
title = {{Dynamic Parameterized Problems}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.19},
URN = {urn:nbn:de:0030-drops-69366},
doi = {10.4230/LIPIcs.IPEC.2016.19},
annote = {Keywords: dynamic problems, fixed-parameter tractability, kernelization}
}
@InProceedings{kumar_et_al:LIPIcs.IPEC.2016.20,
author = {Kumar, Mithilesh and Lokshtanov, Daniel},
title = {{A 2lk Kernel for l-Component Order Connectivity}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.20},
URN = {urn:nbn:de:0030-drops-69345},
doi = {10.4230/LIPIcs.IPEC.2016.20},
annote = {Keywords: Parameterized algorithms, Kernel, Component Order Connectivity, Max-min allocation, Weighted expansion}
}
@InProceedings{majumdar:LIPIcs.IPEC.2016.21,
author = {Majumdar, Diptapriyo},
title = {{Structural Parameterizations of Feedback Vertex Set}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {21:1--21:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.21},
URN = {urn:nbn:de:0030-drops-69337},
doi = {10.4230/LIPIcs.IPEC.2016.21},
annote = {Keywords: Parameterized Complexity, Kernelization, Feedback Vertex Set, Structural Parameterization}
}
@InProceedings{meeks:LIPIcs.IPEC.2016.22,
author = {Meeks, Kitty},
title = {{Randomised Enumeration of Small Witnesses Using a Decision Oracle}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {22:1--22:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.22},
URN = {urn:nbn:de:0030-drops-69218},
doi = {10.4230/LIPIcs.IPEC.2016.22},
annote = {Keywords: enumeration algorithms, parameterized complexity, randomized algorithms, color coding}
}
@InProceedings{meier_et_al:LIPIcs.IPEC.2016.23,
author = {Meier, Arne and Ordyniak, Sebastian and Sridharan, Ramanujan and Schindler, Irena},
title = {{Backdoors for Linear Temporal Logic}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {23:1--23:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.23},
URN = {urn:nbn:de:0030-drops-69462},
doi = {10.4230/LIPIcs.IPEC.2016.23},
annote = {Keywords: Linear Temporal Logic, Parameterized Complexity, Backdoor Sets}
}
@InProceedings{mnich_et_al:LIPIcs.IPEC.2016.24,
author = {Mnich, Matthias and Teutrine, Eva-Lotta},
title = {{Improved Bounds for Minimal Feedback Vertex Sets in Tournaments}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {24:1--24:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.24},
URN = {urn:nbn:de:0030-drops-69236},
doi = {10.4230/LIPIcs.IPEC.2016.24},
annote = {Keywords: exponential-time algorithms, feedback vertex sets, tournaments}
}
@InProceedings{deoliveiraoliveira:LIPIcs.IPEC.2016.25,
author = {de Oliveira Oliveira, Mateus},
title = {{Ground Reachability and Joinability in Linear Term Rewriting Systems are Fixed Parameter Tractable with Respect to Depth}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {25:1--25:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.25},
URN = {urn:nbn:de:0030-drops-69256},
doi = {10.4230/LIPIcs.IPEC.2016.25},
annote = {Keywords: Linear Term Rewriting Systems, Ground Reachability, Ground Joinability, Fixed Parameter Tractability}
}
@InProceedings{pilipczuk_et_al:LIPIcs.IPEC.2016.26,
author = {Pilipczuk, Marcin and Pilipczuk, Michal and Wrochna, Marcin},
title = {{Edge Bipartization Faster Than 2^k}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {26:1--26:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.26},
URN = {urn:nbn:de:0030-drops-69285},
doi = {10.4230/LIPIcs.IPEC.2016.26},
annote = {Keywords: edge bipartization, FPT algorithm}
}
@InProceedings{pino_et_al:LIPIcs.IPEC.2016.27,
author = {Pino, Willem J. A. and Bodlaender, Hans L. and van Rooij, Johan M. M.},
title = {{Cut and Count and Representative Sets on Branch Decompositions}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {27:1--27:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.27},
URN = {urn:nbn:de:0030-drops-69450},
doi = {10.4230/LIPIcs.IPEC.2016.27},
annote = {Keywords: Graph algorithms, Branchwidth, Treewidth, Dynamic Programming, Planar Graphs}
}
@InProceedings{sullivan_et_al:LIPIcs.IPEC.2016.28,
author = {Sullivan, Blair D. and van der Poel, Andrew},
title = {{A Fast Parameterized Algorithm for Co-Path Set}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.28},
URN = {urn:nbn:de:0030-drops-69371},
doi = {10.4230/LIPIcs.IPEC.2016.28},
annote = {Keywords: co-path set, parameterized complexity, Cut\&Count, bounded treewidth}
}
@InProceedings{wlodarczyk:LIPIcs.IPEC.2016.29,
author = {Wlodarczyk, Michal},
title = {{Clifford Algebras Meet Tree Decompositions}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {29:1--29:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.29},
URN = {urn:nbn:de:0030-drops-69260},
doi = {10.4230/LIPIcs.IPEC.2016.29},
annote = {Keywords: fixed-parameter tractability, treewidth, Clifford algebra, algebra isomorphism}
}
@InProceedings{dell_et_al:LIPIcs.IPEC.2016.30,
author = {Dell, Holger and Husfeldt, Thore and Jansen, Bart M. P. and Kaski, Petteri and Komusiewicz, Christian and Rosamond, Frances A.},
title = {{The First Parameterized Algorithms and Computational Experiments Challenge}},
booktitle = {11th International Symposium on Parameterized and Exact Computation (IPEC 2016)},
pages = {30:1--30:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-023-1},
ISSN = {1868-8969},
year = {2017},
volume = {63},
editor = {Guo, Jiong and Hermelin, Danny},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2016.30},
URN = {urn:nbn:de:0030-drops-69310},
doi = {10.4230/LIPIcs.IPEC.2016.30},
annote = {Keywords: treewidth, feedback vertex set, contest, implementation challenge, FPT}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing