13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@Proceedings{paul_et_al:LIPIcs.IPEC.2018, title = {{LIPIcs, Volume 115, IPEC'18, Complete Volume}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018}, URN = {urn:nbn:de:0030-drops-102320}, doi = {10.4230/LIPIcs.IPEC.2018}, annote = {Keywords: Theory of computation, Complexity classes, Theory of computation, Design and analysis of algorithms, Mathematics of computing, Discrete mathematics} }
13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 0:i-0:xiv, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{paul_et_al:LIPIcs.IPEC.2018.0, author = {Paul, Christophe and Pilipczuk, Michal}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {0:i--0:xiv}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.0}, URN = {urn:nbn:de:0030-drops-102012}, doi = {10.4230/LIPIcs.IPEC.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Radu Curticapean. Counting Problems in Parameterized Complexity. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 1:1-1:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{curticapean:LIPIcs.IPEC.2018.1, author = {Curticapean, Radu}, title = {{Counting Problems in Parameterized Complexity}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {1:1--1:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.1}, URN = {urn:nbn:de:0030-drops-102026}, doi = {10.4230/LIPIcs.IPEC.2018.1}, annote = {Keywords: counting complexity, parameterized complexity, graph motifs, perfect matchings, graph minor theory, Hamiltonian cycles} }
Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos. A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 2:1-2:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{baste_et_al:LIPIcs.IPEC.2018.2, author = {Baste, Julien and Sau, Ignasi and Thilikos, Dimitrios M.}, title = {{A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {2:1--2:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.2}, URN = {urn:nbn:de:0030-drops-102033}, doi = {10.4230/LIPIcs.IPEC.2018.2}, annote = {Keywords: parameterized complexity, graph minors, treewidth, hitting minors, topological minors, dynamic programming, Exponential Time Hypothesis} }
Bas A. M. van Geffen, Bart M. P. Jansen, Arnoud A. W. M. de Kroon, and Rolf Morel. Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 3:1-3:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{vangeffen_et_al:LIPIcs.IPEC.2018.3, author = {van Geffen, Bas A. M. and Jansen, Bart M. P. and de Kroon, Arnoud A. W. M. and Morel, Rolf}, title = {{Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {3:1--3:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.3}, URN = {urn:nbn:de:0030-drops-102049}, doi = {10.4230/LIPIcs.IPEC.2018.3}, annote = {Keywords: planarization, dominating set, cutwidth, lower bounds, strong exponential time hypothesis} }
Karl Bringmann, Thore Husfeldt, and Måns Magnusson. Multivariate Analysis of Orthogonal Range Searching and Graph Distances. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 4:1-4:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bringmann_et_al:LIPIcs.IPEC.2018.4, author = {Bringmann, Karl and Husfeldt, Thore and Magnusson, M\r{a}ns}, title = {{Multivariate Analysis of Orthogonal Range Searching and Graph Distances}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {4:1--4:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.4}, URN = {urn:nbn:de:0030-drops-102050}, doi = {10.4230/LIPIcs.IPEC.2018.4}, annote = {Keywords: Diameter, radius, Wiener index, orthogonal range searching, treewidth, vertex cover number} }
Kustaa Kangas, Mikko Koivisto, and Sami Salonen. A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 5:1-5:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kangas_et_al:LIPIcs.IPEC.2018.5, author = {Kangas, Kustaa and Koivisto, Mikko and Salonen, Sami}, title = {{A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.5}, URN = {urn:nbn:de:0030-drops-102062}, doi = {10.4230/LIPIcs.IPEC.2018.5}, annote = {Keywords: Algorithm selection, empirical hardness, linear extension, multiplication of polynomials, tree decomposition} }
Lars Jaffke, O-joung Kwon, Torstein J. F. Strømme, and Jan Arne Telle. Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jaffke_et_al:LIPIcs.IPEC.2018.6, author = {Jaffke, Lars and Kwon, O-joung and Str{\o}mme, Torstein J. F. and Telle, Jan Arne}, title = {{Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {6:1--6:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.6}, URN = {urn:nbn:de:0030-drops-102074}, doi = {10.4230/LIPIcs.IPEC.2018.6}, annote = {Keywords: Graph Width Parameters, Graph Classes, Distance Domination Problems, Parameterized Complexity} }
Junjie Luo, Hendrik Molter, and Ondrej Suchý. A Parameterized Complexity View on Collapsing k-Cores. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 7:1-7:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{luo_et_al:LIPIcs.IPEC.2018.7, author = {Luo, Junjie and Molter, Hendrik and Such\'{y}, Ondrej}, title = {{A Parameterized Complexity View on Collapsing k-Cores}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {7:1--7:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.7}, URN = {urn:nbn:de:0030-drops-102088}, doi = {10.4230/LIPIcs.IPEC.2018.7}, annote = {Keywords: r-Degenerate Vertex Deletion, Feedback Vertex Set, Fixed-Parameter Tractability, Kernelization Lower Bounds, Graph Algorithms, Social Network Analysis} }
Saket Saurabh and Meirav Zehavi. Parameterized Complexity of Multi-Node Hubs. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{saurabh_et_al:LIPIcs.IPEC.2018.8, author = {Saurabh, Saket and Zehavi, Meirav}, title = {{Parameterized Complexity of Multi-Node Hubs}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.8}, URN = {urn:nbn:de:0030-drops-102090}, doi = {10.4230/LIPIcs.IPEC.2018.8}, annote = {Keywords: hub, bisection, tree decomposition} }
Kitty Meeks and Fiona Skerman. The Parameterised Complexity of Computing the Maximum Modularity of a Graph. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{meeks_et_al:LIPIcs.IPEC.2018.9, author = {Meeks, Kitty and Skerman, Fiona}, title = {{The Parameterised Complexity of Computing the Maximum Modularity of a Graph}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.9}, URN = {urn:nbn:de:0030-drops-102103}, doi = {10.4230/LIPIcs.IPEC.2018.9}, annote = {Keywords: modularity, community detection, integer quadratic programming, vertex cover, pathwidth} }
Florian Barbero, Lucas Isenmann, and Jocelyn Thiebaut. On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{barbero_et_al:LIPIcs.IPEC.2018.10, author = {Barbero, Florian and Isenmann, Lucas and Thiebaut, Jocelyn}, title = {{On the Distance Identifying Set Meta-Problem and Applications to the Complexity of Identifying Problems on Graphs}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.10}, URN = {urn:nbn:de:0030-drops-102114}, doi = {10.4230/LIPIcs.IPEC.2018.10}, annote = {Keywords: identifying code, resolving set, metric dimension, distance identifying set, parameterized complexity, W-hierarchy, meta-problem, hitting set} }
David Eppstein and Daniel Lokshtanov. The Parameterized Complexity of Finding Point Sets with Hereditary Properties. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 11:1-11:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{eppstein_et_al:LIPIcs.IPEC.2018.11, author = {Eppstein, David and Lokshtanov, Daniel}, title = {{The Parameterized Complexity of Finding Point Sets with Hereditary Properties}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {11:1--11:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.11}, URN = {urn:nbn:de:0030-drops-102121}, doi = {10.4230/LIPIcs.IPEC.2018.11}, annote = {Keywords: parameterized complexity, fixed-parameter tractability, point set pattern matching, largest pattern-avoiding subset, order type} }
Júlio Araújo, Victor A. Campos, Carlos Vinícius G. C. Lima, Vinícius Fernandes dos Santos, Ignasi Sau, and Ana Silva. Dual Parameterization of Weighted Coloring. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 12:1-12:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{araujo_et_al:LIPIcs.IPEC.2018.12, author = {Ara\'{u}jo, J\'{u}lio and Campos, Victor A. and Lima, Carlos Vin{\'\i}cius G. C. and Fernandes dos Santos, Vin{\'\i}cius and Sau, Ignasi and Silva, Ana}, title = {{Dual Parameterization of Weighted Coloring}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {12:1--12:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.12}, URN = {urn:nbn:de:0030-drops-102134}, doi = {10.4230/LIPIcs.IPEC.2018.12}, annote = {Keywords: weighted coloring, max coloring, parameterized complexity, dual parameterization, FPT algorithms, polynomial kernels, split graphs, interval graphs} }
Max Bannach and Till Tantau. Computing Kernels in Parallel: Lower and Upper Bounds. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bannach_et_al:LIPIcs.IPEC.2018.13, author = {Bannach, Max and Tantau, Till}, title = {{Computing Kernels in Parallel: Lower and Upper Bounds}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.13}, URN = {urn:nbn:de:0030-drops-102148}, doi = {10.4230/LIPIcs.IPEC.2018.13}, annote = {Keywords: parallel computation, fixed-parameter tractability, kernelization} }
Akanksha Agrawal, Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra, and Saket Saurabh. Exploring the Kernelization Borders for Hitting Cycles. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 14:1-14:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2018.14, author = {Agrawal, Akanksha and Jain, Pallavi and Kanesh, Lawqueen and Misra, Pranabendu and Saurabh, Saket}, title = {{Exploring the Kernelization Borders for Hitting Cycles}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.14}, URN = {urn:nbn:de:0030-drops-102158}, doi = {10.4230/LIPIcs.IPEC.2018.14}, annote = {Keywords: Parameterized Complexity, Kernelization, Conflict-free problems, Feedback Vertex Set, Even Cycle Transversal, Odd Cycle Transversal} }
Hubie Chen, Bart M. P. Jansen, and Astrid Pieterse. Best-Case and Worst-Case Sparsifiability of Boolean CSPs. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{chen_et_al:LIPIcs.IPEC.2018.15, author = {Chen, Hubie and Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Best-Case and Worst-Case Sparsifiability of Boolean CSPs}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.15}, URN = {urn:nbn:de:0030-drops-102169}, doi = {10.4230/LIPIcs.IPEC.2018.15}, annote = {Keywords: constraint satisfaction problems, kernelization, sparsification, lower bounds} }
David Eppstein and Elham Havvaei. Parameterized Leaf Power Recognition via Embedding into Graph Products. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{eppstein_et_al:LIPIcs.IPEC.2018.16, author = {Eppstein, David and Havvaei, Elham}, title = {{Parameterized Leaf Power Recognition via Embedding into Graph Products}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.16}, URN = {urn:nbn:de:0030-drops-102179}, doi = {10.4230/LIPIcs.IPEC.2018.16}, annote = {Keywords: leaf power, phylogenetic tree, monadic second-order logic, Courcelle's theorem, strong product of graphs, fixed-parameter tractability} }
Édouard Bonnet, Nicolas Bousquet, Pierre Charbit, Stéphan Thomassé, and Rémi Watrigant. Parameterized Complexity of Independent Set in H-Free Graphs. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 17:1-17:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2018.17, author = {Bonnet, \'{E}douard and Bousquet, Nicolas and Charbit, Pierre and Thomass\'{e}, St\'{e}phan and Watrigant, R\'{e}mi}, title = {{Parameterized Complexity of Independent Set in H-Free Graphs}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {17:1--17:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.17}, URN = {urn:nbn:de:0030-drops-102183}, doi = {10.4230/LIPIcs.IPEC.2018.17}, annote = {Keywords: Parameterized Algorithms, Independent Set, H-Free Graphs} }
Stefan Kratsch, Shaohua Li, Dániel Marx, Marcin Pilipczuk, and Magnus Wahlström. Multi-Budgeted Directed Cuts. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{kratsch_et_al:LIPIcs.IPEC.2018.18, author = {Kratsch, Stefan and Li, Shaohua and Marx, D\'{a}niel and Pilipczuk, Marcin and Wahlstr\"{o}m, Magnus}, title = {{Multi-Budgeted Directed Cuts}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.18}, URN = {urn:nbn:de:0030-drops-102194}, doi = {10.4230/LIPIcs.IPEC.2018.18}, annote = {Keywords: important separators, multi-budgeted cuts, Directed Feedback Vertex Set, fixed-parameter tractability, minimum cut} }
Christian Komusiewicz, Dieter Kratsch, and Van Bang Le. Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 19:1-19:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{komusiewicz_et_al:LIPIcs.IPEC.2018.19, author = {Komusiewicz, Christian and Kratsch, Dieter and Le, Van Bang}, title = {{Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {19:1--19:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.19}, URN = {urn:nbn:de:0030-drops-102207}, doi = {10.4230/LIPIcs.IPEC.2018.19}, annote = {Keywords: matching cut, decomposable graph, graph algorithm} }
Charis Papadopoulos and Spyridon Tzimas. Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{papadopoulos_et_al:LIPIcs.IPEC.2018.20, author = {Papadopoulos, Charis and Tzimas, Spyridon}, title = {{Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.20}, URN = {urn:nbn:de:0030-drops-102216}, doi = {10.4230/LIPIcs.IPEC.2018.20}, annote = {Keywords: Subset Feedback Vertex Set, Node Multiway Cut, Terminal Set problem, polynomial-time algorithm, NP-completeness, W\lbrack1\rbrack-hardness, graphs of bounded independent set size} }
Tomás Gavenciak, Dusan Knop, and Martin Koutecký. Integer Programming in Parameterized Complexity: Three Miniatures. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 21:1-21:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{gavenciak_et_al:LIPIcs.IPEC.2018.21, author = {Gavenciak, Tom\'{a}s and Knop, Dusan and Kouteck\'{y}, Martin}, title = {{Integer Programming in Parameterized Complexity: Three Miniatures}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {21:1--21:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.21}, URN = {urn:nbn:de:0030-drops-102225}, doi = {10.4230/LIPIcs.IPEC.2018.21}, annote = {Keywords: graph coloring, parameterized complexity, integer linear programming, integer convex programming} }
Ivan Bliznets and Danil Sagunov. Solving Target Set Selection with Bounded Thresholds Faster than 2^n. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 22:1-22:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bliznets_et_al:LIPIcs.IPEC.2018.22, author = {Bliznets, Ivan and Sagunov, Danil}, title = {{Solving Target Set Selection with Bounded Thresholds Faster than 2^n}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {22:1--22:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.22}, URN = {urn:nbn:de:0030-drops-102235}, doi = {10.4230/LIPIcs.IPEC.2018.22}, annote = {Keywords: exact exponential algorithms, target set, vertex thresholds, social influence, irreversible conversions of graphs, bootstrap percolation} }
Katrin Casel. Resolving Conflicts for Lower-Bounded Clustering. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 23:1-23:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{casel:LIPIcs.IPEC.2018.23, author = {Casel, Katrin}, title = {{Resolving Conflicts for Lower-Bounded Clustering}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {23:1--23:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.23}, URN = {urn:nbn:de:0030-drops-102247}, doi = {10.4230/LIPIcs.IPEC.2018.23}, annote = {Keywords: clustering, triangle inequality, parameterised approximation} }
Marc Roth and Johannes Schmitt. Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 24:1-24:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{roth_et_al:LIPIcs.IPEC.2018.24, author = {Roth, Marc and Schmitt, Johannes}, title = {{Counting Induced Subgraphs: A Topological Approach to #W\lbrack1\rbrack-hardness}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {24:1--24:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.24}, URN = {urn:nbn:de:0030-drops-102255}, doi = {10.4230/LIPIcs.IPEC.2018.24}, annote = {Keywords: counting complexity, Euler characteristic, homomorphisms, parameterized complexity, simplicial complexes} }
Daniel Lokshtanov, Mateus de Oliveira Oliveira, and Saket Saurabh. A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{lokshtanov_et_al:LIPIcs.IPEC.2018.25, author = {Lokshtanov, Daniel and de Oliveira Oliveira, Mateus and Saurabh, Saket}, title = {{A Strongly-Uniform Slicewise Polynomial-Time Algorithm for the Embedded Planar Diameter Improvement Problem}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {25:1--25:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.25}, URN = {urn:nbn:de:0030-drops-102265}, doi = {10.4230/LIPIcs.IPEC.2018.25}, annote = {Keywords: Embedded Planar Diameter Improvement, Constructive Algorithms, Nooses} }
Édouard Bonnet and Florian Sikora. The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. In 13th International Symposium on Parameterized and Exact Computation (IPEC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 115, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2018.26, author = {Bonnet, \'{E}douard and Sikora, Florian}, title = {{The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration}}, booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-084-2}, ISSN = {1868-8969}, year = {2019}, volume = {115}, editor = {Paul, Christophe and Pilipczuk, Michal}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2018.26}, URN = {urn:nbn:de:0030-drops-102275}, doi = {10.4230/LIPIcs.IPEC.2018.26}, annote = {Keywords: Steiner tree problem, contest, implementation challenge, FPT} }
Feedback for Dagstuhl Publishing