default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID17th IPEC 2022: Potsdam, Germany
- Holger Dell
, Jesper Nederlof:
17th International Symposium on Parameterized and Exact Computation, IPEC 2022, Potsdam, Germany, September 7-9, 2022. LIPIcs 249, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-260-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Akanksha Agrawal, Saket Saurabh, Meirav Zehavi:
A Finite Algorithm for the Realizabilty of a Delaunay Triangulation. 1:1-1:16 - Akanksha Agrawal, Sutanay Bhattacharjee, Satyabrata Jana, Abhishek Sahu:
Parameterized Complexity of Perfectly Matched Sets. 2:1-2:13 - Brage I. K. Bakkane, Lars Jaffke:
On the Hardness of Generalized Domination Problems Parameterized by Mim-Width. 3:1-3:19 - Sayan Bandyapadhyay, Fedor V. Fomin, Petr A. Golovach, Nidhi Purohit, Kirill Simonov:
FPT Approximation for Fair Minimum-Load Clustering. 4:1-4:14 - Johannes Blum, Yann Disser, Andreas Emil Feldmann, Siddharth Gupta, Anna Zych-Pawlewicz:
On Sparse Hitting Sets: From Fair Vertex Cover to Highway Dimension. 5:1-5:23 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Marcin Pilipczuk, Michal Pilipczuk:
On the Complexity of Problems on Tree-Structured Graphs. 6:1-6:17 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob:
On the Parameterized Complexity of Computing Tree-Partitions. 7:1-7:20 - Hans L. Bodlaender, Carla Groenland, Hugo Jacob, Lars Jaffke, Paloma T. Lima:
XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure. 8:1-8:18 - Édouard Bonnet, Dibyayan Chakraborty, Eun Jung Kim, Noleen Köhler, Raul Lopes, Stéphan Thomassé:
Twin-Width VIII: Delineation and Win-Wins. 9:1-9:18 - Guillaume Ducoffe:
Obstructions to Faster Diameter Computation: Asteroidal Sets. 10:1-10:24 - Eduard Eiben, Clément Rambaud, Magnus Wahlström:
On the Parameterized Complexity of Symmetric Directed Multicut. 11:1-11:17 - Baris Can Esmer, Ariel Kulik, Dániel Marx, Philipp Schepper, Karol Wegrzycki:
Computing Generalized Convolutions Faster Than Brute Force. 12:1-12:22 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Nidhi Purohit, Saket Saurabh:
Exact Exponential Algorithms for Clustering Problems. 13:1-13:14 - Esther Galby, Dániel Marx, Philipp Schepper, Roohani Sharma, Prafullkumar Tale:
Domination and Cut Problems on Chordal Graphs with Bounded Leafage. 14:1-14:24 - Robert Ganian, Viktoriia Korchemna:
Slim Tree-Cut Width. 15:1-15:18 - Ishay Haviv:
A Fixed-Parameter Algorithm for the Schrijver Problem. 16:1-16:16 - Falko Hegerfeld, Stefan Kratsch:
Towards Exact Structural Thresholds for Parameterized Complexity. 17:1-17:20 - Danny Hermelin, Yuval Itzhaki, Hendrik Molter, Dvir Shabtay:
Hardness of Interval Scheduling on Unrelated Machines. 18:1-18:16 - Leon Kellerhals, Tomohiro Koana, Pascal Kunz:
Vertex Cover and Feedback Vertex Set Above and Below Structural Guarantees. 19:1-19:14 - Christian Komusiewicz, Nils Morawietz:
Parameterized Local Search for Vertex Cover: When Only the Search Radius Is Crucial. 20:1-20:18 - Maher Mallem, Claire Hanen, Alix Munier Kordon:
Parameterized Complexity of a Parallel Machine Scheduling Problem. 21:1-21:21 - Dániel Marx, Govind S. Sankar, Philipp Schepper:
Anti-Factor Is FPT Parameterized by Treewidth and List Size (But Counting Is Hard). 22:1-22:23 - Yosuke Mizutani, Blair D. Sullivan:
Parameterized Complexity of Maximum Happy Set and Densest k-Subgraph. 23:1-23:18 - Jelle J. Oostveen, Erik Jan van Leeuwen:
Parameterized Complexity of Streaming Diameter and Connectivity Problems. 24:1-24:16 - Hjalmar Schulz, André Nichterlein, Rolf Niedermeier, Christopher Weyand:
Applying a Cut-Based Data Reduction Rule for Weighted Cluster Editing in Polynomial Time. 25:1-25:14 - Ernestine Großmann, Tobias Heuer, Christian Schulz, Darren Strash:
The PACE 2022 Parameterized Algorithms and Computational Experiments Challenge: Directed Feedback Vertex Set. 26:1-26:18 - Sylwester Swat:
PACE Solver Description: DiVerSeS - A Heuristic Solver for the Directed Feedback Vertex Set Problem. 27:1-27:3 - Sebastian Angrick, Ben Bals, Katrin Casel, Sarel Cohen, Tobias Friedrich, Niko Hastrich, Theresa Hradilak, Davis Issac, Otto Kißig, Jonas Schmidt, Leo Wendt:
PACE Solver Description: Mount Doom - An Exact Solver for Directed Feedback Vertex Set. 28:1-28:4 - Yuming Du, Qingyun Zhang, Junzhou Xu, Shungen Zhang, Chao Liao, Zhihuai Chen, Zhibo Sun, Zhouxing Su, Junwen Ding, Chen Wu, Pinyan Lu, Zhi-Peng Lv:
PACE Solver Description: Hust-Solver - A Heuristic Algorithm of Directed Feedback Vertex Set Problem. 29:1-29:3 - Moritz Bergenthal, Jona Dirks, Thorben Freese, Jakob Gahde, Enna Gerhard, Mario Grobler, Sebastian Siebertz:
PACE Solver Description: GraPA-JAVA. 30:1-30:4 - Gabriel Bathie, Gaétan Berthe, Yoann Coudert-Osmont, David Desobry, Amadeus Reinald, Mathis Rocton:
PACE Solver Description: DreyFVS. 31:1-31:4 - Rafael Kiesel, André Schidler:
PACE Solver Description: DAGer - Cutting out Cycles with MaxSAT. 32:1-32:4
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-05 22:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
