Volume 82, Issue 8

Search all Algorithmica articles

August 2020

Special Issue on Parameterized and Exact Computation, IPEC 2018

Issue Editors:

Christophe Paul,
Michał Pilipczuk

11 articles in this issue

Special Issue Dedicated to the 13th International Symposium on Parameterized and Exact Computation
Christophe Paul
Michał Pilipczuk
Foreword 25 July 2020 Pages: 2133 - 2134
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
Multi-budgeted Directed Cuts
Stefan Kratsch
Shaohua Li
Magnus Wahlström
OriginalPaper Open access 02 August 2019 Pages: 2135 - 2155
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
A Faster Tree-Decomposition Based Algorithm for Counting Linear Extensions
Kustaa Kangas
Mikko Koivisto
Sami Salonen
OriginalPaper Open access 03 October 2019 Pages: 2156 - 2173
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
The Parameterised Complexity of Computing the Maximum Modularity of a Graph
Kitty Meeks
Fiona Skerman
OriginalPaper Open access 08 November 2019 Pages: 2174 - 2199
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
Best-Case and Worst-Case Sparsifiability of Boolean CSPs
Hubie Chen
Bart M. P. Jansen
Astrid Pieterse
OriginalPaper 10 January 2020 Pages: 2200 - 2242
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
On the Distance Identifying Set Meta-problem and Applications to the Complexity of Identifying Problems on Graphs
Florian Barbero
Lucas Isenmann
Jocelyn Thiebaut
OriginalPaper 27 January 2020 Pages: 2243 - 2266
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
Counting Induced Subgraphs: A Topological Approach to #W[1]-hardness
Marc Roth
Johannes Schmitt
OriginalPaper Open access 22 January 2020 Pages: 2267 - 2291
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
Multivariate Analysis of Orthogonal Range Searching and Graph Distances
Karl Bringmann
Thore Husfeldt
Måns Magnusson
OriginalPaper Open access 14 March 2020 Pages: 2292 - 2315
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
Dual Parameterization of Weighted Coloring
Júlio Araújo
Victor A. Campos
Ana Silva
OriginalPaper 13 February 2020 Pages: 2316 - 2336
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
Parameterized Leaf Power Recognition via Embedding into Graph Products
David Eppstein
Elham Havvaei
OriginalPaper 29 May 2020 Pages: 2337 - 2359
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018
Parameterized Complexity of Independent Set in H-Free Graphs
Édouard Bonnet
Nicolas Bousquet
Rémi Watrigant
OriginalPaper 17 June 2020 Pages: 2360 - 2394
Part of 2 collections:

Special Issue on Parameterized and Exact Computation, IPEC 2018

Special Issue on Parameterized and Exact Computation, IPEC 2018

Volume 82, Issue 8

Search

Navigation