STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
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
Analogs and Duals of teh MAST Problem for Sequences and Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Two algorithms for general list matrix partitions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Parameterized power domination complexity
Information Processing Letters
Efficient algorithms for counting parameterized list H-colorings
Journal of Computer and System Sciences
Improved algorithms for feedback vertex set problems
Journal of Computer and System Sciences
A Fixed-Parameter Enumeration Algorithm for the Weighted FVS Problem
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Parameterized power domination complexity
Information Processing Letters
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
Kernelizations for parameterized counting problems
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
A quartic kernel for pathwidth-one vertex deletion
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Subset feedback vertex set is fixed-parameter tractable
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On parameterized independent feedback vertex set
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Dominating set is fixed parameter tractable in claw-free graphs
Theoretical Computer Science
On feedback vertex set new measure and new structures
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
A parameterized complexity tutorial
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Book review: Invitation to fixed-parameter algorithms
Computer Science Review
W[2]-hardness of precedence constrained K-processor scheduling
Operations Research Letters
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
On Parameterized Independent Feedback Vertex Set
Theoretical Computer Science
Improved algorithms for the feedback vertex set problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The exponential time hypothesis and the parameterized clique problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Efficient derivation of numerical dependencies
Information Systems
On group feedback vertex set parameterized by the size of the cutset
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |