The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete
SIAM Journal on Algebraic and Discrete Methods
On the probable performance of Heuristics for bandwidth minimization
SIAM Journal on Computing
Finding the minimum bandwidth of an interval graph
Information and Computation
The Johnson-Lindenstrauss Lemma and the sphericity of some graphs
Journal of Combinatorial Theory Series A
Graphs with small bandwidth and cutwidth
Discrete Mathematics
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Handbook of combinatorics (vol. 1)
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Computer Solution of Large Sparse Positive Definite
Computer Solution of Large Sparse Positive Definite
Approximating the Bandwidth for Asteroidal Triple-Free Graphs
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Reducing the bandwidth of sparse symmetric matrices
ACM '69 Proceedings of the 1969 24th national conference
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
An Approximation Algorithm for the Bandwidth Problem on Dense Graphs
On Approximation Intractability of the Bandwidth Problem
On Approximation Intractability of the Bandwidth Problem
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Small distortion and volume preserving embeddings for planar and Euclidean metrics
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Improved bandwidth approximation for trees
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
A lower bound on the distortion of embedding planar metrics into Euclidean space
Proceedings of the eighteenth annual symposium on Computational geometry
Coping with the NP-Hardness of the Graph Bandwidth Problem
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On Euclidean Embeddings and Bandwidth Minimization
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Bandwidth of Split and Circular Permutation Graphs
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Cuts, Trees and -Embeddings of Graphs
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Approximating metrics by tree metrics
ACM SIGACT News
A tight bound on approximating arbitrary metrics by tree metrics
Journal of Computer and System Sciences - Special issue: STOC 2003
Efficient algorithms for online decision problems
Journal of Computer and System Sciences - Special issue: Learning theory 2003
A divide and conquer algorithm for d-dimensional arrangement
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Near Optimal Dimensionality Reductions That Preserve Volumes
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
Graph Theory, Computational Intelligence and Thought
Bandwidth of bipartite permutation graphs in polynomial time
Journal of Discrete Algorithms
Bandwidth of bipartite permutation graphs in polynomial time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Bandwidth and low dimensional embedding
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Embedding bounded bandwidth graphs into ℓ1
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Bandwidth and low dimensional embedding
Theoretical Computer Science
| Hi-index | 0.00 |