Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Planar graph decomposition and all pairs shortest paths
Journal of the ACM (JACM)
An efficient algorithm for the genus problem with explicit construction of forbidden subgraphs
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The complexity of querying indefinite data about linearly ordered domains
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Regular Article: On search, decision, and the efficiency of polynomial-time algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
Connections between cutting-pattern sequencing, VLSI Design, and flexible machines
Computers and Operations Research
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
On Random Intersection Graphs: The Subgraph Problem
Combinatorics, Probability and Computing
A multiple-population evolutionary approach to gate matrix layout
International Journal of Systems Science
Genome-Scale Computational Approaches to Memory-Intensive Applications in Systems Biology
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Information Processing Letters
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On problems without polynomial kernels
Journal of Computer and System Sciences
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Note: A decidability result for the dominating set problem
Theoretical Computer Science
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Fixed-Parameter tractability, a prehistory,
The Multivariate Algorithmic Revolution and Beyond
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.89 |