Information Technology Reference
In-Depth Information
References
1. Babu, J., Basavaraju, M., Chandran Leela, S., Rajendraprasad, D.: 2-connecting
outerplanar graphs without blowing up the pathwidth. In: Du, D.-Z., Zhang, G.
(eds.) COCOON 2013. LNCS, vol. 7936, pp. 626-637. Springer, Heidelberg (2013)
2. Biedl, T.: A 4-approximation for the height of drawing 2-connected outer-planar
graphs. In: Erlebach, T., Persiano, G. (eds.) WAOA 2012. LNCS, vol. 7846, pp.
272-285. Springer, Heidelberg (2013)
3. Biedl, T., Lubiw, A., Petrick, M., Spriggs, M.J.: Morphing orthogonal planar graph
drawings. ACM Transactions on Algorithms 9(4), 29 (2013)
4. Biedl, T., Blasius, T., Niedermann, B., Nollenburg, M., Prutkin, R., Rutter, I.:
Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other
Grid-Based Graph Drawings. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS,
vol. 8242, pp. 460-471. Springer, Heidelberg (2013)
5. Chimani,M.,Zeranski,R.:Upward planarity testingviaSAT.In:Didimo,W.,Patrig-
nani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 248-259. Springer, Heidelberg (2013)
6. Dujmovic, V., Fellows, M., Kitching, M., Liotta, G., McCartin, C., Nishimura,
N., Ragde, P., Rosamond, F., Whitesides, S., Wood, D.: On the parameterized
complexity of layered graph drawing. Algorithmica 52, 267-292 (2008)
7. Felsner, S., Liotta, G., Wismath, S.: Straight-line drawings on restricted integer
grids in two and three dimensions. Journal of Graph Algorithms and Applica-
tions 7(4), 335-362 (2003)
8. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid.
Combinatorica 10, 41-51 (1990)
9. Garg, A., Tamassia, R.: On the computational complexity of upward and rectilinear
planarity testing. SIAM J. Comput. 31(2), 601-625 (2001)
10. He, X., Wang, J., Zhang, H.: Compact visibility representation of 4-connected plane
graphs. Theor. Comput. Sci. 447, 62-73 (2012)
11. Hoffmann, M., van Kreveld, M., Kusters, V., Rote, G.: Quality ratios of measures
for graph drawing styles. In: Canadian Conference on Computational Geometry,
CCCG 2014 (to appear, 2014)
12. Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16,
4-32 (1996)
13. Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. Teub-
ner/Wiley & Sons, Stuttgart/Chicester (1990)
14. Miura, K., Nakano, S., Nishizeki, T.: Convex grid drawings of four-connected plane
graphs. Int. J. Found. Comput. Sci. 17(5), 1031-1060 (2006)
15. Pach, J., Toth, G.: Monotone drawings of planar graphs. Journal of Graph The-
ory 46(1), 39-47 (2004)
16. Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientation of
planar graphs. Discrete Computational Geometry 1, 343-353 (1986)
17. Schnyder, W.: Embedding planar graphs on the grid. In: ACM-SIAM Symposium
on Discrete Algorithms (SODA 1990), pp. 138-148 (1990)
18. Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Computa-
tional Geometry: Theory and Applications 9, 159-180 (1998)
19. Biedl, T., Kaufmann, M., Mutzel, P.: Drawing planar partitions II: HH-drawings.
In: Hromkovic, J., Sykora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 124-136.
Springer, Heidelberg (1998)
20. Tamassia, R., Tollis, I.: A unified approach to visibility representations of planar
graphs. Discrete Computational Geometry 1, 321-341 (1986)
21. Wismath, S.: Characterizing bar line-of-sight graphs. In: ACM Symposium on
Computational Geometry (SoCG 1985), pp. 147-152 (1985)
