The Effect of Almost-Empty Faces on Planar Kandinsky Drawings
暂无分享,去创建一个
[1] Der-San Chen,et al. Applied Integer Programming: Modeling and Solution , 2010 .
[2] Alexander Wolff,et al. Graph Drawing and Cartography , 2013, Handbook of Graph Drawing and Visualization.
[3] Leslie G. Valiant,et al. Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.
[4] Michael Kaufmann,et al. Orthogonal graph drawing with constraints , 2000, SODA '00.
[5] Ignaz Rutter,et al. Complexity of Higher-Degree Orthogonal Graph Embedding in the Kandinsky Model , 2014, ESA.
[6] Charles E. Leiserson,et al. Area-efficient graph layouts , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[7] Walter Didimo,et al. Orthogonal and Quasi-upward Drawings with Vertices of Prescribed Size , 1999, GD.
[8] Roberto Tamassia,et al. Handbook on Graph Drawing and Visualization , 2013 .
[9] Michael Kaufmann,et al. Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.
[10] Walter Didimo,et al. Computing Orthogonal Drawings with the Minimum Number of Bends , 1997, IEEE Trans. Computers.
[11] Sándor P. Fekete,et al. Orthogonal Graph Drawing , 2001, Drawing Graphs.
[12] Wilhelm Barth,et al. A New Approximation Algorithm for Bend Minimization in the Kandinsky Model , 2006, GD.
[13] Roberto Tamassia,et al. On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..
[14] Michael Kaufmann,et al. Fast Compaction for Orthogonal Drawings with Vertices of Prescribed Size , 2001, GD.
[15] Michael A. Bekos,et al. Slanted Orthogonal Drawings , 2013, Graph Drawing.
[16] Markus Eiglsperger,et al. Caesar Automatic Layout of UML Class Diagrams , 2001, GD.