Antonios Symvonis
Antonios Symvonis
National Technical U. of Athens
Verified email at - Homepage
Cited by
Cited by
Boundary labeling: Models and efficient algorithms for rectangular maps
MA Bekos, M Kaufmann, A Symvonis, A Wolff
Computational Geometry 36 (3), 215-236, 2007
Drawing graphs in the plane with high resolution
M Formann, T Hagerup, J Haralambides, M Kaufmann, FT Leighton, ...
SIAM Journal on Computing 22 (5), 1035-1052, 1993
Three-dimensional orthogonal graph drawing algorithms
P Eades, A Symvonis, S Whitesides
Discrete Applied Mathematics 103 (1-3), 55-87, 2000
Boundary labeling with octilinear leaders
MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis
Algorithmica 57 (3), 436-461, 2010
Two algorithms for three dimensional orthogonal graph drawing
P Eades, A Symvonis, S Whitesides
Graph Drawing: Symposium on Graph Drawing, GD'96 Berkeley, California, USA …, 1997
The Straight-Line RAC Drawing Problem is NP-Hard.
EN Argyriou, MA Bekos, A Symvonis
J. Graph Algorithms Appl. 16 (2), 569-597, 2012
Maximizing the total resolution of graphs
EN Argyriou, MA Bekos, A Symvonis
Graph Drawing: 18th International Symposium, GD 2010, Konstanz, Germany …, 2011
Optimal stable merging
A Symvonis
The Computer Journal 38 (8), 681-690, 1995
Fan-planarity: Properties and complexity
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Theoretical Computer Science 589, 76-86, 2015
Line crossing minimization on metro maps
MA Bekos, M Kaufmann, K Potika, A Symvonis
Graph Drawing: 15th International Symposium, GD 2007, Sydney, Australia …, 2008
Smooth orthogonal layouts
MA Bekos, M Kaufmann, SG Kobourov, A Symvonis
International Symposium on Graph Drawing, 150-161, 2012
Monotone drawings of graphs with fixed embedding
P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ...
Algorithmica 71, 233-257, 2015
Drawing trees in a streaming model
C Binucci, U Brandes, G Di Battista, W Didimo, M Gaertler, P Palladino, ...
Information Processing Letters 112 (11), 418-422, 2012
On the perspectives opened by right angle crossing drawings
P Angelini, L Cittadini, G Di Battista, W Didimo, F Frati, M Kaufmann, ...
Journal of Graph Algorithms and Applications 15 (1), 53-78, 2011
Computing upward topological book embeddings of upward planar digraphs
F Giordano, G Liotta, T Mchedlidze, A Symvonis
Algorithms and Computation: 18th International Symposium, ISAAC 2007, Sendai …, 2007
Multi-stack boundary labeling problems
MA Bekos, M Kaufmann, K Potika, A Symvonis
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006
Area-feature boundary labeling
MA Bekos, M Kaufmann, K Potika, A Symvonis
The Computer Journal 53 (6), 827-841, 2010
Polygon labelling of minimum leader length
MA Bekos, M Kaufmann, K Potika, A Symvonis
APVis, 15-21, 2006
Geometric RAC simultaneous drawings of graphs
E Argyriou, M Bekos, M Kaufmann, A Symvonis
Computing and Combinatorics: 18th Annual International Conference, COCOON …, 2012
The straight-line RAC drawing problem is NP-hard
EN Argyriou, MA Bekos, A Symvonis
International Conference on Current Trends in Theory and Practice of …, 2011
The system can't perform the operation now. Try again later.
Articles 1–20