16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 1-474, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Proceedings{golovach_et_al:LIPIcs.IPEC.2021, title = {{LIPIcs, Volume 214, IPEC 2021, Complete Volume}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {1--474}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021}, URN = {urn:nbn:de:0030-drops-153828}, doi = {10.4230/LIPIcs.IPEC.2021}, annote = {Keywords: LIPIcs, Volume 214, IPEC 2021, Complete Volume} }
16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 0:i-0:xviii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{golovach_et_al:LIPIcs.IPEC.2021.0, author = {Golovach, Petr A. and Zehavi, Meirav}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {0:i--0:xviii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.0}, URN = {urn:nbn:de:0030-drops-153834}, doi = {10.4230/LIPIcs.IPEC.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Akanksha Agrawal, Aditya Anand, and Saket Saurabh. A Polynomial Kernel for Deletion to Ptolemaic Graphs. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 1:1-1:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2021.1, author = {Agrawal, Akanksha and Anand, Aditya and Saurabh, Saket}, title = {{A Polynomial Kernel for Deletion to Ptolemaic Graphs}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {1:1--1:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.1}, URN = {urn:nbn:de:0030-drops-153840}, doi = {10.4230/LIPIcs.IPEC.2021.1}, annote = {Keywords: Ptolemaic Deletion, Kernelization, Parameterized Complexity, Gem-free chordal graphs} }
Akanksha Agrawal, Ravi Kiran Allumalla, and Varun Teja Dhanekula. Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{agrawal_et_al:LIPIcs.IPEC.2021.2, author = {Agrawal, Akanksha and Allumalla, Ravi Kiran and Dhanekula, Varun Teja}, title = {{Refuting FPT Algorithms for Some Parameterized Problems Under Gap-ETH}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {2:1--2:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.2}, URN = {urn:nbn:de:0030-drops-153851}, doi = {10.4230/LIPIcs.IPEC.2021.2}, annote = {Keywords: Token Jumping, Bipartite Graphs, Fixed Parameter Intractability, Half Graphs, Gap-Exponential Time Hypothesis} }
Haozhe An, Mohit Gurumukhani, Russell Impagliazzo, Michael Jaber, Marvin Künnemann, and Maria Paula Parga Nina. The Fine-Grained Complexity of Multi-Dimensional Ordering Properties. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{an_et_al:LIPIcs.IPEC.2021.3, author = {An, Haozhe and Gurumukhani, Mohit and Impagliazzo, Russell and Jaber, Michael and K\"{u}nnemann, Marvin and Nina, Maria Paula Parga}, title = {{The Fine-Grained Complexity of Multi-Dimensional Ordering Properties}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.3}, URN = {urn:nbn:de:0030-drops-153869}, doi = {10.4230/LIPIcs.IPEC.2021.3}, annote = {Keywords: Fine-grained complexity, First-order logic, Orthogonal vectors} }
Júlio Araújo, Marin Bougeret, Victor Campos, and Ignasi Sau. A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 4:1-4:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{araujo_et_al:LIPIcs.IPEC.2021.4, author = {Ara\'{u}jo, J\'{u}lio and Bougeret, Marin and Campos, Victor and Sau, Ignasi}, title = {{A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {4:1--4:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.4}, URN = {urn:nbn:de:0030-drops-153879}, doi = {10.4230/LIPIcs.IPEC.2021.4}, annote = {Keywords: Maximum minimal vertex cover, parameterized complexity, polynomial kernel, kernelization lower bound, Erd\H{o}s-Hajnal property, induced subgraphs} }
Vikraman Arvind and Venkatesan Guruswami. CNF Satisfiability in a Subspace and Related Problems. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 5:1-5:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{arvind_et_al:LIPIcs.IPEC.2021.5, author = {Arvind, Vikraman and Guruswami, Venkatesan}, title = {{CNF Satisfiability in a Subspace and Related Problems}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {5:1--5:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.5}, URN = {urn:nbn:de:0030-drops-153886}, doi = {10.4230/LIPIcs.IPEC.2021.5}, annote = {Keywords: CNF Satisfiability, Exact exponential algorithms, Hardness results} }
Jakub Balabán and Petr Hliněný. Twin-Width Is Linear in the Poset Width. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{balaban_et_al:LIPIcs.IPEC.2021.6, author = {Balab\'{a}n, Jakub and Hlin\v{e}n\'{y}, Petr}, title = {{Twin-Width Is Linear in the Poset Width}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.6}, URN = {urn:nbn:de:0030-drops-153895}, doi = {10.4230/LIPIcs.IPEC.2021.6}, annote = {Keywords: twin-width, digraph, poset, FO model checking, contraction sequence} }
Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, and Till Tantau. Dynamic Kernels for Hitting Sets and Set Packing. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 7:1-7:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bannach_et_al:LIPIcs.IPEC.2021.7, author = {Bannach, Max and Heinrich, Zacharias and Reischuk, R\"{u}diger and Tantau, Till}, title = {{Dynamic Kernels for Hitting Sets and Set Packing}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {7:1--7:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.7}, URN = {urn:nbn:de:0030-drops-153900}, doi = {10.4230/LIPIcs.IPEC.2021.7}, annote = {Keywords: Kernelization, Dynamic Algorithms, Hitting Set, Set Packings} }
Gabriel Bathie, Nicolas Bousquet, and Théo Pierron. (Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bathie_et_al:LIPIcs.IPEC.2021.8, author = {Bathie, Gabriel and Bousquet, Nicolas and Pierron, Th\'{e}o}, title = {{(Sub)linear Kernels for Edge Modification Problems Towards Structured Graph Classes}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.8}, URN = {urn:nbn:de:0030-drops-153918}, doi = {10.4230/LIPIcs.IPEC.2021.8}, annote = {Keywords: kernelization, graph editing, split graphs, (sub)linear kernels} }
Hans L. Bodlaender, Carla Groenland, and Céline M. F. Swennenhuis. Parameterized Complexities of Dominating and Independent Set Reconfiguration. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bodlaender_et_al:LIPIcs.IPEC.2021.9, author = {Bodlaender, Hans L. and Groenland, Carla and Swennenhuis, C\'{e}line M. F.}, title = {{Parameterized Complexities of Dominating and Independent Set Reconfiguration}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.9}, URN = {urn:nbn:de:0030-drops-153920}, doi = {10.4230/LIPIcs.IPEC.2021.9}, annote = {Keywords: Parameterized complexity, independent set reconfiguration, dominating set reconfiguration, W-hierarchy, XL, XNL, XNLP} }
Édouard Bonnet, Eun Jung Kim, Amadeus Reinald, Stéphan Thomassé, and Rémi Watrigant. Twin-Width and Polynomial Kernels. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bonnet_et_al:LIPIcs.IPEC.2021.10, author = {Bonnet, \'{E}douard and Kim, Eun Jung and Reinald, Amadeus and Thomass\'{e}, St\'{e}phan and Watrigant, R\'{e}mi}, title = {{Twin-Width and Polynomial Kernels}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {10:1--10:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.10}, URN = {urn:nbn:de:0030-drops-153932}, doi = {10.4230/LIPIcs.IPEC.2021.10}, annote = {Keywords: Twin-width, kernelization, lower bounds, Dominating Set} }
Laurent Bulteau, Bertrand Marchand, and Yann Ponty. A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bulteau_et_al:LIPIcs.IPEC.2021.11, author = {Bulteau, Laurent and Marchand, Bertrand and Ponty, Yann}, title = {{A New Parametrization for Independent Set Reconfiguration and Applications to RNA Kinetics}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.11}, URN = {urn:nbn:de:0030-drops-153946}, doi = {10.4230/LIPIcs.IPEC.2021.11}, annote = {Keywords: reconfiguration problems - parameterized algorithms - RNA bioinformatics - directed pathwidth} }
Elisabet Burjons and Peter Rossmanith. Lower Bounds for Conjunctive and Disjunctive Turing Kernels. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 12:1-12:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{burjons_et_al:LIPIcs.IPEC.2021.12, author = {Burjons, Elisabet and Rossmanith, Peter}, title = {{Lower Bounds for Conjunctive and Disjunctive Turing Kernels}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {12:1--12:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.12}, URN = {urn:nbn:de:0030-drops-153953}, doi = {10.4230/LIPIcs.IPEC.2021.12}, annote = {Keywords: Parameterized Complexity, Turing kernels} }
Yixin Cao and Yuping Ke. Improved Kernels for Edge Modification Problems. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 13:1-13:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cao_et_al:LIPIcs.IPEC.2021.13, author = {Cao, Yixin and Ke, Yuping}, title = {{Improved Kernels for Edge Modification Problems}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {13:1--13:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.13}, URN = {urn:nbn:de:0030-drops-153965}, doi = {10.4230/LIPIcs.IPEC.2021.13}, annote = {Keywords: Kernelization, edge modification, cluster, trivially perfect graphs, split graphs} }
Huib Donkers, Bart M. P. Jansen, and Michał Włodarczyk. Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 14:1-14:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{donkers_et_al:LIPIcs.IPEC.2021.14, author = {Donkers, Huib and Jansen, Bart M. P. and W{\l}odarczyk, Micha{\l}}, title = {{Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {14:1--14:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.14}, URN = {urn:nbn:de:0030-drops-153979}, doi = {10.4230/LIPIcs.IPEC.2021.14}, annote = {Keywords: fixed-parameter tractability, kernelization, outerplanar graphs} }
Guillaume Ducoffe. Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ducoffe:LIPIcs.IPEC.2021.15, author = {Ducoffe, Guillaume}, title = {{Maximum Matching in Almost Linear Time on Graphs of Bounded Clique-Width}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.15}, URN = {urn:nbn:de:0030-drops-153987}, doi = {10.4230/LIPIcs.IPEC.2021.15}, annote = {Keywords: Maximum Matching, Maximum b-matching, Clique-width, Tree-width, Courcelle’s theorem, FPT in P} }
Guillaume Ducoffe. Optimal Centrality Computations Within Bounded Clique-Width Graphs. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 16:1-16:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ducoffe:LIPIcs.IPEC.2021.16, author = {Ducoffe, Guillaume}, title = {{Optimal Centrality Computations Within Bounded Clique-Width Graphs}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {16:1--16:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.16}, URN = {urn:nbn:de:0030-drops-153995}, doi = {10.4230/LIPIcs.IPEC.2021.16}, annote = {Keywords: Clique-width, Centralities computation, Facility Location problems, Distance-labeling scheme, Fine-grained complexity in P, Graph theory} }
Maël Dumas, Anthony Perez, and Ioan Todinca. Polynomial Kernels for Strictly Chordal Edge Modification Problems. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 17:1-17:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dumas_et_al:LIPIcs.IPEC.2021.17, author = {Dumas, Ma\"{e}l and Perez, Anthony and Todinca, Ioan}, title = {{Polynomial Kernels for Strictly Chordal Edge Modification Problems}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {17:1--17:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.17}, URN = {urn:nbn:de:0030-drops-154005}, doi = {10.4230/LIPIcs.IPEC.2021.17}, annote = {Keywords: Parameterized complexity, kernelization algorithms, graph modification, strictly chordal graphs} }
Andreas Emil Feldmann and Ashutosh Rai. On Extended Formulations For Parameterized Steiner Trees. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 18:1-18:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{feldmann_et_al:LIPIcs.IPEC.2021.18, author = {Feldmann, Andreas Emil and Rai, Ashutosh}, title = {{On Extended Formulations For Parameterized Steiner Trees}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {18:1--18:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.18}, URN = {urn:nbn:de:0030-drops-154010}, doi = {10.4230/LIPIcs.IPEC.2021.18}, annote = {Keywords: Steiner trees, integral linear program, extension complexity, fixed-parameter tractability} }
Dennis Fischer, Tim A. Hartmann, Stefan Lendl, and Gerhard J. Woeginger. An Investigation of the Recoverable Robust Assignment Problem. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{fischer_et_al:LIPIcs.IPEC.2021.19, author = {Fischer, Dennis and Hartmann, Tim A. and Lendl, Stefan and Woeginger, Gerhard J.}, title = {{An Investigation of the Recoverable Robust Assignment Problem}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {19:1--19:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.19}, URN = {urn:nbn:de:0030-drops-154025}, doi = {10.4230/LIPIcs.IPEC.2021.19}, annote = {Keywords: assignment problem, matchings, exact matching, robust optimization, fixed paramter tractablity, RNC} }
Alejandro Grez, Filip Mazowiecki, Michał Pilipczuk, Gabriele Puppis, and Cristian Riveros. Dynamic Data Structures for Timed Automata Acceptance. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 20:1-20:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{grez_et_al:LIPIcs.IPEC.2021.20, author = {Grez, Alejandro and Mazowiecki, Filip and Pilipczuk, Micha{\l} and Puppis, Gabriele and Riveros, Cristian}, title = {{Dynamic Data Structures for Timed Automata Acceptance}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {20:1--20:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.20}, URN = {urn:nbn:de:0030-drops-154037}, doi = {10.4230/LIPIcs.IPEC.2021.20}, annote = {Keywords: timed automata, data stream, dynamic data structure} }
Hugo Jacob, Thomas Bellitto, Oscar Defrain, and Marcin Pilipczuk. Close Relatives (Of Feedback Vertex Set), Revisited. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 21:1-21:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jacob_et_al:LIPIcs.IPEC.2021.21, author = {Jacob, Hugo and Bellitto, Thomas and Defrain, Oscar and Pilipczuk, Marcin}, title = {{Close Relatives (Of Feedback Vertex Set), Revisited}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {21:1--21:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.21}, URN = {urn:nbn:de:0030-drops-154049}, doi = {10.4230/LIPIcs.IPEC.2021.21}, annote = {Keywords: feedback vertex set, treewidth, cliquewidth} }
Vít Jelínek, Michal Opler, and Jakub Pekárek. Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 22:1-22:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jelinek_et_al:LIPIcs.IPEC.2021.22, author = {Jel{\'\i}nek, V{\'\i}t and Opler, Michal and Pek\'{a}rek, Jakub}, title = {{Long Paths Make Pattern-Counting Hard, and Deep Trees Make It Harder}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {22:1--22:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.22}, URN = {urn:nbn:de:0030-drops-154050}, doi = {10.4230/LIPIcs.IPEC.2021.22}, annote = {Keywords: Permutation pattern matching, subexponential algorithm, conditional lower bounds, tree-width} }
Lawqueen Kanesh, Jayakrishnan Madathil, Abhishek Sahu, Saket Saurabh, and Shaily Verma. A Polynomial Kernel for Bipartite Permutation Vertex Deletion. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 23:1-23:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kanesh_et_al:LIPIcs.IPEC.2021.23, author = {Kanesh, Lawqueen and Madathil, Jayakrishnan and Sahu, Abhishek and Saurabh, Saket and Verma, Shaily}, title = {{A Polynomial Kernel for Bipartite Permutation Vertex Deletion}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {23:1--23:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.23}, URN = {urn:nbn:de:0030-drops-154065}, doi = {10.4230/LIPIcs.IPEC.2021.23}, annote = {Keywords: kernelization, bipartite permutation graph, bicliques} }
Shaohua Li and Marcin Pilipczuk. Hardness of Metric Dimension in Graphs of Constant Treewidth. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{li_et_al:LIPIcs.IPEC.2021.24, author = {Li, Shaohua and Pilipczuk, Marcin}, title = {{Hardness of Metric Dimension in Graphs of Constant Treewidth}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {24:1--24:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.24}, URN = {urn:nbn:de:0030-drops-154071}, doi = {10.4230/LIPIcs.IPEC.2021.24}, annote = {Keywords: Graph algorithms, parameterized complexity, width parameters, NP-hard} }
Igor Razgon. Classification of OBDD Size for Monotone 2-CNFs. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{razgon:LIPIcs.IPEC.2021.25, author = {Razgon, Igor}, title = {{Classification of OBDD Size for Monotone 2-CNFs}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {25:1--25:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.25}, URN = {urn:nbn:de:0030-drops-154081}, doi = {10.4230/LIPIcs.IPEC.2021.25}, annote = {Keywords: Ordered Binary Decision Diagrams, Monotone 2-CNFs, Width parameters of graphs, upper and lower bounds} }
Leon Kellerhals, Tomohiro Koana, André Nichterlein, and Philipp Zschoche. The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 26:1-26:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{kellerhals_et_al:LIPIcs.IPEC.2021.26, author = {Kellerhals, Leon and Koana, Tomohiro and Nichterlein, Andr\'{e} and Zschoche, Philipp}, title = {{The PACE 2021 Parameterized Algorithms and Computational Experiments Challenge: Cluster Editing}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {26:1--26:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.26}, URN = {urn:nbn:de:0030-drops-154096}, doi = {10.4230/LIPIcs.IPEC.2021.26}, annote = {Keywords: Correlation Clustering, Cluster Editing, Algorithm Engineering, FPT, Kernelization, Heuristics} }
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm. PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 27:1-27:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blasius_et_al:LIPIcs.IPEC.2021.27, author = {Bl\"{a}sius, Thomas and Fischbeck, Philipp and Gottesb\"{u}ren, Lars and Hamann, Michael and Heuer, Tobias and Spinner, Jonas and Weyand, Christopher and Wilhelm, Marcus}, title = {{PACE Solver Description: The KaPoCE Exact Cluster Editing Algorithm}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {27:1--27:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.27}, URN = {urn:nbn:de:0030-drops-154109}, doi = {10.4230/LIPIcs.IPEC.2021.27}, annote = {Keywords: cluster editing} }
Alexander Bille, Dominik Brandenstein, and Emanuel Herrendorf. PACE Solver Description: ADE-Solver. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 28:1-28:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bille_et_al:LIPIcs.IPEC.2021.28, author = {Bille, Alexander and Brandenstein, Dominik and Herrendorf, Emanuel}, title = {{PACE Solver Description: ADE-Solver}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {28:1--28:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.28}, URN = {urn:nbn:de:0030-drops-154112}, doi = {10.4230/LIPIcs.IPEC.2021.28}, annote = {Keywords: Unweighted Cluster Editing} }
Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, and Ulysse Prieto. PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 29:1-29:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bartier_et_al:LIPIcs.IPEC.2021.29, author = {Bartier, Valentin and Bathie, Gabriel and Bousquet, Nicolas and Heinrich, Marc and Pierron, Th\'{e}o and Prieto, Ulysse}, title = {{PACE Solver Description: PaSTEC - PAths, Stars and Twins to Edit Towards Clusters}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {29:1--29:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.29}, URN = {urn:nbn:de:0030-drops-154129}, doi = {10.4230/LIPIcs.IPEC.2021.29}, annote = {Keywords: cluster editing, exact algorithm, star packing, twins} }
Jona Dirks, Mario Grobler, Roman Rabinovich, Yannik Schnaubelt, Sebastian Siebertz, and Maximilian Sonneborn. PACE Solver Description: PACA-JAVA. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 30:1-30:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{dirks_et_al:LIPIcs.IPEC.2021.30, author = {Dirks, Jona and Grobler, Mario and Rabinovich, Roman and Schnaubelt, Yannik and Siebertz, Sebastian and Sonneborn, Maximilian}, title = {{PACE Solver Description: PACA-JAVA}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {30:1--30:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.30}, URN = {urn:nbn:de:0030-drops-154138}, doi = {10.4230/LIPIcs.IPEC.2021.30}, annote = {Keywords: Cluster editing, parameterized complexity, PACE 2021} }
Thomas Bläsius, Philipp Fischbeck, Lars Gottesbüren, Michael Hamann, Tobias Heuer, Jonas Spinner, Christopher Weyand, and Marcus Wilhelm. PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 31:1-31:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{blasius_et_al:LIPIcs.IPEC.2021.31, author = {Bl\"{a}sius, Thomas and Fischbeck, Philipp and Gottesb\"{u}ren, Lars and Hamann, Michael and Heuer, Tobias and Spinner, Jonas and Weyand, Christopher and Wilhelm, Marcus}, title = {{PACE Solver Description: KaPoCE: A Heuristic Cluster Editing Algorithm}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {31:1--31:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.31}, URN = {urn:nbn:de:0030-drops-154147}, doi = {10.4230/LIPIcs.IPEC.2021.31}, annote = {Keywords: cluster editing, local search, variable neighborhood search} }
Sylwester Swat. PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 32:1-32:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{swat:LIPIcs.IPEC.2021.32, author = {Swat, Sylwester}, title = {{PACE Solver Description: CluES - a Heuristic Solver for the Cluster Editing Problem}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {32:1--32:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.32}, URN = {urn:nbn:de:0030-drops-154157}, doi = {10.4230/LIPIcs.IPEC.2021.32}, annote = {Keywords: Cluster editing, heuristic solver, graph algorithms, PACE 2021} }
Valentin Bartier, Gabriel Bathie, Nicolas Bousquet, Marc Heinrich, Théo Pierron, and Ulysse Prieto. PACE Solver Description: μSolver - Heuristic Track. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 33:1-33:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{bartier_et_al:LIPIcs.IPEC.2021.33, author = {Bartier, Valentin and Bathie, Gabriel and Bousquet, Nicolas and Heinrich, Marc and Pierron, Th\'{e}o and Prieto, Ulysse}, title = {{PACE Solver Description: \muSolver - Heuristic Track}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {33:1--33:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.33}, URN = {urn:nbn:de:0030-drops-154161}, doi = {10.4230/LIPIcs.IPEC.2021.33}, annote = {Keywords: kernelization, graph editing, clustering, local search} }
Martin Josef Geiger. PACE Solver Description: A Simplified Threshold Accepting Approach for the Cluster Editing Problem. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 34:1-34:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{geiger:LIPIcs.IPEC.2021.34, author = {Geiger, Martin Josef}, title = {{PACE Solver Description: A Simplified Threshold Accepting Approach for the Cluster Editing Problem}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {34:1--34:2}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.34}, URN = {urn:nbn:de:0030-drops-154176}, doi = {10.4230/LIPIcs.IPEC.2021.34}, annote = {Keywords: Cluster Editing Problem, Threshold Accepting, Local Search} }
Sylwester Swat. PACE Solver Description: Cluster Editing Kernelization Using CluES. In 16th International Symposium on Parameterized and Exact Computation (IPEC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 214, pp. 35:1-35:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{swat:LIPIcs.IPEC.2021.35, author = {Swat, Sylwester}, title = {{PACE Solver Description: Cluster Editing Kernelization Using CluES}}, booktitle = {16th International Symposium on Parameterized and Exact Computation (IPEC 2021)}, pages = {35:1--35:3}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-216-7}, ISSN = {1868-8969}, year = {2021}, volume = {214}, editor = {Golovach, Petr A. and Zehavi, Meirav}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2021.35}, URN = {urn:nbn:de:0030-drops-154186}, doi = {10.4230/LIPIcs.IPEC.2021.35}, annote = {Keywords: Cluster editing, kernelization, graph algorithms, PACE 2021} }
Feedback for Dagstuhl Publishing