Parameterized Computational Feasibility-Reference-Cited by-同舟云学术

Parameterized Computational Feasibility

Published:1995 Issue: Volume: Page:219-244
ISSN:
Container-title:Feasible Mathematics II
language:
Short-container-title:

Author:

Downey Rodney G.,Fellows Michael R.

Publisher

Birkhäuser Boston

Link

http://link.springer.com/content/pdf/10.1007/978-1-4612-2566-9_7.pdf

Reference44 articles.

1. K. Abrahamson. private communication. May, 1992.

2. K. Abrahamson, R. Downey and M. Fellows. Fixed-Parameter Intractability II. In Proceedings 10th Annual Symposium on Theoretical Aspects of Computer Science, (STACS’ 93). Springer-Verlag Lecture Notes in Computer Science, (1993), 374 – 385.

3. K. Abrahamson, R. Downey and M. Fellows. Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. To appear in Annals Pure and Applied Logic.

4. K. Abrahamson and M. Fellows. Finite Automata, Bounded Treewidth and Well-Quasiordering. Graph Structure Theory, ed. N. Robertson and P. Seymour. Contemporary Mathematics Vol 147. American Mathematical Society, Rhode Island, (1993) 539 – 564.

5. G. B. Agnew, R. C. Mullin, I. M. Onyszchuk and S. A. Vanstone. An Implementation for a Fast Public-Key Cryptosystem. J. Cryptology3 (1991), 63 – 79.

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

1. Improved FPT Algorithms for Deletion to Forest-Like Structures;Algorithmica;2024-01-27

2. Degreewidth: A New Parameter for Solving Problems on Tournaments;Graph-Theoretic Concepts in Computer Science;2023

3. An improved branching algorithm for the proper interval edge deletion problem;Frontiers of Computer Science;2021-09-25

4. Revising Johnson’s table for the 21st century;Discrete Applied Mathematics;2021-06

5. A Brief Survey of Fixed-Parameter Parallelism;Algorithms;2020-08-14