Antonios Symvonis
Antonios Symvonis
National Technical U. of Athens
Bestätigte E-Mail-Adresse bei math.ntua.gr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Boundary labeling: Models and efficient algorithms for rectangular maps
MA Bekos, M Kaufmann, A Symvonis, A Wolff
Computational Geometry 36 (3), 215-236, 2007
1332007
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
1231993
Three-dimensional orthogonal graph drawing algorithms
P Eades, A Symvonis, S Whitesides
Discrete Applied Mathematics 103 (1-3), 55-87, 2000
632000
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
622011
Two algorithms for three dimensional orthogonal graph drawing
P Eades, A Symvonis, S Whitesides
International Symposium on Graph Drawing, 139-154, 1996
481996
Boundary labeling with octilinear leaders
MA Bekos, M Kaufmann, M Nöllenburg, A Symvonis
Algorithmica 57 (3), 436-461, 2010
432010
Optimal stable merging
A Symvonis
The Computer Journal 38 (8), 681-690, 1995
431995
Smooth orthogonal layouts
MA Bekos, M Kaufmann, SG Kobourov, A Symvonis
International Symposium on Graph Drawing, 150-161, 2012
392012
Line crossing minimization on metro maps
MA Bekos, M Kaufmann, K Potika, A Symvonis
International Symposium on Graph Drawing, 231-242, 2007
362007
Maximizing the total resolution of graphs
EN Argyriou, MA Bekos, A Symvonis
International Symposium on Graph Drawing, 62-67, 2010
342010
Monotone drawings of graphs with fixed embedding
P Angelini, W Didimo, S Kobourov, T Mchedlidze, V Roselli, A Symvonis, ...
Algorithmica 71 (2), 233-257, 2015
33*2015
Fan-planarity: Properties and complexity
C Binucci, E Di Giacomo, W Didimo, F Montecchiani, M Patrignani, ...
Theoretical Computer Science 589, 76-86, 2015
322015
Preventing unraveling in social networks gets harder
RH Chitnis, FV Fomin, PA Golovach
Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013
302013
Drawing trees in a streaming model
C Binucci, U Brandes, G Di Battista, W Didimo, M Gaertler, P Palladino, ...
International Symposium on Graph Drawing, 292-303, 2009
302009
Multi-stack boundary labeling problems
MA Bekos, M Kaufmann, K Potika, A Symvonis
International Conference on Foundations of Software Technology and …, 2006
292006
Computing upward topological book embeddings of upward planar digraphs
F Giordano, G Liotta, T Mchedlidze, A Symvonis
International Symposium on Algorithms and Computation, 172-183, 2007
282007
On the Perspectives Opened by Right Angle Crossing Drawings.
P Angelini, L Cittadini, W Didimo, F Frati, G Di Battista, M Kaufmann, ...
J. Graph Algorithms Appl. 15 (1), 53-78, 2011
272011
Polygon labelling of minimum leader length
MA Bekos, M Kaufmann, K Potika, A Symvonis
APVis, 15-21, 2006
262006
On the perspectives opened by right angle crossing drawings
P Angelini, L Cittadini, G Di Battista, W Didimo, F Frati, M Kaufmann, ...
International Symposium on Graph Drawing, 21-32, 2009
252009
Dimension-exchange algorithms for load balancing on trees
ME Houle, A Symvonis, DR Wood
Procs. of 9th Int. Colloquium on Structural Information and Communication …, 2002
252002
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20