Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
The complexity of finding uniform emulations on paths and ring networks
Information and Computation
Easy problems for tree-decomposable graphs
Journal of Algorithms
Parametric Module Allocation on Partial k-Trees
IEEE Transactions on Computers
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
Parameterized learning complexity
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Triangulating vertex colored graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Parameterized Complexity of Some Problems in Logic and Linguistics
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Fixed-Parameter Complexity and Cryptography
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Fixed-Parameter Intractability II (Extended Abstract)
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
DNA Physical Mapping: Three Ways Difficult
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Two Strikes Against Perfect Phylogeny
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Linear algorithms on k-terminal graphs
Linear algorithms on k-terminal graphs
Parameterized Complexity
Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Confronting hardness using a hybrid approach
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Online promise problems with online width metrics
Journal of Computer and System Sciences
Graph-Theoretic Concepts in Computer Science
Exact and Approximate Bandwidth
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distortion Is Fixed Parameter Tractable
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Parameterized complexity and approximability of the SLCS problem
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Bandwidth of bipartite permutation graphs in polynomial time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Exact and approximate bandwidth
Theoretical Computer Science
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Bandwidth and distortion revisited
Discrete Applied Mathematics
Parameterized complexity and approximability of the Longest Compatible Sequence problem
Discrete Optimization
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
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
European Journal of Combinatorics
Distortion is Fixed Parameter Tractable
ACM Transactions on Computation Theory (TOCT)
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
| Hi-index | 0.00 |