Machine models and linear time complexity
ACM SIGACT News
How hard are n2-hard problems?
ACM SIGACT News
ACM SIGACT News
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The inapproximability of non-NP-hard optimization problems
Theoretical 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
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Vertex Cover: Further Observations and Further Improvements
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Refined memorization for vertex cover
Information Processing Letters
A two-pronged attack on the dragon of intractability
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
Theoretical Computer Science - Parameterized and exact computation
Crown reductions for the Minimum Weighted Vertex Cover problem
Discrete Applied Mathematics
The complexity of fixed-parameter problems: guest column
ACM SIGACT News
Efficient algorithms for counting parameterized list H-colorings
Journal of Computer and System Sciences
Linear kernelizations for restricted 3-Hitting Set problems
Information Processing Letters
On parameterized exponential time complexity
Theoretical Computer Science
On Parameterized Exponential Time Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Refined memorization for vertex cover
Information Processing Letters
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
A kernelization algorithm for d-Hitting Set
Journal of Computer and System Sciences
The parameterized complexity of editing graphs for bounded degeneracy
Theoretical Computer Science
Improved upper bounds for vertex cover
Theoretical Computer Science
Parameterized complexity of coloring problems: Treewidth versus vertex cover
Theoretical Computer Science
Multicut in trees viewed through the eyes of vertex cover
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Kernels for the vertex cover problem on the preferred attachment model
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
Connectivity is not a limit for kernelization: planar connected dominating set
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Improved parameterized upper bounds for vertex cover
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Parameterized problems on coincidence graphs
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Safe approximation and its relation to kernelization
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Multicut in trees viewed through the eyes of vertex cover
Journal of Computer and System Sciences
Discrete Optimization
Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
Theoretical Computer Science
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
Kernelization hardness of connectivity problems in d-degenerate graphs
Discrete Applied Mathematics
Kernelization algorithms for d-hitting set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
European Journal of Combinatorics
| Hi-index | 0.01 |