The complexity of type inference for higher-order lambda calculi
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the efficiency of polynomial time approximation schemes
Information Processing Letters
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A polynomial time approximation scheme for minimum routing cost spanning trees
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Computing large and small stable models
Proceedings of the 1999 international conference on Logic programming
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Faster exact algorithms for hard problems: a parameterized point of view
Discrete Mathematics
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
A two-pronged attack on the dragon of intractability
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Moving policies in cyclic assembly line scheduling
Theoretical Computer Science - Parameterized and exact computation
The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
Graph-modeled data clustering: fixed-parameter algorithms for clique generation
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Book review: Invitation to fixed-parameter algorithms
Computer Science Review
| Hi-index | 0.00 |
The purposes of this paper are two: (1) to give an exposition of the main ideas of parameterized complexity, and (2) to discuss the connections of parameterized complexity to the systematic design of heuristics and approximation algorithms.