Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Characterization and recognition of partial 3-trees
SIAM Journal on Algebraic and Discrete Methods
Linear-time computation of optimal subgraphs of decomposable graphs
Journal of Algorithms
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
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
Forbidden minors characterization of partial 3-trees
Discrete Mathematics
Easy problems for tree-decomposable graphs
Journal of Algorithms
Algorithms finding tree-decompositions of graphs
Journal of Algorithms
Graph minors: X. obstructions to tree-decomposition
Journal of Combinatorial Theory Series B
Better algorithms for the pathwidth and treewidth of graphs
Proceedings of the 18th international colloquium on Automata, languages and programming
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Improved self-reduction algorithms for graphs with bounded treewidth
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
The nonexistence of reduction rules giving an embedding into a k-tree
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract)
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
Graphs as Relational Structures: An Algebraic an Logical Approach
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
The Monadic Second-Order Logic of Graphs: Definable Sets of Finite Graphs
WG '88 Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science
Linear algorithms on k-terminal graphs
Linear algorithms on k-terminal graphs
Graph Theory With Applications
Graph Theory With Applications
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Listing all potential maximal cliques of a graph
Theoretical Computer Science
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
A Linear Algorithm for Finding Total Colorings of Partial k-Trees
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
An Improved Algorithm for Finding Tree Decompositions of Small Width
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Some Applications of the Decidability of DPDA's Equivalence
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Algorithms for vertex-partitioning problems on graphs with fixed clique-width
Theoretical Computer Science
Iterative-free program analysis
ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
The recognizability of sets of graphs is a robust property
Theoretical Computer Science
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
Algorithms for finding distance-edge-colorings of graphs
Journal of Discrete Algorithms
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Pre-processing for triangulation of probabilistic networks
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Algorithms for finding distance-edge-colorings of graphs
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Minimizing nLC-width is nP-complete
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Graph transformation in constant time
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Confluence of graph transformation revisited
Processes, Terms and Cycles
On the algorithmic effectiveness of digraph decompositions and complexity measures
Discrete Optimization
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.01 |