A survey of graph layout problems
ACM Computing Surveys (CSUR)
On approximating the maximum diameter ratio of graphs
Discrete Mathematics - Algebraic and topological methods in graph theory
Property testing of data dimensionality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Lower Bounds for Embedding Graphs into Graphs of Smaller Characteristic
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The intrinsic dimensionality of graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Interval degree and bandwidth of a graph
Discrete Applied Mathematics
Algorithms for graphs with small octopus
Discrete Applied Mathematics
Low distortion maps between point sets
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Virtual coordinates for ad hoc and sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Low-distortion embeddings of general metrics into the line
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of low-distortion embeddings between point sets
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for low-distortion embeddings into low-dimensional spaces
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Volume distortion for subsets of Euclidean spaces: extended abstract
Proceedings of the twenty-second annual symposium on Computational geometry
Graph bandwidth of weighted caterpillars
Theoretical Computer Science - Algorithmic applications in management
Laying Out Sparse Graphs with Provably Minimum Bandwidth
INFORMS Journal on Computing
Labeling schemes for weighted dynamic trees
Information and Computation
European Journal of Combinatorics
Dynamic routing schemes for graphs with low local density
ACM Transactions on Algorithms (TALG)
Graph-Theoretic Concepts in Computer Science
Information Processing Letters
Exact and Approximate Bandwidth
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Good quality virtual realization of unit ball graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Complexity and algorithms for well-structured k-SAT instances
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Volume in general metric spaces
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Hardness results for approximating the bandwidth
Journal of Computer and System Sciences
Low Distortion Maps Between Point Sets
SIAM Journal on Computing
Manipulating MDD relaxations for combinatorial optimization
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
On multiplicative λ-approximations and some geometric applications
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
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
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
Distance approximating trees: complexity and algorithms
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Optimal linear arrangement of interval graphs
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Optimal distortion embedding of complete binary trees into lines
Information Processing Letters
An exponential time 2-approximation algorithm for bandwidth
Theoretical Computer Science
BDD-based heuristics for binary optimization
Journal of Heuristics
| Hi-index | 0.00 |