A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
Approximation Algorithms for Some Postman Problems
Journal of the ACM (JACM)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Computing crossing number in linear time
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Layered graph drawing
Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The h-Index of a Graph and Its Application to Dynamic Subgraph Statistics
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On problems without polynomial kernels
Journal of Computer and System Sciences
Almost 2-SAT is fixed-parameter tractable
Journal of Computer and System Sciences
Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology
Combinatorial Algorithms
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
Improved upper bounds for vertex cover
Theoretical Computer Science
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Alternative parameterizations for cluster editing
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Preprocessing for treewidth: a combinatorial analysis through kernelization
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Paths, flowers and vertex cover
ESA'11 Proceedings of the 19th European conference on Algorithms
A 2k kernel for the cluster editing problem
Journal of Computer and System Sciences
Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Two-Layer planarization parameterized by feedback edge set
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On multiway cut parameterized above lower bounds
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Kernel bounds for path and cycle problems
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Simpler linear-time kernelization for planar dominating set
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Linear-Time computation of a linear problem kernel for dominating set on planar graphs
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Treewidth governs the complexity of target set selection
Discrete Optimization
A new view on Rural Postman based on Eulerian Extension and Matching
Journal of Discrete Algorithms
Parameterized Complexity
Constant thresholds can make target set selection tractable
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
| Hi-index | 0.00 |
Once having classified an NP-hard problem fixed-parameter tractable with respect to a certain parameter, the race for the most efficient fixed-parameter algorithm starts. Herein, the attention usually focuses on improving the running time factor exponential in the considered parameter, and, in case of kernelization algorithms, to improve the bound on the kernel size. Both from a practical as well as a theoretical point of view, however, there are further aspects of efficiency that deserve attention. We discuss several of these aspects and particularly focus on the search for "stronger parameterizations" in developing fixed-parameter algorithms.