Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems-Reference-Cited by-同舟云学术

Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

Published:2001 Issue: Volume: Page:261-272
ISSN:0302-9743
Container-title:Automata, Languages and Programming
language:
Short-container-title:

Author:

Alber Jochen,Fernau Henning,Niedermeier Rolf

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-48224-5_22

Reference17 articles.

1. Lect Notes Comput Sci;J. Alber,2000

2. J. Alber, H. Fernau, and R. Niedermeier. Parameterized complexity: exponential speed-up for planar graph problems. Technical Report TR01-023, ECCC Reports, Trier, March 2001. Available through http://www.eccc.uni-trier.de/eccc/ .

3. J. Alber, H. Fernau, and R. Niedermeier. Graph separators: a parameterized view. To appear in Proc. 7th COCOON, 2001. Full version available as Technical Report WSI-2001-8, Universität Tübingen (Germany), Wilhelm-Schickard-Institut Für Informatik, March 2001.

4. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. J. ACM, 41(1):153–180, 1994.

5. Lect Notes Comput Sci;H. L. Bodlaender,1997

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Theory and application of width bounded geometric separators;Journal of Computer and System Sciences;2011-03

2. Theory and Application of Width Bounded Geometric Separator;STACS 2006;2006

3. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors;Journal of Computer and System Sciences;2004-09

4. Polynomial-time data reduction for dominating set;Journal of the ACM;2004-05

5. Ubiquitous Parameterization — Invitation to Fixed-Parameter Algorithms;Lecture Notes in Computer Science;2004