LIPIcs, Volume 249
IPEC 2022, September 7-9, 2022, Potsdam, Germany
Editors: Holger Dell and Jesper Nederlof
Published in: LIPIcs, Volume 285, 18th International Symposium on Parameterized and Exact Computation (IPEC 2023)
Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, and Manuel Penschuck. PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 285, pp. 37:1-37:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (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} }
Published in: LIPIcs, Volume 261, 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)
Leslie Ann Goldberg and Marc Roth. Parameterised and Fine-Grained Subgraph Counting, Modulo 2. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 261, pp. 68:1-68:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{goldberg_et_al:LIPIcs.ICALP.2023.68, author = {Goldberg, Leslie Ann and Roth, Marc}, title = {{Parameterised and Fine-Grained Subgraph Counting, Modulo 2}}, booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)}, pages = {68:1--68:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-278-5}, ISSN = {1868-8969}, year = {2023}, volume = {261}, editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2023.68}, URN = {urn:nbn:de:0030-drops-181200}, doi = {10.4230/LIPIcs.ICALP.2023.68}, annote = {Keywords: modular counting, parameterised complexity, fine-grained complexity, subgraph counting} }
Published in: Dagstuhl Reports, Volume 12, Issue 11 (2023)
Holger Dell, Mark R. Jerrum, Haiko Müller, Konrad Anand, and Marcus Pappik. Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482). In Dagstuhl Reports, Volume 12, Issue 11, pp. 124-145, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@Article{dell_et_al:DagRep.12.11.124, author = {Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus}, title = {{Counting and Sampling: Algorithms and Complexity (Dagstuhl Seminar 22482)}}, pages = {124--145}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2023}, volume = {12}, number = {11}, editor = {Dell, Holger and Jerrum, Mark R. and M\"{u}ller, Haiko and Anand, Konrad and Pappik, Marcus}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.11.124}, URN = {urn:nbn:de:0030-drops-178394}, doi = {10.4230/DagRep.12.11.124}, annote = {Keywords: Sampling, Counting, Algorithms, Complexity, Statistical Physics, Phase Transitions, Markov Chains, Graphs, Point Processes} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 1-520, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@Proceedings{dell_et_al:LIPIcs.IPEC.2022, title = {{LIPIcs, Volume 249, IPEC 2022, Complete Volume}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {1--520}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022}, URN = {urn:nbn:de:0030-drops-173553}, doi = {10.4230/LIPIcs.IPEC.2022}, annote = {Keywords: LIPIcs, Volume 249, IPEC 2022, Complete Volume} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{dell_et_al:LIPIcs.IPEC.2022.0, author = {Dell, Holger and Nederlof, Jesper}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.0}, URN = {urn:nbn:de:0030-drops-173562}, doi = {10.4230/LIPIcs.IPEC.2022.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Akanksha Agrawal, Saket Saurabh, and Meirav Zehavi. A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 1:1-1:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2022.1, author = {Agrawal, Akanksha and Saurabh, Saket and Zehavi, Meirav}, title = {{A Finite Algorithm for the Realizabilty of a Delaunay Triangulation}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {1:1--1:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.1}, URN = {urn:nbn:de:0030-drops-173573}, doi = {10.4230/LIPIcs.IPEC.2022.1}, annote = {Keywords: Delaunay Triangulation, Delaunay Realization, Finite Algorithm, Integer Coordinate Realization} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, and Abhishek Sahu. Parameterized Complexity of Perfectly Matched Sets. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 2:1-2:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2022.2, author = {Agrawal, Akanksha and Bhattacharjee, Sutanay and Jana, Satyabrata and Sahu, Abhishek}, title = {{Parameterized Complexity of Perfectly Matched Sets}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {2:1--2:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.2}, URN = {urn:nbn:de:0030-drops-173580}, doi = {10.4230/LIPIcs.IPEC.2022.2}, annote = {Keywords: Perfectly Matched Sets, Parameterized Complexity, Apex-minor-free graphs, d-degenerate graphs, Planar graphs, Interval Graphs} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Brage I. K. Bakkane and Lars Jaffke. On the Hardness of Generalized Domination Problems Parameterized by Mim-Width. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bakkane_et_al:LIPIcs.IPEC.2022.3, author = {Bakkane, Brage I. K. and Jaffke, Lars}, title = {{On the Hardness of Generalized Domination Problems Parameterized by Mim-Width}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {3:1--3:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.3}, URN = {urn:nbn:de:0030-drops-173597}, doi = {10.4230/LIPIcs.IPEC.2022.3}, annote = {Keywords: generalized domination, linear mim-width, W\lbrack1\rbrack-hardness, Exponential Time Hypothesis} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, and Kirill Simonov. FPT Approximation for Fair Minimum-Load Clustering. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bandyapadhyay_et_al:LIPIcs.IPEC.2022.4, author = {Bandyapadhyay, Sayan and Fomin, Fedor V. and Golovach, Petr A. and Purohit, Nidhi and Simonov, Kirill}, title = {{FPT Approximation for Fair Minimum-Load Clustering}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.4}, URN = {urn:nbn:de:0030-drops-173600}, doi = {10.4230/LIPIcs.IPEC.2022.4}, annote = {Keywords: fair clustering, load balancing, parameterized approximation} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, and Anna Zych-Pawlewicz. On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 5:1-5:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{blum_et_al:LIPIcs.IPEC.2022.5, author = {Blum, Johannes and Disser, Yann and Feldmann, Andreas Emil and Gupta, Siddharth and Zych-Pawlewicz, Anna}, title = {{On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {5:1--5:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.5}, URN = {urn:nbn:de:0030-drops-173612}, doi = {10.4230/LIPIcs.IPEC.2022.5}, annote = {Keywords: sparse hitting set, fair vertex cover, highway dimension} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, and Michał Pilipczuk. On the Complexity of Problems on Tree-Structured Graphs. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 6:1-6:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2022.6, author = {Bodlaender, Hans L. and Groenland, Carla and Jacob, Hugo and Pilipczuk, Marcin and Pilipczuk, Micha{\l}}, title = {{On the Complexity of Problems on Tree-Structured Graphs}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {6:1--6:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.6}, URN = {urn:nbn:de:0030-drops-173626}, doi = {10.4230/LIPIcs.IPEC.2022.6}, annote = {Keywords: Parameterized Complexity, Treewidth, XALP, XNLP} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Hans L. Bodlaender, Carla Groenland, and Hugo Jacob. On the Parameterized Complexity of Computing Tree-Partitions. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 7:1-7:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2022.7, author = {Bodlaender, Hans L. and Groenland, Carla and Jacob, Hugo}, title = {{On the Parameterized Complexity of Computing Tree-Partitions}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {7:1--7:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.7}, URN = {urn:nbn:de:0030-drops-173633}, doi = {10.4230/LIPIcs.IPEC.2022.7}, annote = {Keywords: Parameterized algorithms, Tree partitions, tree-partition-width, Treewidth, Domino Treewidth, Approximation Algorithms, Parameterized Complexity} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, and Paloma T. Lima. XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2022.8, author = {Bodlaender, Hans L. and Groenland, Carla and Jacob, Hugo and Jaffke, Lars and Lima, Paloma T.}, title = {{XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.8}, URN = {urn:nbn:de:0030-drops-173640}, doi = {10.4230/LIPIcs.IPEC.2022.8}, annote = {Keywords: parameterized complexity, XNLP, linear clique-width, W-hierarchy, pathwidth, linear mim-width, bandwidth} }
Published in: LIPIcs, Volume 249, 17th International Symposium on Parameterized and Exact Computation (IPEC 2022)
Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, and Stéphan Thomassé. Twin-Width VIII: Delineation and Win-Wins. In 17th International Symposium on Parameterized and Exact Computation (IPEC 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 249, pp. 9:1-9:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2022.9, author = {Bonnet, \'{E}douard and Chakraborty, Dibyayan and Kim, Eun Jung and K\"{o}hler, Noleen and Lopes, Raul and Thomass\'{e}, St\'{e}phan}, title = {{Twin-Width VIII: Delineation and Win-Wins}}, booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)}, pages = {9:1--9:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-260-0}, ISSN = {1868-8969}, year = {2022}, volume = {249}, editor = {Dell, Holger and Nederlof, Jesper}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2022.9}, URN = {urn:nbn:de:0030-drops-173650}, doi = {10.4230/LIPIcs.IPEC.2022.9}, annote = {Keywords: Twin-width, intersection graphs, visibility graphs, monadic dependence and stability, first-order model checking} }
Feedback for Dagstuhl Publishing