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
An algebraic theory of graph reduction
Journal of the ACM (JACM)
Counting H-colorings of partial k-trees
Theoretical Computer Science
Safe Reduction Rules for Weighted Treewidth
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Cutwidth II: algorithms for partial w-trees of bounded degree
Journal of Algorithms
A semidefinite programming approach to tensegrity theory and realizability of graphs
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
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Treewidth: structure and algorithms
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Proper and planar drawings of graphs on three layers
GD'05 Proceedings of the 13th international conference on Graph Drawing
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |