Counting H-colorings of partial k-trees
Theoretical 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
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
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
Online promise problems with online width metrics
Journal of Computer and System Sciences
Cutwidth II: Algorithms for partial w-trees of bounded degree
Journal of Algorithms
Treewidth computations I. Upper bounds
Information and Computation
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and 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
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
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |