Efficient algorithms for combinatorial problems on graphs with bounded, decomposability—a survey
BIT - Ellis Horwood series in artificial intelligence
Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
The NP-completeness column: an ongoing guide
Journal of Algorithms
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Nonconstructive advances in polynomial-time complexity
Information Processing Letters
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
Linear time algorithms for NP-hard problems restricted to partial k-trees
Discrete Applied Mathematics
On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Graph minors. IV. Tree-width and well-quasi-ordering
Journal of Combinatorial Theory Series B
The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Improved self-reduction algorithms for graphs with bounded treewidth
WG '89 Proceedings of the fifteenth international workshop on Graph-theoretic concepts in computer science
The pathwidth and treewidth of cographs
SWAT '90 Proceedings of the second Scandinavian workshop on Algorithm theory
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
Finding minimal forbidden minors using a finite congruence
Proceedings of the 18th international colloquium on Automata, languages and programming
Better algorithms for the pathwidth and treewidth of graphs
Proceedings of the 18th international colloquium on Automata, languages and programming
Handbook of theoretical computer science (vol. A)
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Dynamic Programming on Graphs with Bounded Treewidth
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
An Algebraic Theory of Graph Reduction
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Monadic Second-Order Evaluations on Tree-Decomposable Graphs
WG '91 Proceedings of the 17th International Workshop
Linear algorithms on k-terminal graphs
Linear algorithms on k-terminal graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An optimization method for the channel assignment in mixed environments
MobiCom '95 Proceedings of the 1st annual international conference on Mobile computing and networking
Towards a syntactic characterization of PTAS
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Embeddings of k-Connected Graphs of Pathwidth k
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Constraint satisfaction, databases, and logic
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Parameterizing Cut Sets in a Graph by the Number of Their Components
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
Proceedings of the 13th International Conference on Extending Database Technology
Locating facilities on a network to minimize their average service radius
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Learning to integrate deduction and search in reasoning about quantified boolean formulas
FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
A practical algorithm for finding optimal triangulations
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Decomposition width of matroids
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Efficient graph reachability query answering using tree decomposition
RP'10 Proceedings of the 4th international conference on Reachability problems
The density maximization problem in graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Parameterizing cut sets in a graph by the number of their components
Theoretical Computer Science
A sufficiently fast algorithm for finding close to optimal junction trees
UAI'96 Proceedings of the Twelfth international conference on Uncertainty in artificial intelligence
On graph contractions and induced minors
Discrete Applied Mathematics
Decomposition width of matroids
Discrete Applied Mathematics
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory
New complexity results for MAP in Bayesian networks
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
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
Drawing planar 3-trees with given face areas
Computational Geometry: Theory and Applications
Parameterized complexity of discrete morse theory
Proceedings of the twenty-ninth annual symposium on Computational geometry
Computing cooperative solution concepts in coalitional skill games
Artificial Intelligence
The density maximization problem in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.02 |