The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The pathwidth and treewidth of cographs
SIAM Journal on Discrete Mathematics
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree
Journal of Algorithms
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Journal of the ACM (JACM)
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On the efficiency of polynomial time approximation schemes
Information Processing Letters
An improved fixed-parameter algorithm for vertex cover
Information Processing Letters
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
Vertex cover: further observations and further improvements
Journal of Algorithms
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Treewidth and Pathwidth of Permutation Graphs
ICALP '93 Proceedings of the 20th International Colloquium on Automata, Languages and Programming
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Scalable Parallel Algorithms for FPT Problems
Algorithmica
Invitation to data reduction and problem kernelization
ACM SIGACT News
A Faster FPT Algorithm for the Maximum Agreement Forest Problem
Theory of Computing Systems
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
On Problems without Polynomial Kernels (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Approximating rank-width and clique-width quickly
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Linear kernels in linear time, or how to save k colors in O(n2) steps
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On parameterized approximability
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximation problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding odd cycle transversals
Operations Research Letters
Parameterized Complexity
An Overview of Techniques for Designing Parameterized Algorithms
The Computer Journal
Parameterized Complexity and Approximation Algorithms
The Computer Journal
The Computer Journal Special Issue on Parameterized Complexity
The Computer Journal
| Hi-index | 0.00 |