Parameterized complexity: exponential speed-up for planar graph problems (0)

by J Alber, H Fernau, R Niedermeier
Venue:In Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP), number 2076 in Lecture