12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@Proceedings{lokshtanov_et_al:LIPIcs.IPEC.2017, title = {{LIPIcs, Volume 89, IPEC'17, Complete Volume}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017}, URN = {urn:nbn:de:0030-drops-86166}, doi = {10.4230/LIPIcs.IPEC.2017}, annote = {Keywords: Complexity Measures and Classes, Analysis of Algorithms and Problem Complexity, Discrete Mathematics} }
12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{lokshtanov_et_al:LIPIcs.IPEC.2017.0, author = {Lokshtanov, Daniel and Nishimura, Naomi}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {0:i--0:xii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.0}, URN = {urn:nbn:de:0030-drops-85437}, doi = {10.4230/LIPIcs.IPEC.2017.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Akanksha Agrawal, Saket Saurabh, and Prafullkumar Tale. On the Parameterized Complexity of Contraction to Generalization of Trees. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 1:1-1:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2017.1, author = {Agrawal, Akanksha and Saurabh, Saket and Tale, Prafullkumar}, title = {{On the Parameterized Complexity of Contraction to Generalization of Trees}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {1:1--1:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.1}, URN = {urn:nbn:de:0030-drops-85446}, doi = {10.4230/LIPIcs.IPEC.2017.1}, annote = {Keywords: Graph Contraction, Fixed Parameter Tractability, Graph Algorithms, Generalization of Trees} }
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, and Jacobo Torán. Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 2:1-2:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{arvind_et_al:LIPIcs.IPEC.2017.2, author = {Arvind, Vikraman and K\"{o}bler, Johannes and Kuhnert, Sebastian and Tor\'{a}n, Jacobo}, title = {{Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {2:1--2:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.2}, URN = {urn:nbn:de:0030-drops-85690}, doi = {10.4230/LIPIcs.IPEC.2017.2}, annote = {Keywords: parameterized algorithms, hypergraph isomorphism, mislabeled graphs} }
Julien Baste, Didem Gözüpek, Christophe Paul, Ignasi Sau, Mordechai Shalom, and Dimitrios M. Thilikos. Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 3:1-3:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{baste_et_al:LIPIcs.IPEC.2017.3, author = {Baste, Julien and G\"{o}z\"{u}pek, Didem and Paul, Christophe and Sau, Ignasi and Shalom, Mordechai and Thilikos, Dimitrios M.}, title = {{Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {3:1--3:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.3}, URN = {urn:nbn:de:0030-drops-85545}, doi = {10.4230/LIPIcs.IPEC.2017.3}, annote = {Keywords: reload cost problems, minimum diameter spanning tree, parameterized complexity, FPT algorithm, treewidth, dynamic programming} }
Julien Baste, Ignasi Sau, and Dimitrios M. Thilikos. Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 4:1-4:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{baste_et_al:LIPIcs.IPEC.2017.4, author = {Baste, Julien and Sau, Ignasi and Thilikos, Dimitrios M.}, title = {{Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {4:1--4:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.4}, URN = {urn:nbn:de:0030-drops-85556}, doi = {10.4230/LIPIcs.IPEC.2017.4}, annote = {Keywords: parameterized complexity, graph minors, treewidth, hitting minors, topological minors, dynamic programming, Exponential Time Hypothesis} }
Julien Baste and Dimitrios M. Thilikos. Contraction-Bidimensionality of Geometric Intersection Graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 5:1-5:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{baste_et_al:LIPIcs.IPEC.2017.5, author = {Baste, Julien and Thilikos, Dimitrios M.}, title = {{Contraction-Bidimensionality of Geometric Intersection Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.5}, URN = {urn:nbn:de:0030-drops-85487}, doi = {10.4230/LIPIcs.IPEC.2017.5}, annote = {Keywords: Grid exlusion theorem, Bidimensionality, Geometric intersection graphs, String Graphs} }
Andreas Björklund, Petteri Kaski, and Ryan Williams. Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjorklund_et_al:LIPIcs.IPEC.2017.6, author = {Bj\"{o}rklund, Andreas and Kaski, Petteri and Williams, Ryan}, title = {{Generalized Kakeya Sets for Polynomial Evaluation and Faster Computation of Fermionants}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.6}, URN = {urn:nbn:de:0030-drops-85728}, doi = {10.4230/LIPIcs.IPEC.2017.6}, annote = {Keywords: Besicovitch set, fermionant, finite field, finite vector space, Hamiltonian cycle, homogeneous polynomial, Kakeya set, permanent, polynomial evaluatio} }
Édouard Bonnet, Nick Brettell, O-joung Kwon, and Dániel Marx. Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 7:1-7:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2017.7, author = {Bonnet, \'{E}douard and Brettell, Nick and Kwon, O-joung and Marx, D\'{a}niel}, title = {{Generalized Feedback Vertex Set Problems on Bounded-Treewidth Graphs: Chordality Is the Key to Single-Exponential Parameterized Algorithms}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {7:1--7:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.7}, URN = {urn:nbn:de:0030-drops-85653}, doi = {10.4230/LIPIcs.IPEC.2017.7}, annote = {Keywords: fixed-parameter tractable algorithms, treewidth, feedback vertex set} }
Édouard Bonnet, Panos Giannopoulos, and Michael Lampis. On the Parameterized Complexity of Red-Blue Points Separation. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 8:1-8:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2017.8, author = {Bonnet, \'{E}douard and Giannopoulos, Panos and Lampis, Michael}, title = {{On the Parameterized Complexity of Red-Blue Points Separation}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {8:1--8:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.8}, URN = {urn:nbn:de:0030-drops-85687}, doi = {10.4230/LIPIcs.IPEC.2017.8}, annote = {Keywords: red-blue points separation, geometric problem, W\lbrack1\rbrack-hardness, FPT algorithm, ETH-based lower bound} }
Ralph Bottesch. Relativization and Interactive Proof Systems in Parameterized Complexity Theory. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 9:1-9:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bottesch:LIPIcs.IPEC.2017.9, author = {Bottesch, Ralph}, title = {{Relativization and Interactive Proof Systems in Parameterized Complexity Theory}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {9:1--9:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.9}, URN = {urn:nbn:de:0030-drops-85715}, doi = {10.4230/LIPIcs.IPEC.2017.9}, annote = {Keywords: Parameterized complexity, Relativization, Interactive Proof Systems} }
Marin Bougeret and Ignasi Sau. How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 10:1-10:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bougeret_et_al:LIPIcs.IPEC.2017.10, author = {Bougeret, Marin and Sau, Ignasi}, title = {{How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs?}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {10:1--10:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.10}, URN = {urn:nbn:de:0030-drops-85564}, doi = {10.4230/LIPIcs.IPEC.2017.10}, annote = {Keywords: parameterized complexity, polynomial kernels, structural parameters, treedepth, treewidth, sparse graphs} }
Jean Cardinal, Jerri Nummenpalo, and Emo Welzl. Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 11:1-11:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cardinal_et_al:LIPIcs.IPEC.2017.11, author = {Cardinal, Jean and Nummenpalo, Jerri and Welzl, Emo}, title = {{Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {11:1--11:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.11}, URN = {urn:nbn:de:0030-drops-85459}, doi = {10.4230/LIPIcs.IPEC.2017.11}, annote = {Keywords: Satisfiability, Sampling, Parameterized complexity} }
Karthekeyan Chandrasekaran and Sahand Mozaffari. Odd Multiway Cut in Directed Acyclic Graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 12:1-12:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chandrasekaran_et_al:LIPIcs.IPEC.2017.12, author = {Chandrasekaran, Karthekeyan and Mozaffari, Sahand}, title = {{Odd Multiway Cut in Directed Acyclic Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {12:1--12:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.12}, URN = {urn:nbn:de:0030-drops-85470}, doi = {10.4230/LIPIcs.IPEC.2017.12}, annote = {Keywords: Odd Multiway Cut, Fixed-Parameter Tractability, Approximation Algorithms} }
Radu Curticapean, Holger Dell, Fedor V. Fomin, Leslie Ann Goldberg, and John Lapinskas. A Fixed-Parameter Perspective on #BIS. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{curticapean_et_al:LIPIcs.IPEC.2017.13, author = {Curticapean, Radu and Dell, Holger and Fomin, Fedor V. and Goldberg, Leslie Ann and Lapinskas, John}, title = {{A Fixed-Parameter Perspective on #BIS}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {13:1--13:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.13}, URN = {urn:nbn:de:0030-drops-85613}, doi = {10.4230/LIPIcs.IPEC.2017.13}, annote = {Keywords: Approximate counting, parameterised complexity, independent sets} }
Mark de Berg, Sándor Kisfaludi-Bak, and Gerhard Woeginger. The Dominating Set Problem in Geometric Intersection Graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 14:1-14:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{deberg_et_al:LIPIcs.IPEC.2017.14, author = {de Berg, Mark and Kisfaludi-Bak, S\'{a}ndor and Woeginger, Gerhard}, title = {{The Dominating Set Problem in Geometric Intersection Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {14:1--14:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.14}, URN = {urn:nbn:de:0030-drops-85538}, doi = {10.4230/LIPIcs.IPEC.2017.14}, annote = {Keywords: dominating set, intersection graph, W-hierarchy} }
Lech Duraj, Marvin Künnemann, and Adam Polak. Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{duraj_et_al:LIPIcs.IPEC.2017.15, author = {Duraj, Lech and K\"{u}nnemann, Marvin and Polak, Adam}, title = {{Tight Conditional Lower Bounds for Longest Common Increasing Subsequence}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.15}, URN = {urn:nbn:de:0030-drops-85706}, doi = {10.4230/LIPIcs.IPEC.2017.15}, annote = {Keywords: fine-grained complexity, combinatorial pattern matching, sequence alignments, parameterized complexity, SETH} }
David Eppstein and Denis Kurz. K-Best Solutions of MSO Problems on Tree-Decomposable Graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 16:1-16:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{eppstein_et_al:LIPIcs.IPEC.2017.16, author = {Eppstein, David and Kurz, Denis}, title = {{K-Best Solutions of MSO Problems on Tree-Decomposable Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {16:1--16:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.16}, URN = {urn:nbn:de:0030-drops-85494}, doi = {10.4230/LIPIcs.IPEC.2017.16}, annote = {Keywords: graph algorithm, k-best, monadic second-order logic, treewidth} }
Johannes K. Fichte, Markus Hecher, Michael Morak, and Stefan Woltran. DynASP2.5: Dynamic Programming on Tree Decompositions in Action. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 17:1-17:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fichte_et_al:LIPIcs.IPEC.2017.17, author = {Fichte, Johannes K. and Hecher, Markus and Morak, Michael and Woltran, Stefan}, title = {{DynASP2.5: Dynamic Programming on Tree Decompositions in Action}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {17:1--17:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.17}, URN = {urn:nbn:de:0030-drops-85739}, doi = {10.4230/LIPIcs.IPEC.2017.17}, annote = {Keywords: Parameterized algorithms, Fixed-parameter linear time, Tree decompositions, Multi-pass dynamic programming} }
Petr A. Golovach, Pinar Heggernes, Paloma T. Lima, and Pedro Montealegre. Finding Connected Secluded Subgraphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 18:1-18:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{golovach_et_al:LIPIcs.IPEC.2017.18, author = {Golovach, Petr A. and Heggernes, Pinar and Lima, Paloma T. and Montealegre, Pedro}, title = {{Finding Connected Secluded Subgraphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {18:1--18:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.18}, URN = {urn:nbn:de:0030-drops-85623}, doi = {10.4230/LIPIcs.IPEC.2017.18}, annote = {Keywords: Secluded subgraph, forbidden subgraphs, parameterized complexity} }
Petr Hlineny, Filip Pokrývka, and Bodhayan Roy. FO Model Checking of Geometric Graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 19:1-19:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hlineny_et_al:LIPIcs.IPEC.2017.19, author = {Hlineny, Petr and Pokr\'{y}vka, Filip and Roy, Bodhayan}, title = {{FO Model Checking of Geometric Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {19:1--19:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.19}, URN = {urn:nbn:de:0030-drops-85597}, doi = {10.4230/LIPIcs.IPEC.2017.19}, annote = {Keywords: first-order logic, model checking, fixed-parameter tractability, intersection graphs, visibility graphs} }
Eva-Maria C. Hols and Stefan Kratsch. Smaller Parameters for Vertex Cover Kernelization. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 20:1-20:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{hols_et_al:LIPIcs.IPEC.2017.20, author = {Hols, Eva-Maria C. and Kratsch, Stefan}, title = {{Smaller Parameters for Vertex Cover Kernelization}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {20:1--20:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.20}, URN = {urn:nbn:de:0030-drops-85638}, doi = {10.4230/LIPIcs.IPEC.2017.20}, annote = {Keywords: Vertex Cover, Kernelization, Structural Parameterization} }
Lars Jaffke, O-joung Kwon, and Jan Arne Telle. Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 21:1-21:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jaffke_et_al:LIPIcs.IPEC.2017.21, author = {Jaffke, Lars and Kwon, O-joung and Telle, Jan Arne}, title = {{Polynomial-Time Algorithms for the Longest Induced Path and Induced Disjoint Paths Problems on Graphs of Bounded Mim-Width}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {21:1--21:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.21}, URN = {urn:nbn:de:0030-drops-85643}, doi = {10.4230/LIPIcs.IPEC.2017.21}, annote = {Keywords: graph width parameters, dynamic programming, graph classes, induced paths, induced topological minors} }
Bart M. P. Jansen and Astrid Pieterse. Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 22:1-22:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2017.22, author = {Jansen, Bart M. P. and Pieterse, Astrid}, title = {{Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {22:1--22:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.22}, URN = {urn:nbn:de:0030-drops-85500}, doi = {10.4230/LIPIcs.IPEC.2017.22}, annote = {Keywords: graph coloring, kernelization, sparsification} }
Bart M. P. Jansen, Marcin Pilipczuk, and Marcin Wrochna. Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 23:1-23:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jansen_et_al:LIPIcs.IPEC.2017.23, author = {Jansen, Bart M. P. and Pilipczuk, Marcin and Wrochna, Marcin}, title = {{Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {23:1--23:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.23}, URN = {urn:nbn:de:0030-drops-85576}, doi = {10.4230/LIPIcs.IPEC.2017.23}, annote = {Keywords: Turing kernel, long path, k-path, excluded topological minor, modulator} }
Nikolai Karpov, Marcin Pilipczuk, and Anna Zych-Pawlewicz. An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 24:1-24:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{karpov_et_al:LIPIcs.IPEC.2017.24, author = {Karpov, Nikolai and Pilipczuk, Marcin and Zych-Pawlewicz, Anna}, title = {{An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {24:1--24:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.24}, URN = {urn:nbn:de:0030-drops-85603}, doi = {10.4230/LIPIcs.IPEC.2017.24}, annote = {Keywords: mimicking networks, planar graphs} }
Yasuaki Kobayashi, Hiromu Ohtsuka, and Hisao Tamaki. An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 25:1-25:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kobayashi_et_al:LIPIcs.IPEC.2017.25, author = {Kobayashi, Yasuaki and Ohtsuka, Hiromu and Tamaki, Hisao}, title = {{An Improved Fixed-Parameter Algorithm for One-Page Crossing Minimization}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {25:1--25:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.25}, URN = {urn:nbn:de:0030-drops-85661}, doi = {10.4230/LIPIcs.IPEC.2017.25}, annote = {Keywords: Book Embedding, Fixed-Parameter Tractability, Graph Drawing, Treewidth} }
Michael Lampis and Valia Mitsou. Treewidth with a Quantifier Alternation Revisited. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 26:1-26:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{lampis_et_al:LIPIcs.IPEC.2017.26, author = {Lampis, Michael and Mitsou, Valia}, title = {{Treewidth with a Quantifier Alternation Revisited}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {26:1--26:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.26}, URN = {urn:nbn:de:0030-drops-85512}, doi = {10.4230/LIPIcs.IPEC.2017.26}, annote = {Keywords: Treewidth, Exponential Time Hypothesis, Quantified SAT} }
George Manoussakis. An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 27:1-27:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{manoussakis:LIPIcs.IPEC.2017.27, author = {Manoussakis, George}, title = {{An Output Sensitive Algorithm for Maximal Clique Enumeration in Sparse Graphs}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {27:1--27:8}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.27}, URN = {urn:nbn:de:0030-drops-85529}, doi = {10.4230/LIPIcs.IPEC.2017.27}, annote = {Keywords: enumeration algorithms, maximal cliques, k-degenerate graphs} }
Lei Shang, Michele Garraffa, Federico Della Croce, and Vincent T'Kindt. Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 28:1-28:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{shang_et_al:LIPIcs.IPEC.2017.28, author = {Shang, Lei and Garraffa, Michele and Della Croce, Federico and T'Kindt, Vincent}, title = {{Merging Nodes in Search Trees: an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {28:1--28:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.28}, URN = {urn:nbn:de:0030-drops-85468}, doi = {10.4230/LIPIcs.IPEC.2017.28}, annote = {Keywords: Exact exponential algorithm, Single machine total tardiness, Branch-and-merge} }
Tom C. van der Zanden and Hans L. Bodlaender. Computing Treewidth on the GPU. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 29:1-29:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{vanderzanden_et_al:LIPIcs.IPEC.2017.29, author = {van der Zanden, Tom C. and Bodlaender, Hans L.}, title = {{Computing Treewidth on the GPU}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {29:1--29:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.29}, URN = {urn:nbn:de:0030-drops-85671}, doi = {10.4230/LIPIcs.IPEC.2017.29}, annote = {Keywords: treewidth, GPU, GPGPU, exact algorithms, graph algorithms, algorithm engineering} }
Holger Dell, Christian Komusiewicz, Nimrod Talmon, and Mathias Weller. The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 30:1-30:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dell_et_al:LIPIcs.IPEC.2017.30, author = {Dell, Holger and Komusiewicz, Christian and Talmon, Nimrod and Weller, Mathias}, title = {{The PACE 2017 Parameterized Algorithms and Computational Experiments Challenge: The Second Iteration}}, booktitle = {12th International Symposium on Parameterized and Exact Computation (IPEC 2017)}, pages = {30:1--30:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-051-4}, ISSN = {1868-8969}, year = {2018}, volume = {89}, editor = {Lokshtanov, Daniel and Nishimura, Naomi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2017.30}, URN = {urn:nbn:de:0030-drops-85582}, doi = {10.4230/LIPIcs.IPEC.2017.30}, annote = {Keywords: treewidth, minimum fill-in, contest, implementation challenge, FPT} }