Placement of the Processors of a Hypercube
IEEE Transactions on Computers
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
Improved bandwidth approximation for trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Bandwidth of Split and Circular Permutation Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
The bandwidth minimization problem for cyclic caterpillars with hair length 1 is NP-complete
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Equitable colorings of bounded treewidth graphs
Theoretical Computer Science - Graph colorings
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters
Spectral techniques for graph bisection in genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Graph bandwidth of weighted caterpillars
Theoretical Computer Science - Algorithmic applications in management
Note: Cyclic bandwidth with an edge added
Discrete Applied Mathematics
Minimal proper interval completions
Information Processing Letters
Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Graph-Theoretic Concepts in Computer Science
Random Generation and Enumeration of Proper Interval Graphs
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Exact and Approximate Bandwidth
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Bandwidth of bipartite permutation graphs in polynomial time
Journal of Discrete Algorithms
Phase Transition in the Bandwidth Minimization Problem
MICAI '09 Proceedings of the 8th Mexican International Conference on Artificial Intelligence
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters
Approximating bandwidth by mixing layouts of interval graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Bandwidth of bipartite permutation graphs in polynomial time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Exact and approximate bandwidth
Theoretical Computer Science
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences
Theoretical Computer Science
Bandwidth of convex bipartite graphs and related graphs
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Theoretical Computer Science
ACM Transactions on Algorithms (TALG)
Minimal proper interval completions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Approximating the bandwidth of caterpillars
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Graph bandwidth of weighted caterpillars
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Optimal linear arrangement of interval graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Bandwidth of convex bipartite graphs and related graphs
Information Processing Letters
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
| Hi-index | 0.01 |