Fast Approximate Graph Partitioning Algorithms
SIAM Journal on Computing
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Two Counterexamples in Graph Drawing
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
VLSI layout of trees into grids of minimum width
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
New theoretical results on quadratic placement
Integration, the VLSI Journal
Inserting a vertex into a planar graph
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Bounds for convex crossing numbers
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Approximating the crossing number of graphs embeddable in any orientable surface
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Facets in the Crossing Number Polytope
SIAM Journal on Discrete Mathematics
Vertex insertion approximates the crossing number of apex graphs
European Journal of Combinatorics
Progress on crossing number problems
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
| Hi-index | 0.00 |