@Proceedings{cao_et_al:LIPIcs.IPEC.2020,
title = {{LIPIcs, Volume 180, IPEC 2020, Complete Volume}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {1--498},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020},
URN = {urn:nbn:de:0030-drops-133022},
doi = {10.4230/LIPIcs.IPEC.2020},
annote = {Keywords: LIPIcs, Volume 180, IPEC 2020, Complete Volume}
}
@InProceedings{cao_et_al:LIPIcs.IPEC.2020.0,
author = {Cao, Yixin and Pilipczuk, Marcin},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.0},
URN = {urn:nbn:de:0030-drops-133035},
doi = {10.4230/LIPIcs.IPEC.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2020.1,
author = {Agrawal, Akanksha and Ramanujan, M. S.},
title = {{On the Parameterized Complexity of Clique Elimination Distance}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {1:1--1:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.1},
URN = {urn:nbn:de:0030-drops-133043},
doi = {10.4230/LIPIcs.IPEC.2020.1},
annote = {Keywords: Elimination Distance, Cluster Graphs, Kernelization}
}
@InProceedings{bangjensen_et_al:LIPIcs.IPEC.2020.2,
author = {Bang-Jensen, J{\o}rgen and Eiben, Eduard and Gutin, Gregory and Wahlstr\"{o}m, Magnus and Yeo, Anders},
title = {{Component Order Connectivity in Directed Graphs}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {2:1--2:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.2},
URN = {urn:nbn:de:0030-drops-133058},
doi = {10.4230/LIPIcs.IPEC.2020.2},
annote = {Keywords: Parameterized Algorithms, component order connectivity, directed graphs, semicomplete digraphs}
}
@InProceedings{bergougnoux_et_al:LIPIcs.IPEC.2020.3,
author = {Bergougnoux, Benjamin and Bonnet, \'{E}douard and Brettell, Nick and Kwon, O-joung},
title = {{Close Relatives of Feedback Vertex Set Without Single-Exponential Algorithms Parameterized by Treewidth}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {3:1--3:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.3},
URN = {urn:nbn:de:0030-drops-133066},
doi = {10.4230/LIPIcs.IPEC.2020.3},
annote = {Keywords: Subset Feedback Vertex Set, Multiway Cut, Parameterized Algorithms, Treewidth, Graph Modification, Vertex Deletion Problems}
}
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2020.4,
author = {Bodlaender, Hans L. and van der Wegen, Marieke},
title = {{Parameterized Complexity of Scheduling Chains of Jobs with Delays}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.4},
URN = {urn:nbn:de:0030-drops-133075},
doi = {10.4230/LIPIcs.IPEC.2020.4},
annote = {Keywords: Scheduling, parameterized complexity}
}
@InProceedings{bozyk_et_al:LIPIcs.IPEC.2020.5,
author = {Bo\.{z}yk, {\L}ukasz and Derbisz, Jan and Krawczyk, Tomasz and Novotn\'{a}, Jana and Okrasa, Karolina},
title = {{Vertex Deletion into Bipartite Permutation Graphs}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.5},
URN = {urn:nbn:de:0030-drops-133087},
doi = {10.4230/LIPIcs.IPEC.2020.5},
annote = {Keywords: permutation graphs, comparability graphs, partially ordered set, graph modification problems}
}
@InProceedings{brettell_et_al:LIPIcs.IPEC.2020.6,
author = {Brettell, Nick and Horsfield, Jake and Munaro, Andrea and Paesani, Giacomo and Paulusma, Dani\"{e}l},
title = {{Bounding the Mim-Width of Hereditary Graph Classes}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {6:1--6:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.6},
URN = {urn:nbn:de:0030-drops-133099},
doi = {10.4230/LIPIcs.IPEC.2020.6},
annote = {Keywords: Width parameter, mim-width, clique-width, hereditary graph class}
}
@InProceedings{chandrasekaran_et_al:LIPIcs.IPEC.2020.7,
author = {Chandrasekaran, Karthekeyan and Grigorescu, Elena and Istrate, Gabriel and Kulkarni, Shubhang and Lin, Young-San and Zhu, Minshen},
title = {{Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.7},
URN = {urn:nbn:de:0030-drops-133102},
doi = {10.4230/LIPIcs.IPEC.2020.7},
annote = {Keywords: maximum binary tree, heapability, permutation directed acyclic graphs}
}
@InProceedings{chaplick_et_al:LIPIcs.IPEC.2020.8,
author = {Chaplick, Steven and Golovach, Petr A. and Hartmann, Tim A. and Knop, Du\v{s}an},
title = {{Recognizing Proper Tree-Graphs}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.8},
URN = {urn:nbn:de:0030-drops-133118},
doi = {10.4230/LIPIcs.IPEC.2020.8},
annote = {Keywords: intersection graphs, H-graphs, recognition, fixed-parameter tractability}
}
@InProceedings{dublois_et_al:LIPIcs.IPEC.2020.9,
author = {Dublois, Louis and Lampis, Michael and Paschos, Vangelis Th.},
title = {{New Algorithms for Mixed Dominating Set}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.9},
URN = {urn:nbn:de:0030-drops-133127},
doi = {10.4230/LIPIcs.IPEC.2020.9},
annote = {Keywords: FPT Algorithms, Exact Algorithms, Mixed Domination}
}
@InProceedings{eiben_et_al:LIPIcs.IPEC.2020.10,
author = {Eiben, Eduard and Lochet, William and Saurabh, Saket},
title = {{A Polynomial Kernel for Paw-Free Editing}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.10},
URN = {urn:nbn:de:0030-drops-133136},
doi = {10.4230/LIPIcs.IPEC.2020.10},
annote = {Keywords: Kernelization, Paw-free graph, H-free editing, graph modification problem}
}
@InProceedings{einarson_et_al:LIPIcs.IPEC.2020.11,
author = {Einarson, Carl and Reidl, Felix},
title = {{A General Kernelization Technique for Domination and Independence Problems in Sparse Classes}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.11},
URN = {urn:nbn:de:0030-drops-133142},
doi = {10.4230/LIPIcs.IPEC.2020.11},
annote = {Keywords: Dominating Set, Independence, Kernelization, Bounded Expansion}
}
@InProceedings{fomin_et_al:LIPIcs.IPEC.2020.12,
author = {Fomin, Fedor V. and Golovach, Petr A. and Lochet, William and Misra, Pranabendu and Saurabh, Saket and Sharma, Roohani},
title = {{Parameterized Complexity of Directed Spanner Problems}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {12:1--12:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.12},
URN = {urn:nbn:de:0030-drops-133156},
doi = {10.4230/LIPIcs.IPEC.2020.12},
annote = {Keywords: Graph spanners, directed graphs, parameterized complexity, kernelization}
}
@InProceedings{garletmilani:LIPIcs.IPEC.2020.13,
author = {Garlet Milani, Marcelo},
title = {{A Polynomial Kernel for Funnel Arc Deletion Set}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {13:1--13:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.13},
URN = {urn:nbn:de:0030-drops-133163},
doi = {10.4230/LIPIcs.IPEC.2020.13},
annote = {Keywords: graph editing, directed feedback arc set, parameterized algorithm, kernels, funnels}
}
@InProceedings{goyal_et_al:LIPIcs.IPEC.2020.14,
author = {Goyal, Dishant and Jaiswal, Ragesh and Kumar, Amit},
title = {{FPT Approximation for Constrained Metric k-Median/Means}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {14:1--14:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.14},
URN = {urn:nbn:de:0030-drops-133170},
doi = {10.4230/LIPIcs.IPEC.2020.14},
annote = {Keywords: k-means, k-median, approximation algorithms, parameterised algorithms}
}
@InProceedings{hatanaka_et_al:LIPIcs.IPEC.2020.15,
author = {Hatanaka, Tatsuhiko and Hommelsheim, Felix and Ito, Takehiro and Kobayashi, Yusuke and M\"{u}hlenthaler, Moritz and Suzuki, Akira},
title = {{Fixed-Parameter Algorithms for Graph Constraint Logic}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.15},
URN = {urn:nbn:de:0030-drops-133182},
doi = {10.4230/LIPIcs.IPEC.2020.15},
annote = {Keywords: Combinatorial Reconfiguration, Nondeterministic Constraint Logic, Fixed Parameter Tractability}
}
@InProceedings{husek_et_al:LIPIcs.IPEC.2020.16,
author = {Hu\v{s}ek, Radek and Knop, Du\v{s}an and Masa\v{r}k, Tom\'{a}\v{s}},
title = {{Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {16:1--16:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.16},
URN = {urn:nbn:de:0030-drops-133193},
doi = {10.4230/LIPIcs.IPEC.2020.16},
annote = {Keywords: Steiner tree, approximation, star contractions, minimum spanning tree}
}
@InProceedings{feldmann_et_al:LIPIcs.IPEC.2020.17,
author = {Feldmann, Andreas Emil and Issac, Davis and Rai, Ashutosh},
title = {{Fixed-Parameter Tractability of the Weighted Edge Clique Partition Problem}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.17},
URN = {urn:nbn:de:0030-drops-133206},
doi = {10.4230/LIPIcs.IPEC.2020.17},
annote = {Keywords: Edge Clique Partition, fixed-parameter tractability, kernelization}
}
@InProceedings{jacob_et_al:LIPIcs.IPEC.2020.18,
author = {Jacob, Ashwin and Majumdar, Diptapriyo and Raman, Venkatesh},
title = {{Parameterized Complexity of Deletion to Scattered Graph Classes}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.18},
URN = {urn:nbn:de:0030-drops-133210},
doi = {10.4230/LIPIcs.IPEC.2020.18},
annote = {Keywords: Parameterized Complexity, Scattered Graph Classes, Important Separators}
}
@InProceedings{jacob_et_al:LIPIcs.IPEC.2020.19,
author = {Jacob, Ashwin and Panolan, Fahad and Raman, Venkatesh and Sahlot, Vibha},
title = {{Structural Parameterizations with Modulator Oblivion}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {19:1--19:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.19},
URN = {urn:nbn:de:0030-drops-133222},
doi = {10.4230/LIPIcs.IPEC.2020.19},
annote = {Keywords: Parameterized Complexity, Chordal Graph, Tree Decomposition, Strong Exponential Time Hypothesis}
}
@InProceedings{kellerhals_et_al:LIPIcs.IPEC.2020.20,
author = {Kellerhals, Leon and Koana, Tomohiro},
title = {{Parameterized Complexity of Geodetic Set}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.20},
URN = {urn:nbn:de:0030-drops-133237},
doi = {10.4230/LIPIcs.IPEC.2020.20},
annote = {Keywords: NP-hard graph problems, Shortest paths, Tree-likeness, Parameter hierarchy, Data reduction, Integer linear programming}
}
@InProceedings{kobayashi_et_al:LIPIcs.IPEC.2020.21,
author = {Kobayashi, Yasuaki and Otachi, Yota},
title = {{Parameterized Complexity of Graph Burning}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {21:1--21:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.21},
URN = {urn:nbn:de:0030-drops-133241},
doi = {10.4230/LIPIcs.IPEC.2020.21},
annote = {Keywords: Graph burning, parameterized complexity, fixed-parameter tractability}
}
@InProceedings{korhonen:LIPIcs.IPEC.2020.22,
author = {Korhonen, Tuukka},
title = {{Finding Optimal Triangulations Parameterized by Edge Clique Cover}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.22},
URN = {urn:nbn:de:0030-drops-133253},
doi = {10.4230/LIPIcs.IPEC.2020.22},
annote = {Keywords: Treewidth, Minimum fill-in, Perfect phylogeny, Fractional hypertreewidth, Potential maximal cliques, Edge clique cover}
}
@InProceedings{kowalik_et_al:LIPIcs.IPEC.2020.23,
author = {Kowalik, {\L}ukasz and Majewski, Konrad},
title = {{The Asymmetric Travelling Salesman Problem In Sparse Digraphs}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {23:1--23:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.23},
URN = {urn:nbn:de:0030-drops-133269},
doi = {10.4230/LIPIcs.IPEC.2020.23},
annote = {Keywords: asymmetric traveling salesman problem, Hamiltonian cycle, sparse graphs, exponential algorithm}
}
@InProceedings{lokshtanov_et_al:LIPIcs.IPEC.2020.24,
author = {Lokshtanov, Daniel and Mouawad, Amer E. and Panolan, Fahad and Siebertz, Sebastian},
title = {{On the Parameterized Complexity of Reconfiguration of Connected Dominating Sets}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.24},
URN = {urn:nbn:de:0030-drops-133276},
doi = {10.4230/LIPIcs.IPEC.2020.24},
annote = {Keywords: reconfiguration, parameterized complexity, connected dominating set, graph structure theory}
}
@InProceedings{nederlof_et_al:LIPIcs.IPEC.2020.25,
author = {Nederlof, Jesper and Swennenhuis, C\'{e}line M. F.},
title = {{On the Fine-Grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.25},
URN = {urn:nbn:de:0030-drops-133287},
doi = {10.4230/LIPIcs.IPEC.2020.25},
annote = {Keywords: Fixed-Parameter Tractability, Scheduling, Precedence Constraints}
}
@InProceedings{saurabh_et_al:LIPIcs.IPEC.2020.26,
author = {Saurabh, Saket and Tale, Prafullkumar},
title = {{On the Parameterized Complexity of Maximum Degree Contraction Problem}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {26:1--26:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.26},
URN = {urn:nbn:de:0030-drops-133297},
doi = {10.4230/LIPIcs.IPEC.2020.26},
annote = {Keywords: Graph Contraction Problems, FPT Algorithm, Lower Bound, ETH, No Polynomial Kernel}
}
@InProceedings{bannach_et_al:LIPIcs.IPEC.2020.27,
author = {Bannach, Max and Berndt, Sebastian and Schuster, Martin and Wien\"{o}bst, Marcel},
title = {{PACE Solver Description: Fluid}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {27:1--27:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.27},
URN = {urn:nbn:de:0030-drops-133300},
doi = {10.4230/LIPIcs.IPEC.2020.27},
annote = {Keywords: treedepth, heuristics}
}
@InProceedings{bannach_et_al:LIPIcs.IPEC.2020.28,
author = {Bannach, Max and Berndt, Sebastian and Schuster, Martin and Wien\"{o}bst, Marcel},
title = {{PACE Solver Description: PID^⋆}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {28:1--28:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.28},
URN = {urn:nbn:de:0030-drops-133312},
doi = {10.4230/LIPIcs.IPEC.2020.28},
annote = {Keywords: treedepth, positive-instance driven}
}
@InProceedings{brokkelkamp_et_al:LIPIcs.IPEC.2020.29,
author = {Brokkelkamp, Ruben and van Veneti\"{e}, Raymond and de Vries, Mees and Westerdiep, Jan},
title = {{PACE Solver Description: tdULL}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {29:1--29:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.29},
URN = {urn:nbn:de:0030-drops-133326},
doi = {10.4230/LIPIcs.IPEC.2020.29},
annote = {Keywords: PACE 2020, treedepth, treedepth decomposition, vertex ranking, minimal separators, branch and bound}
}
@InProceedings{korhonen:LIPIcs.IPEC.2020.30,
author = {Korhonen, Tuukka},
title = {{PACE Solver Description: SMS}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {30:1--30:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.30},
URN = {urn:nbn:de:0030-drops-133338},
doi = {10.4230/LIPIcs.IPEC.2020.30},
annote = {Keywords: Treedepth, PACE 2020, SMS, Minimal separators}
}
@InProceedings{xu_et_al:LIPIcs.IPEC.2020.31,
author = {Xu, Zijian and Mao, Dejun and Suppakitpaisarn, Vorapong},
title = {{PACE Solver Description: Computing Exact Treedepth via Minimal Separators}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {31:1--31:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.31},
URN = {urn:nbn:de:0030-drops-133340},
doi = {10.4230/LIPIcs.IPEC.2020.31},
annote = {Keywords: Treedepth, Minimal Separators, Experimental Algorithm}
}
@InProceedings{strasser:LIPIcs.IPEC.2020.32,
author = {Strasser, Ben},
title = {{PACE Solver Description: Tree Depth with FlowCutter}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {32:1--32:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.32},
URN = {urn:nbn:de:0030-drops-133350},
doi = {10.4230/LIPIcs.IPEC.2020.32},
annote = {Keywords: tree depth, graph algorithm, partitioning}
}
@InProceedings{swat:LIPIcs.IPEC.2020.33,
author = {Swat, Sylwester},
title = {{PACE Solver Description: Finding Elimination Trees Using ExTREEm - a Heuristic Solver for the Treedepth Decomposition Problem}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {33:1--33:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.33},
URN = {urn:nbn:de:0030-drops-133365},
doi = {10.4230/LIPIcs.IPEC.2020.33},
annote = {Keywords: Treedepth decomposition, elimination tree, separator, PACE 2020}
}
@InProceedings{trimble:LIPIcs.IPEC.2020.34,
author = {Trimble, James},
title = {{PACE Solver Description: Bute-Plus: A Bottom-Up Exact Solver for Treedepth}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {34:1--34:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.34},
URN = {urn:nbn:de:0030-drops-133371},
doi = {10.4230/LIPIcs.IPEC.2020.34},
annote = {Keywords: Treedepth, Elimination Tree, Graph Algorithms}
}
@InProceedings{trimble:LIPIcs.IPEC.2020.35,
author = {Trimble, James},
title = {{PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {35:1--35:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.35},
URN = {urn:nbn:de:0030-drops-133382},
doi = {10.4230/LIPIcs.IPEC.2020.35},
annote = {Keywords: Treedepth, Elimination Tree, Heuristics}
}
@InProceedings{wrochna:LIPIcs.IPEC.2020.36,
author = {Wrochna, Marcin},
title = {{PACE Solver Description: Sallow: A Heuristic Algorithm for Treedepth Decompositions}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {36:1--36:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.36},
URN = {urn:nbn:de:0030-drops-133391},
doi = {10.4230/LIPIcs.IPEC.2020.36},
annote = {Keywords: treedepth, decomposition, heuristic, weak colouring numbers}
}
@InProceedings{kowalik_et_al:LIPIcs.IPEC.2020.37,
author = {Kowalik, {\L}ukasz and Mucha, Marcin and Nadara, Wojciech and Pilipczuk, Marcin and Sorge, Manuel and Wygocki, Piotr},
title = {{The PACE 2020 Parameterized Algorithms and Computational Experiments Challenge: Treedepth}},
booktitle = {15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
pages = {37:1--37:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-172-6},
ISSN = {1868-8969},
year = {2020},
volume = {180},
editor = {Cao, Yixin and Pilipczuk, Marcin},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.37},
URN = {urn:nbn:de:0030-drops-133404},
doi = {10.4230/LIPIcs.IPEC.2020.37},
annote = {Keywords: computing treedepth, 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