1. J. Alber, Exact algorithms for NP-hard problems on networks: design, analysis, and implementation, PhD thesis, Univerität Tübingen, January 2003
2. Parameterized complexity: exponential speed-up for planar graph problems;Alber,2001
3. Graph separators: a parameterized view;Alber,2001
4. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994
5. Pushing disks together—the continuous-motion case;Bern;Discrete Comput. Geom.,1998