Author:
Alam M. Jawaherul,Biedl Therese,Felsner Stefan,Gerasch Andreas,Kaufmann Michael,Kobourov Stephen G.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference28 articles.
1. Lecture Notes in Computer Science;M.J. Alam,2011
2. Alam, M.J., Biedl, T.C., Felsner, S., Kaufmann, M., Kobourov, S.G., Ueckerdt, T.: Computing cartograms with optimal complexity. In: Symposium on Computational Geometry (SoCG’12), pp. 21–30. ACM, New York (2012)
3. de Berg, M., Mumford, E., Speckmann, B.: On rectilinear duals for vertex-weighted plane graphs. Discrete Math. 309(7), 1794–1812 (2009)
4. Lecture Notes in Computer Science;T.C. Biedl,2011
5. Biedl, T.C., Velázquez, L.E.R.: Drawing planar 3-trees with given face areas. Comput. Geom. 46(3), 276–285 (2013)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Order-Preserving 1-String Representations of Planar Graphs;SOFSEM 2017: Theory and Practice of Computer Science;2017
2. On Contact Graphs with Cubes and Proportional Boxes;Lecture Notes in Computer Science;2016
3. Constrained floorplans in 2D and 3D;Theoretical Computer Science;2015-11
4. Quantitative Measures for Cartogram Generation Techniques;Computer Graphics Forum;2015-06
5. Shifting Segments to Optimality;Gems of Combinatorial Optimization and Graph Algorithms;2015