Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ICALP
2001
Springer

favoriteEmaildiscussreport

86views Programming Languages» more ICALP 2001»

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

13 years 8 months ago

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

Download theinf1.informatik.uni-jena.de

Jochen Alber, Henning Fernau, Rolf Niedermeier

Real-time Traffic

ICALP 2001 | Programming Languages |

claim paper

Related Content

» On Parameterized Exponential Time Complexity

» The Parameterized Complexity of the Induced Matching Problem in Planar Graphs

» FixedParameter Algorithms for the k rCenter in Planar Graphs and Map Graphs

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» Subexponential Algorithms for Partial Cover Problems

» A Parameterized Algorithm for Protein Structure Alignment

» What Makes Equitable Connected Partition Easy

» On Secure Multiparty Computation in BlackBox Groups

Post Info
More Details (n/a)

Added	29 Jul 2010
Updated	29 Jul 2010
Type	Conference
Year	2001
Where	ICALP
Authors	Jochen Alber, Henning Fernau, Rolf Niedermeier

Comments (0)