Isoperimetric numbers of graphs
Journal of Combinatorial Theory Series B
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Applying Parallel Computation Algorithms in the Design of Serial 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
Time/space tradeoffs for polygon mesh rendering
ACM Transactions on Graphics (TOG)
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Constant factor approximation of vertex-cuts in planar graphs
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Throughput-driven synthesis of embedded software for pipelined execution on multicore architectures
ACM Transactions on Embedded Computing Systems (TECS)
Determining edge expansion and other connectivity measures of graphs of bounded genus
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
An O(n4) time algorithm to compute the bisection width of solid grid graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
A polynomial-time approximation scheme for planar multiway cut
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Quadrilateral surface meshes without self-intersecting dual cycles for hexahedral mesh generation
Computational Geometry: Theory and Applications
Fast balanced partitioning is hard even on grids and trees
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |