Approximating the bandwidth via volume respecting embeddings (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A wide-range efficient algorithm for minimal triangulation
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved bandwidth approximation for trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Listing all potential maximal cliques of a graph
Theoretical Computer Science
On claw-free asteroidal triple-free graphs
Discrete Applied Mathematics
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Listing All Potential Maximal Cliques of a Graph
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Claw-Free Asteroidal Triple-Free Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Discrete Applied Mathematics
Efficient algorithms for Roman domination on some classes of graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Hardness and approximation of minimum distortion embeddings
Information Processing Letters
Treewidth and minimum fill-in of weakly triangulated graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Approximating bandwidth by mixing layouts of interval graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Bandwidth of convex bipartite graphs and related graphs
Information Processing Letters
Hi-index | 0.00 |