@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@InProceedings{ducoffe:LIPIcs.IPEC.2022.10,
author = {Ducoffe, Guillaume},
title = {{Obstructions to Faster Diameter Computation: Asteroidal Sets}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {10:1--10:24},
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.10},
URN = {urn:nbn:de:0030-drops-173668},
doi = {10.4230/LIPIcs.IPEC.2022.10},
annote = {Keywords: Diameter computation, Asteroidal number, LexBFS}
}
@InProceedings{eiben_et_al:LIPIcs.IPEC.2022.11,
author = {Eiben, Eduard and Rambaud, Cl\'{e}ment and Wahlstr\"{o}m, Magnus},
title = {{On the Parameterized Complexity of Symmetric Directed Multicut}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {11:1--11: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.11},
URN = {urn:nbn:de:0030-drops-173679},
doi = {10.4230/LIPIcs.IPEC.2022.11},
annote = {Keywords: Parameterized complexity, directed graphs, graph separation problems}
}
@InProceedings{esmer_et_al:LIPIcs.IPEC.2022.12,
author = {Esmer, Bar{\i}\c{s} Can and Kulik, Ariel and Marx, D\'{a}niel and Schepper, Philipp and W\k{e}grzycki, Karol},
title = {{Computing Generalized Convolutions Faster Than Brute Force}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {12:1--12:22},
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.12},
URN = {urn:nbn:de:0030-drops-173685},
doi = {10.4230/LIPIcs.IPEC.2022.12},
annote = {Keywords: Generalized Convolution, Fast Fourier Transform, Fast Subset Convolution}
}
@InProceedings{fomin_et_al:LIPIcs.IPEC.2022.13,
author = {Fomin, Fedor V. and Golovach, Petr A. and Inamdar, Tanmay and Purohit, Nidhi and Saurabh, Saket},
title = {{Exact Exponential Algorithms for Clustering Problems}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {13:1--13: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.13},
URN = {urn:nbn:de:0030-drops-173691},
doi = {10.4230/LIPIcs.IPEC.2022.13},
annote = {Keywords: clustering, k-median, k-means, exact algorithms}
}
@InProceedings{galby_et_al:LIPIcs.IPEC.2022.14,
author = {Galby, Esther and Marx, D\'{a}niel and Schepper, Philipp and Sharma, Roohani and Tale, Prafullkumar},
title = {{Domination and Cut Problems on Chordal Graphs with Bounded Leafage}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {14:1--14:24},
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.14},
URN = {urn:nbn:de:0030-drops-173704},
doi = {10.4230/LIPIcs.IPEC.2022.14},
annote = {Keywords: Chordal Graphs, Leafage, FPT Algorithms, Dominating Set, MultiCut with Undeletable Terminals, Multiway Cut with Undeletable Terminals}
}
@InProceedings{ganian_et_al:LIPIcs.IPEC.2022.15,
author = {Ganian, Robert and Korchemna, Viktoriia},
title = {{Slim Tree-Cut Width}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {15:1--15: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.15},
URN = {urn:nbn:de:0030-drops-173714},
doi = {10.4230/LIPIcs.IPEC.2022.15},
annote = {Keywords: tree-cut width, structural parameters, graph immersions}
}
@InProceedings{haviv:LIPIcs.IPEC.2022.16,
author = {Haviv, Ishay},
title = {{A Fixed-Parameter Algorithm for the Schrijver Problem}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {16:1--16: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.16},
URN = {urn:nbn:de:0030-drops-173721},
doi = {10.4230/LIPIcs.IPEC.2022.16},
annote = {Keywords: Schrijver graph, Kneser graph, Fixed-parameter tractability}
}
@InProceedings{hegerfeld_et_al:LIPIcs.IPEC.2022.17,
author = {Hegerfeld, Falko and Kratsch, Stefan},
title = {{Towards Exact Structural Thresholds for Parameterized Complexity}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {17:1--17: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.17},
URN = {urn:nbn:de:0030-drops-173734},
doi = {10.4230/LIPIcs.IPEC.2022.17},
annote = {Keywords: Parameterized complexity, lower bound, vertex cover, odd cycle transversal, SETH, modulator, treedepth, cliquewidth}
}
@InProceedings{hermelin_et_al:LIPIcs.IPEC.2022.18,
author = {Hermelin, Danny and Itzhaki, Yuval and Molter, Hendrik and Shabtay, Dvir},
title = {{Hardness of Interval Scheduling on Unrelated Machines}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {18:1--18: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.18},
URN = {urn:nbn:de:0030-drops-173748},
doi = {10.4230/LIPIcs.IPEC.2022.18},
annote = {Keywords: Just-in-time scheduling, Parallel machines, Eligible machine sets, W\lbrack1\rbrack-hardness, NP-hardness}
}
@InProceedings{kellerhals_et_al:LIPIcs.IPEC.2022.19,
author = {Kellerhals, Leon and Koana, Tomohiro and Kunz, Pascal},
title = {{Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {19:1--19: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.19},
URN = {urn:nbn:de:0030-drops-173758},
doi = {10.4230/LIPIcs.IPEC.2022.19},
annote = {Keywords: parameterized complexity, vertex cover, feedback vertex set, above guarantee parameterization}
}
@InProceedings{komusiewicz_et_al:LIPIcs.IPEC.2022.20,
author = {Komusiewicz, Christian and Morawietz, Nils},
title = {{Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {20:1--20: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.20},
URN = {urn:nbn:de:0030-drops-173764},
doi = {10.4230/LIPIcs.IPEC.2022.20},
annote = {Keywords: Local Search, Structural parameterization, Fixed-parameter tractability}
}
@InProceedings{mallem_et_al:LIPIcs.IPEC.2022.21,
author = {Mallem, Maher and Hanen, Claire and Munier-Kordon, Alix},
title = {{Parameterized Complexity of a Parallel Machine Scheduling Problem}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {21:1--21:21},
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.21},
URN = {urn:nbn:de:0030-drops-173774},
doi = {10.4230/LIPIcs.IPEC.2022.21},
annote = {Keywords: parameterized complexity, scheduling, precedence delays, pathwidth, chains, parallel processors}
}
@InProceedings{marx_et_al:LIPIcs.IPEC.2022.22,
author = {Marx, D\'{a}niel and Sankar, Govind S. and Schepper, Philipp},
title = {{Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard)}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {22:1--22: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.22},
URN = {urn:nbn:de:0030-drops-173780},
doi = {10.4230/LIPIcs.IPEC.2022.22},
annote = {Keywords: Anti-Factor, General Factor, Treewidth, Representative Sets, SETH}
}
@InProceedings{mizutani_et_al:LIPIcs.IPEC.2022.23,
author = {Mizutani, Yosuke and Sullivan, Blair D.},
title = {{Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {23:1--23: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.23},
URN = {urn:nbn:de:0030-drops-173795},
doi = {10.4230/LIPIcs.IPEC.2022.23},
annote = {Keywords: parameterized algorithms, maximum happy set, densest k-subgraph, modular-width, clique-width, neighborhood diversity, cluster deletion number, twin cover}
}
@InProceedings{oostveen_et_al:LIPIcs.IPEC.2022.24,
author = {Oostveen, Jelle J. and van Leeuwen, Erik Jan},
title = {{Parameterized Complexity of Streaming Diameter and Connectivity Problems}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {24:1--24: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.24},
URN = {urn:nbn:de:0030-drops-173808},
doi = {10.4230/LIPIcs.IPEC.2022.24},
annote = {Keywords: Stream, Streaming, Graphs, Parameter, Complexity, Diameter, Connectivity, Vertex Cover, Disjointness, Permutation}
}
@InProceedings{schulz_et_al:LIPIcs.IPEC.2022.25,
author = {Schulz, Hjalmar and Nichterlein, Andr\'{e} and Niedermeier, Rolf and Weyand, Christopher},
title = {{Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {25:1--25: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.25},
URN = {urn:nbn:de:0030-drops-173816},
doi = {10.4230/LIPIcs.IPEC.2022.25},
annote = {Keywords: Correlation Clustering, Minimum Cut, Maximum s-t-Flow}
}
@InProceedings{gromann_et_al:LIPIcs.IPEC.2022.26,
author = {Gro{\ss}mann, Ernestine and Heuer, Tobias and Schulz, Christian and Strash, Darren},
title = {{The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {26:1--26: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.26},
URN = {urn:nbn:de:0030-drops-173826},
doi = {10.4230/LIPIcs.IPEC.2022.26},
annote = {Keywords: Feedback Vertex Set, Algorithm Engineering, FPT, Kernelization, Heuristics}
}
@InProceedings{swat:LIPIcs.IPEC.2022.27,
author = {Swat, Sylwester},
title = {{PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {27:1--27:3},
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.27},
URN = {urn:nbn:de:0030-drops-173835},
doi = {10.4230/LIPIcs.IPEC.2022.27},
annote = {Keywords: Directed feedback vertex set, heuristic solver, graph algorithms, PACE 2022}
}
@InProceedings{angrick_et_al:LIPIcs.IPEC.2022.28,
author = {Angrick, Sebastian and Bals, Ben and Casel, Katrin and Cohen, Sarel and Friedrich, Tobias and Hastrich, Niko and Hradilak, Theresa and Issac, Davis and Ki{\ss}ig, Otto and Schmidt, Jonas and Wendt, Leo},
title = {{PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {28:1--28:4},
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.28},
URN = {urn:nbn:de:0030-drops-173847},
doi = {10.4230/LIPIcs.IPEC.2022.28},
annote = {Keywords: directed feedback vertex set, vertex cover, reduction rules}
}
@InProceedings{du_et_al:LIPIcs.IPEC.2022.29,
author = {Du, YuMing and Zhang, QingYun and Xu, JunZhou and Zhang, ShunGen and Liao, Chao and Chen, ZhiHuai and Sun, ZhiBo and Su, ZhouXing and Ding, JunWen and Wu, Chen and Lu, PinYan and Lv, ZhiPeng},
title = {{PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {29:1--29:3},
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.29},
URN = {urn:nbn:de:0030-drops-173855},
doi = {10.4230/LIPIcs.IPEC.2022.29},
annote = {Keywords: directed feedback vertex set, local search, simulated annealing, set covering}
}
@InProceedings{bergenthal_et_al:LIPIcs.IPEC.2022.30,
author = {Bergenthal, Moritz and Dirks, Jona and Freese, Thorben and Gahde, Jakob and Gerhard, Enna and Grobler, Mario and Siebertz, Sebastian},
title = {{PACE Solver Description: GraPA-JAVA}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {30:1--30:4},
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.30},
URN = {urn:nbn:de:0030-drops-173861},
doi = {10.4230/LIPIcs.IPEC.2022.30},
annote = {Keywords: complexity theory, parameterized complexity, linear programming, java, directed feedback vertex set, PACE 2022}
}
@InProceedings{bathie_et_al:LIPIcs.IPEC.2022.31,
author = {Bathie, Gabriel and Berthe, Ga\'{e}tan and Coudert-Osmont, Yoann and Desobry, David and Reinald, Amadeus and Rocton, Mathis},
title = {{PACE Solver Description: DreyFVS}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {31:1--31:4},
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.31},
URN = {urn:nbn:de:0030-drops-173870},
doi = {10.4230/LIPIcs.IPEC.2022.31},
annote = {Keywords: Directed Feedback Vertex Set, Heuristic, Sinkhorn algorithm, Local search}
}
@InProceedings{kiesel_et_al:LIPIcs.IPEC.2022.32,
author = {Kiesel, Rafael and Schidler, Andr\'{e}},
title = {{PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT}},
booktitle = {17th International Symposium on Parameterized and Exact Computation (IPEC 2022)},
pages = {32:1--32:4},
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.32},
URN = {urn:nbn:de:0030-drops-173885},
doi = {10.4230/LIPIcs.IPEC.2022.32},
annote = {Keywords: Directed Feeback Vertex Set, Data Reductions, Incremental MaxSAT}
}
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