Graph drawing and graph theory

In the area of graph drawing, researchers have developed a large number of drawing styles appropriate for applications (network layouts, hierarchies, planar drawings, upward drawings, orthogonal drawings, inclusion drawings, trees, ...) and several metrics that evaluate the quality of a drawing (number of crossings, number of edge-bends, drawing height/area/volume, aspect ratio, resolution, edge length, etc). Based on these metrics algorithms that produce such drawings are developed and analyzed.

Recent publications

M. A. Bekos, S. Cornelsen, L. Grilli, S.H. Hong and M. Kaufmann: On the Recognition of Fan-Planar and Maximal Outer-Fan-Planar Graphs, In Proc. of 22nd International Symposium on Graph Drawing (GD 2014), To appear, 2014

E. N. Argyriou, M. A. Bekos, M. Kaufmann, A. Symvonis: Geometric RAC Simultaneous Drawings of Graphs, Journal of Graph Algorithms and Applications (JGAA), Vol. 17, no. 1, pp. 11-34, 2013. [PDF]

M. A. Bekos, M. Kaufmann, R. Krug, S. Naher and V. Roselli: Slanted Orthogonal Drawings, In Proc. of 21st International Symposium on Graph Drawing (GD 2013), LNCS 8242, pp. 244-255, 2013

E. N. Argyriou, M. A. Bekos, M. Kaufmann, A. Symvonis: On Metro-Line Crossing Minimization, Journal of Graph Algorithms and Applications (JGAA), Vol. 14, no. 1, pp. 75-96, 2010. [PDF]