Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems (2001)

by Jochen Alber , Henning Fernau , Rolf Niedermeier
Venue:in Electronic Colloquium on Computational Complexity (ECCC
Citations:60 - 21 self

Document Versions

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems –Jochen Alber, Henning Fernau, Rolf Niedermeier — 2001 — in Electronic Colloquium on Computational Complexity (ECCC
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems –Jochen Alber, Henning Fernau, Rolf Niedermeier — 2001 — IN ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY (ECCC
Parameterized complexity: exponential speed-up for planar graph problems –Jochen Alber, Henning Fernau, Rolf Niedermeier — 2001 — in Electronic Colloquium on Computational Complexity (ECCC
Parameterized Complexity: Exponential Speed-Up For Planar Graph Problems –Jochen Alber, Henning Fernau, Rolf Niedermeier — 2001 — IN ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY (ECCC
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems –Jochen Alber, Henning Fernau, Rolf Niedermeier — 2004 — in Electronic Colloquium on Computational Complexity (ECCC
Parameterized complexity: exponential speed-up for planar graph problems –Jochen Alber, Henning Fernau, Rolf Niedermeier — 2001 — in Electronic Colloquium on Computational Complexity (ECCC