| 2023 | 18th International Symposium on Parameterized and Exact Computation, IPEC 2023, Amsterdam, The Netherlands, September 6-8, 2023 Neeldhara Misra, Magnus Wahlström |
| 2023 | A Contraction-Recursive Algorithm for Treewidth. Hisao Tamaki |
| 2023 | A Parameterized Approximation Scheme for the Geometric Knapsack Problem with Wide Items. Mathieu Mari, Timothé Picavet, Michal Pilipczuk |
| 2023 | An FPT Algorithm for Temporal Graph Untangling. Riccardo Dondi, Manuel Lafond |
| 2023 | An Improved Kernelization Algorithm for Trivially Perfect Editing. Maël Dumas, Anthony Perez |
| 2023 | Approximate Monotone Local Search for Weighted Problems. Baris Can Esmer, Ariel Kulik, Dániel Marx, Daniel Neuen, Roohani Sharma |
| 2023 | Approximate Turing Kernelization and Lower Bounds for Domination Problems. Stefan Kratsch, Pascal Kunz |
| 2023 | Bandwidth Parameterized by Cluster Vertex Deletion Number. Tatsuya Gima, Eun Jung Kim, Noleen Köhler, Nikolaos Melissinos, Manolis Vasilakis |
| 2023 | Budgeted Matroid Maximization: a Parameterized Viewpoint. Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai |
| 2023 | Cluster Editing with Overlapping Communities. Emmanuel Arrighi, Matthias Bentert, Pål Grønås Drange, Blair D. Sullivan, Petra Wolf |
| 2023 | Collective Graph Exploration Parameterized by Vertex Cover. Siddharth Gupta, Guy Sa'ar, Meirav Zehavi |
| 2023 | Computing Complexity Measures of Degenerate Graphs. Pål Grønås Drange, Patrick Greaves, Irene Muzi, Felix Reidl |
| 2023 | Consistency Checking Problems: A Gateway to Parameterized Sample Complexity. Robert Ganian, Liana Khazaliya, Kirill Simonov |
| 2023 | Difference Determines the Degree: Structural Kernelizations of Component Order Connectivity. Sriram Bhyravarapu, Satyabrata Jana, Saket Saurabh, Roohani Sharma |
| 2023 | Drawn Tree Decomposition: New Approach for Graph Drawing Problems. Siddharth Gupta, Guy Sa'ar, Meirav Zehavi |
| 2023 | Dynamic Programming on Bipartite Tree Decompositions. Lars Jaffke, Laure Morelle, Ignasi Sau, Dimitrios M. Thilikos |
| 2023 | Existential Second-Order Logic over Graphs: Parameterized Complexity. Max Bannach, Florian Chudigiewitsch, Till Tantau |
| 2023 | Finding Degree-Constrained Acyclic Orientations. Jaroslav Garvardt, Malte Renken, Jannik Schestag, Mathias Weller |
| 2023 | From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem. Eduard Eiben, Robert Ganian, Iyad Kanj, Sebastian Ordyniak, Stefan Szeider |
| 2023 | Front Matter, Table of Contents, Preface, Conference Organization. |
| 2023 | Graph Clustering Problems Under the Lens of Parameterized Local Search. Jaroslav Garvardt, Nils Morawietz, André Nichterlein, Mathias Weller |
| 2023 | How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks. Mark Jones, Jannik Schestag |
| 2023 | Kernelization for Counting Problems on Graphs: Preserving the Number of Minimum Solutions. Bart M. P. Jansen, Bart van der Steenhoven |
| 2023 | Kernelizing Temporal Exploration Problems. Emmanuel Arrighi, Fedor V. Fomin, Petr A. Golovach, Petra Wolf |
| 2023 | Kernels for the Disjoint Paths Problem on Subclasses of Chordal Graphs. Juhi Chaudhary, Harmender Gahlawat, Michal Wlodarczyk, Meirav Zehavi |
| 2023 | Minimum Separator Reconfiguration. Guilherme C. M. Gomes, Clément Legrand-Duchesne, Reem Mahmoud, Amer E. Mouawad, Yoshio Okamoto, Vinícius Fernandes dos Santos, Tom C. van der Zanden |
| 2023 | On the Complexity of Finding a Sparse Connected Spanning Subgraph in a Non-Uniform Failure Model. Matthias Bentert, Jannik Schestag, Frank Sommer |
| 2023 | On the Parameterized Complexity of Multiway Near-Separator. Bart M. P. Jansen, Shivesh Kumar Roy |
| 2023 | PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck |
| 2023 | PACE Solver Description: Hydra Prime. Yosuke Mizutani, David Dursteler, Blair D. Sullivan |
| 2023 | PACE Solver Description: RedAlert - Heuristic Track. Édouard Bonnet, Julien Duron |
| 2023 | PACE Solver Description: The PACE 2023 Parameterized Algorithms and Computational Experiments Challenge: Twinwidth. Max Bannach, Sebastian Berndt |
| 2023 | PACE Solver Description: Touiouidth. Gaétan Berthe, Yoann Coudert-Osmont, Alexander Dobler, Laure Morelle, Amadeus Reinald, Mathis Rocton |
| 2023 | PACE Solver Description: Zygosity. Emmanuel Arrighi, Pål Grønås Drange, Kenneth Langedal, Farhad Vadiee, Martin Vatshelle, Petra Wolf |
| 2023 | Parameterized Complexity Classification for Interval Constraints. Konrad K. Dabrowski, Peter Jonsson, Sebastian Ordyniak, George Osipov, Marcin Pilipczuk, Roohani Sharma |
| 2023 | Sidestepping Barriers for Dominating Set in Parameterized Complexity. Ioannis Koutis, Michal Wlodarczyk, Meirav Zehavi |
| 2023 | Single Machine Scheduling with Few Deadlines. Klaus Heeger, Danny Hermelin, Dvir Shabtay |
| 2023 | Stretch-Width. Édouard Bonnet, Julien Duron |
| 2023 | Sunflowers Meet Sparsity: A Linear-Vertex Kernel for Weighted Clique-Packing on Sparse Graphs. Bart M. P. Jansen, Shivesh Kumar Roy |
| 2023 | The Parameterised Complexity Of Integer Multicommodity Flow. Hans L. Bodlaender, Isja Mannens, Jelle J. Oostveen, Sukanya Pandey, Erik Jan van Leeuwen |
| 2023 | Treewidth Is NP-Complete on Cubic Graphs. Hans L. Bodlaender, Édouard Bonnet, Lars Jaffke, Dusan Knop, Paloma T. Lima, Martin Milanic, Sebastian Ordyniak, Sukanya Pandey, Ondrej Suchý |
| 2023 | Twin-Width of Graphs with Tree-Structured Decompositions. Irene Heinrich, Simon Raßmann |