Parameterized Complexity: The Main Ideas and Some Research Frontiers-Reference-Cited by-同舟云学术

Parameterized Complexity: The Main Ideas and Some Research Frontiers

Published:2001 Issue: Volume: Page:291-307
ISSN:0302-9743
Container-title:Algorithms and Computation
language:
Short-container-title:

Author:

Fellows Michael R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45678-3_26

Reference44 articles.

1. K. Abrahamson, R. Downey and M. Fellows, “Fixed Parameter Tractability and Completeness IV:O Completeness for WPad PSPACE Analogs,”Annals of Pure and Applied Logic 73 (1995),235–276.

2. Lect Notes Comput Sci;J. Alber,2001

3. J. Alber, J. Gramm and R. Niedermeier, “Faster Exact Algorithms for Hard Prob-lems:AParameterized Point of View,rd Discrete Mathematics 229 (2001),3–27.

4. S. Arora, “Polynomial Time Approximatio Schemes for Euclidea TSP and Other Geometric Problems,” in:Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.

5. V. Arvind, “On the Parameterized Complexity of Counting Problems,”Workshop on Parameterized Complexity... Madras,India,Dec.2000.

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

1. What Is Known About Vertex Cover Kernelization?;Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications;2018

2. Vertex Cover Search Trees;Encyclopedia of Algorithms;2016

3. FPT Suspects and Tough Customers: Open Problems of Downey and Fellows;The Multivariate Algorithmic Revolution and Beyond;2012

4. Kernels for the Vertex Cover Problem on the Preferred Attachment Model;Experimental Algorithms;2006

5. Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs;Journal of the ACM;2005-11