Efficient decomposition of polygons into L-shapes with application to VLSI layouts
ACM Transactions on Design Automation of Electronic Systems (TODAES)
On floorplans of planar graphs
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Nostradamus: a floorplanner of uncertain design
ISPD '98 Proceedings of the 1998 international symposium on Physical design
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Constrained polygon transformations for incremental floorplanning
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Some Applications of Orderly Spanning Trees in Graph Drawing
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Simple and efficient floor-planning
Information Processing Letters
Compact floor-planning via orderly spanning trees
Journal of Algorithms
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Octagonal drawings of plane graphs with prescribed face areas
Computational Geometry: Theory and Applications
Drawing slicing graphs with face areas
Theoretical Computer Science
A Compact Encoding of Rectangular Drawings with Efficient Query Supports
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Orthogonal cartograms with few corners per face
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Improved floor-planning of graphs via adjacency-preserving transformations
Journal of Combinatorial Optimization
Inner rectangular drawings of plane graphs
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Octagonal drawings of plane graphs with prescribed face areas
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Proportional contact representations of planar graphs
GD'11 Proceedings of the 19th international conference on Graph Drawing
Linear-time algorithms for hole-free rectilinear proportional contact graph representations
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Computing cartograms with optimal complexity
Proceedings of the twenty-eighth annual symposium on Computational geometry
Proportional contact representations of 4-connected planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Edge-Weighted contact representations of planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |