A survey of graph layout problems
ACM Computing Surveys (CSUR)
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Simple cuts are fast and good: optimum right-angled cuts in solid grids
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume 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
Restricted cuts for bisections in solid grids: a proof via polygons
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Computer Science Review
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 |