@Proceedings{misra_et_al:LIPIcs.IPEC.2023,
title = {{LIPIcs, Volume 285, IPEC 2023, Complete Volume}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {1--644},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023},
URN = {urn:nbn:de:0030-drops-194183},
doi = {10.4230/LIPIcs.IPEC.2023},
annote = {Keywords: LIPIcs, Volume 285, IPEC 2023, Complete Volume}
}
@InProceedings{misra_et_al:LIPIcs.IPEC.2023.0,
author = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.0},
URN = {urn:nbn:de:0030-drops-194191},
doi = {10.4230/LIPIcs.IPEC.2023.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{arrighi_et_al:LIPIcs.IPEC.2023.1,
author = {Arrighi, Emmanuel and Fomin, Fedor V. and Golovach, Petr A. and Wolf, Petra},
title = {{Kernelizing Temporal Exploration Problems}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {1:1--1:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.1},
URN = {urn:nbn:de:0030-drops-194201},
doi = {10.4230/LIPIcs.IPEC.2023.1},
annote = {Keywords: Temporal graph, temporal exploration, computational complexity, kernel}
}
@InProceedings{arrighi_et_al:LIPIcs.IPEC.2023.2,
author = {Arrighi, Emmanuel and Bentert, Matthias and Drange, P\r{a}l Gr{\o}n\r{a}s and Sullivan, Blair D. and Wolf, Petra},
title = {{Cluster Editing with Overlapping Communities}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {2:1--2:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.2},
URN = {urn:nbn:de:0030-drops-194218},
doi = {10.4230/LIPIcs.IPEC.2023.2},
annote = {Keywords: graph modification, correlation clustering, vertex splitting, NP-hardness, parameterized algorithm}
}
@InProceedings{bannach_et_al:LIPIcs.IPEC.2023.3,
author = {Bannach, Max and Chudigiewitsch, Florian and Tantau, Till},
title = {{Existential Second-Order Logic over Graphs: Parameterized Complexity}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.3},
URN = {urn:nbn:de:0030-drops-194224},
doi = {10.4230/LIPIcs.IPEC.2023.3},
annote = {Keywords: existential second-order logic, graph problems, parallel algorithms, fixed-parameter tractability, descriptive complexity}
}
@InProceedings{bentert_et_al:LIPIcs.IPEC.2023.4,
author = {Bentert, Matthias and Schestag, Jannik and Sommer, Frank},
title = {{On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {4:1--4:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.4},
URN = {urn:nbn:de:0030-drops-194232},
doi = {10.4230/LIPIcs.IPEC.2023.4},
annote = {Keywords: Flexible graph connectivity, NP-hard problem, parameterized complexity, below-guarantee parameterization, treewidth}
}
@InProceedings{bhyravarapu_et_al:LIPIcs.IPEC.2023.5,
author = {Bhyravarapu, Sriram and Jana, Satyabrata and Saurabh, Saket and Sharma, Roohani},
title = {{Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.5},
URN = {urn:nbn:de:0030-drops-194241},
doi = {10.4230/LIPIcs.IPEC.2023.5},
annote = {Keywords: Kernelization, Component Order Connectivity, Vertex Cover, Structural Parameterizations}
}
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2023.6,
author = {Bodlaender, Hans L. and Mannens, Isja and Oostveen, Jelle J. and Pandey, Sukanya and van Leeuwen, Erik Jan},
title = {{The Parameterised Complexity Of Integer Multicommodity Flow}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {6:1--6:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.6},
URN = {urn:nbn:de:0030-drops-194250},
doi = {10.4230/LIPIcs.IPEC.2023.6},
annote = {Keywords: multicommodity flow, parameterised complexity, XNLP-completeness, XALP-completeness}
}
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2023.7,
author = {Bodlaender, Hans L. and Bonnet, \'{E}douard and Jaffke, Lars and Knop, Du\v{s}an and Lima, Paloma T. and Milani\v{c}, Martin and Ordyniak, Sebastian and Pandey, Sukanya and Such\'{y}, Ond\v{r}ej},
title = {{Treewidth Is NP-Complete on Cubic Graphs}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {7:1--7:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.7},
URN = {urn:nbn:de:0030-drops-194263},
doi = {10.4230/LIPIcs.IPEC.2023.7},
annote = {Keywords: Treewidth, cubic graphs, degree, NP-completeness}
}
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2023.8,
author = {Bonnet, \'{E}douard and Duron, Julien},
title = {{Stretch-Width}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {8:1--8:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.8},
URN = {urn:nbn:de:0030-drops-194279},
doi = {10.4230/LIPIcs.IPEC.2023.8},
annote = {Keywords: Contraction sequences, twin-width, clique-width, algorithms, algorithmic metatheorems}
}
@InProceedings{c.m.gomes_et_al:LIPIcs.IPEC.2023.9,
author = {C. M. Gomes, Guilherme and Legrand-Duchesne, Cl\'{e}ment and Mahmoud, Reem and Mouawad, Amer E. and Okamoto, Yoshio and F. dos Santos, Vinicius and C. van der Zanden, Tom},
title = {{Minimum Separator Reconfiguration}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {9:1--9:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.9},
URN = {urn:nbn:de:0030-drops-194288},
doi = {10.4230/LIPIcs.IPEC.2023.9},
annote = {Keywords: minimum separators, combinatorial reconfiguration, parameterized complexity, kernelization}
}
@InProceedings{chaudhary_et_al:LIPIcs.IPEC.2023.10,
author = {Chaudhary, Juhi and Gahlawat, Harmender and W{\l}odarczyk, Michal and Zehavi, Meirav},
title = {{Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {10:1--10:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.10},
URN = {urn:nbn:de:0030-drops-194296},
doi = {10.4230/LIPIcs.IPEC.2023.10},
annote = {Keywords: Kernelization, Parameterized Complexity, Vertex-Disjoint Paths Problem, Edge-Disjoint Paths Problem}
}
@InProceedings{dabrowski_et_al:LIPIcs.IPEC.2023.11,
author = {Dabrowski, Konrad K. and Jonsson, Peter and Ordyniak, Sebastian and Osipov, George and Pilipczuk, Marcin and Sharma, Roohani},
title = {{Parameterized Complexity Classification for Interval Constraints}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {11:1--11:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.11},
URN = {urn:nbn:de:0030-drops-194306},
doi = {10.4230/LIPIcs.IPEC.2023.11},
annote = {Keywords: (minimum) constraint satisfaction problem, Allen’s interval algebra, parameterized complexity, cut problems}
}
@InProceedings{dondi_et_al:LIPIcs.IPEC.2023.12,
author = {Dondi, Riccardo and Lafond, Manuel},
title = {{An FPT Algorithm for Temporal Graph Untangling}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.12},
URN = {urn:nbn:de:0030-drops-194311},
doi = {10.4230/LIPIcs.IPEC.2023.12},
annote = {Keywords: Temporal Graphs, Vertex Cover, Graph Algorithms, Parameterized Complexity}
}
@InProceedings{doronarad_et_al:LIPIcs.IPEC.2023.13,
author = {Doron-Arad, Ilan and Kulik, Ariel and Shachnai, Hadas},
title = {{Budgeted Matroid Maximization: a Parameterized Viewpoint}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.13},
URN = {urn:nbn:de:0030-drops-194329},
doi = {10.4230/LIPIcs.IPEC.2023.13},
annote = {Keywords: budgeted matching, budgeted matroid intersection, knapsack problems, FPT-approximation scheme}
}
@InProceedings{drange_et_al:LIPIcs.IPEC.2023.14,
author = {Drange, P\r{a}l Gr{\o}n\r{a}s and Greaves, Patrick and Muzi, Irene and Reidl, Felix},
title = {{Computing Complexity Measures of Degenerate Graphs}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {14:1--14:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.14},
URN = {urn:nbn:de:0030-drops-194333},
doi = {10.4230/LIPIcs.IPEC.2023.14},
annote = {Keywords: vc-dimension, datastructure, degeneracy, enumerating}
}
@InProceedings{dumas_et_al:LIPIcs.IPEC.2023.15,
author = {Dumas, Ma\"{e}l and Perez, Anthony},
title = {{An Improved Kernelization Algorithm for Trivially Perfect Editing}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {15:1--15:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.15},
URN = {urn:nbn:de:0030-drops-194340},
doi = {10.4230/LIPIcs.IPEC.2023.15},
annote = {Keywords: Parameterized complexity, kernelization algorithms, graph modification, trivially perfect graphs}
}
@InProceedings{eiben_et_al:LIPIcs.IPEC.2023.16,
author = {Eiben, Eduard and Ganian, Robert and Kanj, Iyad and Ordyniak, Sebastian and Szeider, Stefan},
title = {{From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {16:1--16:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.16},
URN = {urn:nbn:de:0030-drops-194357},
doi = {10.4230/LIPIcs.IPEC.2023.16},
annote = {Keywords: Independent Set, Powers of Hypercubes, Diversity, Parameterized Complexity, Incomplete Data}
}
@InProceedings{esmer_et_al:LIPIcs.IPEC.2023.17,
author = {Esmer, Bar{\i}\c{s} Can and Kulik, Ariel and Marx, D\'{a}niel and Neuen, Daniel and Sharma, Roohani},
title = {{Approximate Monotone Local Search for Weighted Problems}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {17:1--17:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.17},
URN = {urn:nbn:de:0030-drops-194360},
doi = {10.4230/LIPIcs.IPEC.2023.17},
annote = {Keywords: parameterized approximations, exponential approximations, monotone local search}
}
@InProceedings{ganian_et_al:LIPIcs.IPEC.2023.18,
author = {Ganian, Robert and Khazaliya, Liana and Simonov, Kirill},
title = {{Consistency Checking Problems: A Gateway to Parameterized Sample Complexity}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {18:1--18:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.18},
URN = {urn:nbn:de:0030-drops-194374},
doi = {10.4230/LIPIcs.IPEC.2023.18},
annote = {Keywords: consistency checking, sample complexity, fixed-parameter tractability}
}
@InProceedings{garvardt_et_al:LIPIcs.IPEC.2023.19,
author = {Garvardt, Jaroslav and Renken, Malte and Schestag, Jannik and Weller, Mathias},
title = {{Finding Degree-Constrained Acyclic Orientations}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.19},
URN = {urn:nbn:de:0030-drops-194383},
doi = {10.4230/LIPIcs.IPEC.2023.19},
annote = {Keywords: Graph Orientation, Phylogenetic Networks, General Factor, NP-hardness, Parameterized Algorithms, Treewidth}
}
@InProceedings{garvardt_et_al:LIPIcs.IPEC.2023.20,
author = {Garvardt, Jaroslav and Morawietz, Nils and Nichterlein, Andr\'{e} and Weller, Mathias},
title = {{Graph Clustering Problems Under the Lens of Parameterized Local Search}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.20},
URN = {urn:nbn:de:0030-drops-194391},
doi = {10.4230/LIPIcs.IPEC.2023.20},
annote = {Keywords: parameterized local search, permissive local search, FPT, W\lbrack1\rbrack-hardness}
}
@InProceedings{gima_et_al:LIPIcs.IPEC.2023.21,
author = {Gima, Tatsuya and Kim, Eun Jung and K\"{o}hler, Noleen and Melissinos, Nikolaos and Vasilakis, Manolis},
title = {{Bandwidth Parameterized by Cluster Vertex Deletion Number}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.21},
URN = {urn:nbn:de:0030-drops-194401},
doi = {10.4230/LIPIcs.IPEC.2023.21},
annote = {Keywords: Bandwidth, Clique number, Cluster vertex deletion number, Parameterized complexity}
}
@InProceedings{gupta_et_al:LIPIcs.IPEC.2023.22,
author = {Gupta, Siddharth and Sa'ar, Guy and Zehavi, Meirav},
title = {{Collective Graph Exploration Parameterized by Vertex Cover}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {22:1--22:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.22},
URN = {urn:nbn:de:0030-drops-194413},
doi = {10.4230/LIPIcs.IPEC.2023.22},
annote = {Keywords: Collective Graph Exploration, Parameterized Complexity, Approximation Algorithm, Vertex Cover, Treedepth}
}
@InProceedings{gupta_et_al:LIPIcs.IPEC.2023.23,
author = {Gupta, Siddharth and Sa'ar, Guy and Zehavi, Meirav},
title = {{Drawn Tree Decomposition: New Approach for Graph Drawing Problems}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {23:1--23:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.23},
URN = {urn:nbn:de:0030-drops-194424},
doi = {10.4230/LIPIcs.IPEC.2023.23},
annote = {Keywords: Graph Drawing, Parameterized Complexity, Tree decomposition}
}
@InProceedings{heeger_et_al:LIPIcs.IPEC.2023.24,
author = {Heeger, Klaus and Hermelin, Danny and Shabtay, Dvir},
title = {{Single Machine Scheduling with Few Deadlines}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.24},
URN = {urn:nbn:de:0030-drops-194434},
doi = {10.4230/LIPIcs.IPEC.2023.24},
annote = {Keywords: Single-machine scheduling, weighted completion time, tardy jobs, pseudopolynomial algorithms, parameterized complexity}
}
@InProceedings{heinrich_et_al:LIPIcs.IPEC.2023.25,
author = {Heinrich, Irene and Ra{\ss}mann, Simon},
title = {{Twin-Width of Graphs with Tree-Structured Decompositions}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.25},
URN = {urn:nbn:de:0030-drops-194449},
doi = {10.4230/LIPIcs.IPEC.2023.25},
annote = {Keywords: twin-width, quasi-4 connected components, strong tree-width}
}
@InProceedings{jaffke_et_al:LIPIcs.IPEC.2023.26,
author = {Jaffke, Lars and Morelle, Laure and Sau, Ignasi and Thilikos, Dimitrios M.},
title = {{Dynamic Programming on Bipartite Tree Decompositions}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {26:1--26:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.26},
URN = {urn:nbn:de:0030-drops-194455},
doi = {10.4230/LIPIcs.IPEC.2023.26},
annote = {Keywords: tree decomposition, bipartite graphs, dynamic programming, odd-minors, packing, maximum cut, vertex cover, independent set, odd cycle transversal}
}
@InProceedings{jansen_et_al:LIPIcs.IPEC.2023.27,
author = {Jansen, Bart M. P. and van der Steenhoven, Bart},
title = {{Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {27:1--27:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.27},
URN = {urn:nbn:de:0030-drops-194466},
doi = {10.4230/LIPIcs.IPEC.2023.27},
annote = {Keywords: kernelization, counting problems, feedback vertex set, dominating set, protrusion decomposition}
}
@InProceedings{jansen_et_al:LIPIcs.IPEC.2023.28,
author = {Jansen, Bart M. P. and Roy, Shivesh K.},
title = {{On the Parameterized Complexity of Multiway Near-Separator}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {28:1--28:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.28},
URN = {urn:nbn:de:0030-drops-194470},
doi = {10.4230/LIPIcs.IPEC.2023.28},
annote = {Keywords: fixed-parameter tractability, multiway cut, near-separator}
}
@InProceedings{jansen_et_al:LIPIcs.IPEC.2023.29,
author = {Jansen, Bart M. P. and Roy, Shivesh K.},
title = {{Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.29},
URN = {urn:nbn:de:0030-drops-194488},
doi = {10.4230/LIPIcs.IPEC.2023.29},
annote = {Keywords: kernelization, weighted problems, graph packing, sunflower lemma, bounded expansion, nowhere dense}
}
@InProceedings{jones_et_al:LIPIcs.IPEC.2023.30,
author = {Jones, Mark and Schestag, Jannik},
title = {{How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {30:1--30:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.30},
URN = {urn:nbn:de:0030-drops-194496},
doi = {10.4230/LIPIcs.IPEC.2023.30},
annote = {Keywords: Phylogenetic Networks, Phylogenetic Diversity, Parameterized Complexity, W-hierarchy, FPT algorithms}
}
@InProceedings{koutis_et_al:LIPIcs.IPEC.2023.31,
author = {Koutis, Ioannis and W{\l}odarczyk, Micha{\l} and Zehavi, Meirav},
title = {{Sidestepping Barriers for Dominating Set in Parameterized Complexity}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {31:1--31:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.31},
URN = {urn:nbn:de:0030-drops-194506},
doi = {10.4230/LIPIcs.IPEC.2023.31},
annote = {Keywords: Dominating Set, Parameterized Complexity, Approximation Algorithms}
}
@InProceedings{kratsch_et_al:LIPIcs.IPEC.2023.32,
author = {Kratsch, Stefan and Kunz, Pascal},
title = {{Approximate Turing Kernelization and Lower Bounds for Domination Problems}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {32:1--32:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.32},
URN = {urn:nbn:de:0030-drops-194516},
doi = {10.4230/LIPIcs.IPEC.2023.32},
annote = {Keywords: Approximate Turing kernelization, approximation lower bounds, exponential-time hypothesis, dominating set, capacitated dominating, connected dominating set, independent dominating set, treewidth, vertex cover number}
}
@InProceedings{mari_et_al:LIPIcs.IPEC.2023.33,
author = {Mari, Mathieu and Picavet, Timoth\'{e} and Pilipczuk, Micha{\l}},
title = {{A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {33:1--33:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.33},
URN = {urn:nbn:de:0030-drops-194529},
doi = {10.4230/LIPIcs.IPEC.2023.33},
annote = {Keywords: Parameterized complexity, Approximation scheme, Geometric knapsack, Color coding, Dynamic programming, Computational geometry}
}
@InProceedings{tamaki:LIPIcs.IPEC.2023.34,
author = {Tamaki, Hisao},
title = {{A Contraction-Recursive Algorithm for Treewidth}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {34:1--34:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.34},
URN = {urn:nbn:de:0030-drops-194536},
doi = {10.4230/LIPIcs.IPEC.2023.34},
annote = {Keywords: graph algorithm, treewidth, exact computation, BT dynamic programming, contraction, certifying algorithms}
}
@InProceedings{bannach_et_al:LIPIcs.IPEC.2023.35,
author = {Bannach, Max and Berndt, Sebastian},
title = {{PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {35:1--35:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.35},
URN = {urn:nbn:de:0030-drops-194548},
doi = {10.4230/LIPIcs.IPEC.2023.35},
annote = {Keywords: Twinwidth, Algorithm Engineering, FPT, Kernelization}
}
@InProceedings{mizutani_et_al:LIPIcs.IPEC.2023.36,
author = {Mizutani, Yosuke and Dursteler, David and Sullivan, Blair D.},
title = {{PACE Solver Description: Hydra Prime}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {36:1--36:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.36},
URN = {urn:nbn:de:0030-drops-194552},
doi = {10.4230/LIPIcs.IPEC.2023.36},
annote = {Keywords: Twin-width, PACE 2023}
}
@InProceedings{leonhardt_et_al:LIPIcs.IPEC.2023.37,
author = {Leonhardt, Alexander and Dell, Holger and Haak, Anselm and Kammer, Frank and Meintrup, Johannes and Meyer, Ulrich and Penschuck, Manuel},
title = {{PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM)}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {37:1--37:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.37},
URN = {urn:nbn:de:0030-drops-194563},
doi = {10.4230/LIPIcs.IPEC.2023.37},
annote = {Keywords: PACE 2023 Challenge, Heuristic, Exact, Twin-Width}
}
@InProceedings{berthe_et_al:LIPIcs.IPEC.2023.38,
author = {Berthe, Ga\'{e}tan and Coudert-Osmont, Yoann and Dobler, Alexander and Morelle, Laure and Reinald, Amadeus and Rocton, Mathis},
title = {{PACE Solver Description: Touiouidth}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {38:1--38:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.38},
URN = {urn:nbn:de:0030-drops-194576},
doi = {10.4230/LIPIcs.IPEC.2023.38},
annote = {Keywords: Twinwidth, Pace Challenge}
}
@InProceedings{arrighi_et_al:LIPIcs.IPEC.2023.39,
author = {Arrighi, Emmanuel and Drange, P\r{a}l Gr{\o}n\r{a}s and Langedal, Kenneth and Vadiee, Farhad and Vatshelle, Martin and Wolf, Petra},
title = {{PACE Solver Description: Zygosity}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {39:1--39:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.39},
URN = {urn:nbn:de:0030-drops-194583},
doi = {10.4230/LIPIcs.IPEC.2023.39},
annote = {Keywords: Twin-width, randomized greedy algorithm}
}
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2023.40,
author = {Bonnet, \'{E}douard and Duron, Julien},
title = {{PACE Solver Description: RedAlert - Heuristic Track}},
booktitle = {18th International Symposium on Parameterized and Exact Computation (IPEC 2023)},
pages = {40:1--40:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-305-8},
ISSN = {1868-8969},
year = {2023},
volume = {285},
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.40},
URN = {urn:nbn:de:0030-drops-194591},
doi = {10.4230/LIPIcs.IPEC.2023.40},
annote = {Keywords: twin-width, contraction sequences, heuristic, pair sampling, pair filtering}
}
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