Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Nonconstructive advances in polynomial-time complexity
Information Processing Letters
On the Design of Fault-Tolerant Two-Dimensional Systolic Arrays for Yield Enhancement
IEEE Transactions on Computers
Learnability and the Vapnik-Chervonenkis dimension
Journal of the ACM (JACM)
Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Introduction to algorithms
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
SIAM Journal on Computing
Parameterized learning complexity
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Approximation properties of NP minimization classes
Journal of Computer and System Sciences
Journal of the ACM (JACM)
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
A New Class Of Efficient Algorithms For Reconfiguration Of Memory Arrays
IEEE Transactions on Computers
Generation of Minimal Vertex Covers for Row/Column Allocation in Self-Repairable Arrays
IEEE Transactions on Computers
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On limited nondeterminism and the complexity of the V-C dimension
Journal of Computer and System Sciences
On fixed-parameter tractability and approximability of NP optimization problems
Journal of Computer and System Sciences - special issue on complexity theory
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Reactive search, a history-sensitive heuristic for MAX-SAT
Journal of Experimental Algorithmics (JEA)
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
An efficient exact algorithm for constraint bipartite vertex cover
Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithms for Vertex Partitioning Problems on Partial k-Trees
SIAM Journal on Discrete Mathematics
Mapping and Repairing Embedded-Memory Defects
IEEE Design & Test
Approximation on the Web: A Compendium of NP Optimization Problems
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Efficient Spare Allocation for Reconfigurable Arrays
IEEE Design & Test
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
Parameterized Complexity
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Parameterized Complexity: The Main Ideas and Some Research Frontiers
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Identification of Function Distinguishable Languages
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
| Hi-index | 0.00 |
Recent time has seen quite some progress in the development of exponential time algorithms for NP-hard problems, where the base of the exponential term is fairly small. These developments are also tightly related to the theory of fixed parameter tractability. In this incomplete survey, we explain some basic techniques in the design of efficient fixed parameter algorithms, discuss deficiencies of parameterized complexity theory, and try to point out some future research challenges. The focus of this paper is on the design of efficient algorithms and not on a structural theory of parameterized complexity. Moreover, our emphasis will be laid on two exemplifying issues: Vertex Cover and MaxSat problems.