Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles

Kaufmann, Michael and Kottler, Stephan (2010) Proving or Disproving Planar Straight-Line Embeddability onto Given Rectangles. In: Graph Drawing 17th International Symposium, GD 2009, September 22-25, 2009, Chicago, IL, USA , pp. 419-420 (Official URL: http://dx.doi.org/10.1007/978-3-642-11805-0_44).

Full text not available from this repository.


Item Type:Conference Paper
Additional Information:10.1007/978-3-642-11805-0_44
Classifications:G Algorithms and Complexity > G.070 Area / Edge Length
G Algorithms and Complexity > G.490 Embeddings
P Styles > P.720 Straight-line
P Styles > P.540 Planar
ID Code:1093

Repository Staff Only: item control page

References

Open Graph Drawing Framework, http://www.ogdf.net

Frati, F., Patrignani, M.: A note on minimum area straight-line drawings of planar graphs. In: 15th International Symposium on Graph Drawing (2007)

Kottler, S.: Solver descriptions for the SAT competition (2009), satcompetition.org

Krug, M.: Minimizing the area for planar straight-line grid drawings. Master’s thesis, University of Karlsruhe (2007)

Krug, M., Wagner, D.: Minimizing the area for planar straight-line grid drawings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 207–212. Springer, Heidelberg (2008)