Special Issue: Parameterized and Exact Computation (IPEC 2020)

-

Journal

Algorithmica

Algorithmica is an international journal which publishes theoretical papers on algorithms that address problems arising in practical areas, and experimental papers of general appeal...

Yixin Cao

-
Marcin Pilipczuk

-

Showing 1-9 of 9 articles

Component Order Connectivity in Directed Graphs
Jørgen Bang-Jensen
Eduard Eiben
Anders Yeo
OriginalPaper Open access 23 July 2022 Pages: 2767 - 2784
Preface to the Special Issue on Parameterized and Exact Computation
Yixin Cao
Marcin Pilipczuk
EditorialNotes 02 July 2022 Pages: 2240 - 2241
On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan
Jesper Nederlof
Céline M. F. Swennenhuis
OriginalPaper Open access 07 May 2022 Pages: 2309 - 2334
Structural Parameterizations with Modulator Oblivion
Ashwin Jacob
Fahad Panolan
Vibha Sahlot
OriginalPaper 03 May 2022 Pages: 2335 - 2357
Parameterized Complexity of Graph Burning
Yasuaki Kobayashi
Yota Otachi
OriginalPaper Open access 11 April 2022 Pages: 2379 - 2393
A Polynomial Kernel for Funnel Arc Deletion Set
Marcelo Garlet Milani
OriginalPaper Open access 04 April 2022 Pages: 2358 - 2378
Finding Optimal Triangulations Parameterized by Edge Clique Cover
Tuukka Korhonen
OriginalPaper Open access 05 February 2022 Pages: 2242 - 2270
Vertex Deletion into Bipartite Permutation Graphs
Łukasz Bożyk
Jan Derbisz
Karolina Okrasa
OriginalPaper Open access 01 February 2022 Pages: 2271 - 2291
Parameterized Complexity of Directed Spanner Problems
Fedor V. Fomin
Petr A. Golovach
Roohani Sharma
OriginalPaper Open access 27 December 2021 Pages: 2292 - 2308

Special Issue: Parameterized and Exact Computation (IPEC 2020)

Participating journal

Algorithmica

Editors

Yixin Cao

Marcin Pilipczuk

Articles

Component Order Connectivity in Directed Graphs

Preface to the Special Issue on Parameterized and Exact Computation

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan

Structural Parameterizations with Modulator Oblivion

Parameterized Complexity of Graph Burning

A Polynomial Kernel for Funnel Arc Deletion Set

Finding Optimal Triangulations Parameterized by Edge Clique Cover

Vertex Deletion into Bipartite Permutation Graphs

Parameterized Complexity of Directed Spanner Problems