2009 |
47 | EE | Tamara Mchedlidze,
Antonios Symvonis:
Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.
WALCOM 2009: 250-261 |
46 | EE | Tamara Mchedlidze,
Antonios Symvonis:
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs
CoRR abs/0904.2129: (2009) |
2008 |
45 | EE | Evmorfia Argyriou,
Michael A. Bekos,
Michael Kaufmann,
Antonios Symvonis:
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.
Graph Drawing 2008: 336-347 |
44 | EE | Tamara Mchedlidze,
Antonios Symvonis:
Spine Crossing Minimization in Upward Topological Book Embeddings.
Graph Drawing 2008: 445-446 |
43 | EE | Michael A. Bekos,
Michael Kaufmann,
Martin Nöllenburg,
Antonios Symvonis:
Boundary Labeling with Octilinear Leaders.
SWAT 2008: 234-245 |
42 | EE | Tamara Mchedlidze,
Antonios Symvonis:
Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)
CoRR abs/0807.2330: (2008) |
41 | EE | Michael A. Bekos,
Michael Kaufmann,
Antonios Symvonis:
Efficient Labeling of Collinear Sites.
J. Graph Algorithms Appl. 12(3): 357-380 (2008) |
2007 |
40 | EE | Michael A. Bekos,
Michael Kaufmann,
Antonios Symvonis:
Labeling collinear sites.
APVIS 2007: 45-51 |
39 | EE | Ulrik Brandes,
Cesim Erten,
J. Joseph Fowler,
Fabrizio Frati,
Markus Geyer,
Carsten Gutwenger,
Seok-Hee Hong,
Michael Kaufmann,
Stephen G. Kobourov,
Giuseppe Liotta,
Petra Mutzel,
Antonios Symvonis:
Colored Simultaneous Geometric Embeddings.
COCOON 2007: 254-263 |
38 | EE | Michael A. Bekos,
Michael Kaufmann,
Katerina Potika,
Antonios Symvonis:
Line Crossing Minimization on Metro Maps.
Graph Drawing 2007: 231-242 |
37 | EE | Francesco Giordano,
Giuseppe Liotta,
Tamara Mchedlidze,
Antonios Symvonis:
Computing Upward Topological Book Embeddings of Upward Planar Digraphs.
ISAAC 2007: 172-183 |
36 | EE | Michael A. Bekos,
Michael Kaufmann,
Antonios Symvonis,
Alexander Wolff:
Boundary labeling: Models and efficient algorithms for rectangular maps.
Comput. Geom. 36(3): 215-236 (2007) |
2006 |
35 | EE | Michael A. Bekos,
Michael Kaufmann,
Katerina Potika,
Antonios Symvonis:
Polygon labelling of minimum leader length.
APVIS 2006: 15-21 |
34 | EE | Michael A. Bekos,
Michael Kaufmann,
Katerina Potika,
Antonios Symvonis:
Multi-stack Boundary Labeling Problems.
FSTTCS 2006: 81-92 |
2005 |
33 | EE | Michael A. Bekos,
Antonios Symvonis:
BLer: A Boundary Labeller for Technical Drawings.
Graph Drawing 2005: 503-504 |
32 | EE | Michael A. Bekos,
Michael Kaufmann,
Katerina Potika,
Antonios Symvonis:
Boundary Labelling of Optimal Total Leader Length.
Panhellenic Conference on Informatics 2005: 80-89 |
2004 |
31 | EE | Michael A. Bekos,
Michael Kaufmann,
Antonios Symvonis,
Alexander Wolff:
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps.
Graph Drawing 2004: 49-59 |
30 | EE | Nikolaos Glinos,
Doan B. Hoang,
Chi Nguyen,
Antonios Symvonis:
Video-on-Demand Based on Delayed-Multicast: Algorithmic Support.
Comput. J. 47(5): 545-559 (2004) |
29 | EE | Michael E. Houle,
Antonios Symvonis,
David R. Wood:
Dimension-exchange algorithms for token distribution on tree-connected architectures.
J. Parallel Distrib. Comput. 64(5): 591-605 (2004) |
2002 |
28 | | Nikolaos Glinos,
Doan B. Hoang,
Chi Nguyen,
Antonios Symvonis:
Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol.
SIROCCO 2002: 133-148 |
27 | | Michael E. Houle,
Antonios Symvonis,
David R. Wood:
Dimension-Exchange Algorithms for Load Balancing on Trees.
SIROCCO 2002: 181-196 |
26 | EE | Alan Roberts,
Antonios Symvonis,
David R. Wood:
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms.
Comput. J. 45(4): 423-435 (2002) |
2001 |
25 | | Alan Roberts,
Antonios Symvonis:
On the Routing Number of Complete d-ARY Trees.
Int. J. Found. Comput. Sci. 12(4): 411-434 (2001) |
2000 |
24 | EE | Benjamin Yin-Sun Lynn,
Antonios Symvonis,
David R. Wood:
Refinement of Three-Dimensional Orthogonal Graph Drawings.
Graph Drawing 2000: 308-320 |
23 | | Alan Roberts,
Antonios Symvonis,
David R. Wood:
Lower bounds for hot-potato permutation routing on trees.
SIROCCO 2000: 281-295 |
22 | | Peter Eades,
Antonios Symvonis,
Sue Whitesides:
Three-dimensional orthogonal graph drawing algorithms.
Discrete Applied Mathematics 103(1-3): 55-87 (2000) |
21 | EE | Alan Roberts,
Antonios Symvonis:
Potential-function-based Analysis of an off-line Heap Construction Algorithm.
J. UCS 6(2): 240-255 (2000) |
1999 |
20 | EE | Antonios Symvonis:
A Note on Deflection Worm Routing on Meshes.
Inf. Process. Lett. 71(5-6): 235-239 (1999) |
19 | EE | Alan Roberts,
Antonios Symvonis:
On-Line Matching Routing on Trees.
Theor. Comput. Sci. 220(2): 469-488 (1999) |
1998 |
18 | EE | Alan Roberts,
Antonios Symvonis:
On-Line Matching Routing on Trees.
LATIN 1998: 282-291 |
17 | | Panagiotis Takis Metaxas,
Grammati E. Pantziou,
Antonios Symvonis:
A note on parallel algorithms for optimal h-v drawings of binary trees.
Comput. Geom. 9(3): 145-158 (1998) |
1997 |
16 | EE | Alan Roberts,
Antonios Symvonis:
A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms.
IEEE Trans. Parallel Distrib. Syst. 8(8): 781-789 (1997) |
15 | EE | Grammati E. Pantziou,
Alan Roberts,
Antonios Symvonis:
Many-to-Many Routings on Trees via Matchings.
Theor. Comput. Sci. 185(2): 347-377 (1997) |
1996 |
14 | | Peter Eades,
Antonios Symvonis,
Sue Whitesides:
Two Algorithms for Three Dimensional Orthogonal Graph Drawing.
Graph Drawing 1996: 139-154 |
13 | | Grammati E. Pantziou,
Alan Roberts,
Antonios Symvonis:
Dynamic Tree Routing under the ``Matching with Consumption'' Model.
ISAAC 1996: 275-284 |
12 | | Antonios Symvonis,
Jonathon Tidswell:
An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method.
IEEE Trans. Computers 45(5): 619-625 (1996) |
11 | EE | Antonios Symvonis:
Routing on Trees.
Inf. Process. Lett. 57(4): 215-223 (1996) |
10 | | Fillia Makedon,
Antonios Symvonis:
Flit-Serial Packet Routing on Meshes and Tori.
Mathematical Systems Theory 29(4): 311-330 (1996) |
1995 |
9 | | Alan Roberts,
Antonios Symvonis,
Louxin Zhang:
Routing on Trees via Matchings.
WADS 1995: 251-262 |
8 | | Antonios Symvonis:
Optimal Stable Merging.
Comput. J. 38(8): 681-690 (1995) |
1994 |
7 | | Panagiotis Takis Metaxas,
Grammati E. Pantziou,
Antonios Symvonis:
Parallel h-v Drawings of Binary Trees.
ISAAC 1994: 487-495 |
6 | | Fillia Makedon,
Antonios Symvonis:
Optimal-Algorithms for Multipacket Routing Problems on Rings.
J. Parallel Distrib. Comput. 22(1): 37-43 (1994) |
1993 |
5 | EE | Fillia Makedon,
Antonios Symvonis:
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements.
IEEE Trans. Parallel Distrib. Syst. 4(3): 270-276 (1993) |
4 | | Antonios Symvonis,
Spyros Tragoudas:
Searching a Pseudo 3-Sided Solid Orthoconvex Grid.
Int. J. Found. Comput. Sci. 4(4): 325-353 (1993) |
3 | | Michael Formann,
Torben Hagerup,
James Haralambides,
Michael Kaufmann,
Frank Thomson Leighton,
Antonios Symvonis,
Emo Welzl,
Gerhard J. Woeginger:
Drawing Graphs in the Plane with High Resolution.
SIAM J. Comput. 22(5): 1035-1052 (1993) |
1992 |
2 | | Antonios Symvonis,
Spyros Tragoudas:
Searching a Solid Pseudo 3-Sided Orthoconvex Grid.
ISAAC 1992: 188-197 |
1990 |
1 | | Michael Formann,
Torben Hagerup,
James Haralambides,
Michael Kaufmann,
Frank Thomson Leighton,
Antonios Symvonis,
Emo Welzl,
Gerhard J. Woeginger:
Drawing Graphs in the Plane with High Resolution
FOCS 1990: 86-95 |