-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Minimal Triangulations for Graphs with "Few" Minimal Separators
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Treewidth and minimum fill-in of weakly triangulated graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the treewidth and pathwidth of biconvex bipartite graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Hi-index | 0.00 |