| 2013 | ||
|---|---|---|
| j31 | Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: On upward point set embeddability. Comput. Geom. 46(6): 774-804 (2013) | |
| j30 | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Geometric RAC Simultaneous Drawings of Graphs. J. Graph Algorithms Appl. 17(1): 11-34 (2013) | |
| i9 | Evmorfia N. Argyriou, Aikaterini A. Sotiraki, Antonios Symvonis: Occupational Fraud Detection Through Visualization. CoRR abs/1304.6501 (2013) | |
| 2012 | ||
| j29 | Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) | |
| j28 | Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: The Straight-Line RAC Drawing Problem is NP-Hard. J. Graph Algorithms Appl. 16(2): 569-597 (2012) | |
| c44 | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Geometric RAC Simultaneous Drawings of Graphs. COCOON 2012: 287-298 | |
| c43 | Michael A. Bekos, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis: Smooth Orthogonal Layouts. Graph Drawing 2012: 150-161 | |
| c42 | Evmorfia N. Argyriou, Antonios Symvonis: Detecting Periodicity in Serial Data through Visualization. ISVC (2) 2012: 295-304 | |
| 2011 | ||
| j27 | Ulrik Brandes, Cesim Erten, Alejandro Estrella-Balderrama, 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 and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) | |
| j26 | Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati, Giuseppe Di Battista, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) | |
| j25 | Tamara Mchedlidze, Antonios Symvonis: Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. J. Graph Algorithms Appl. 15(3): 373-415 (2011) | |
| c41 | Patrizio Angelini, Walter Didimo, Stephen G. Kobourov, Tamara Mchedlidze, Vincenzo Roselli, Antonios Symvonis, Stephen K. Wismath: Monotone Drawings of Graphs with Fixed Embedding. Graph Drawing 2011: 379-390 | |
| c40 | Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Point Set Embeddability for Convex Point Sets Is in P. Graph Drawing 2011: 403-414 | |
| c39 | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Combining Problems on RAC Drawings and Simultaneous Graph Drawings. Graph Drawing 2011: 433-434 | |
| c38 | Theologos Athanaselis, Stelios Bakamidis, Ioannis Dologlou, Evmorfia N. Argyriou, Antonios Symvonis: Incorporating Speech Recognition Engine into an Intelligent Assistive Reading System for Dyslexic Students. INTERSPEECH 2011: 2993-2996 | |
| c37 | Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: The Straight-Line RAC Drawing Problem Is NP-Hard. SOFSEM 2011: 74-85 | |
| c36 | Michael A. Bekos, Michael Kaufmann, Dimitrios Papadopoulos, Antonios Symvonis: Combining Traditional Map Labeling with Boundary Labeling. SOFSEM 2011: 111-122 | |
| c35 | Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Point-Set Embeddability. SOFSEM 2011: 272-283 | |
| i8 | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Geometric Simultaneous RAC Drawings of Graphs. CoRR abs/1106.2694 (2011) | |
| i7 | Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Point Set Embeddability for Convex Point Sets is in $P$. CoRR abs/1108.3092 (2011) | |
| 2010 | ||
| j24 | Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis: Boundary Labeling with Octilinear Leaders. Algorithmica 57(3): 436-461 (2010) | |
| j23 | Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Area-Feature Boundary Labeling. Comput. J. 53(6): 827-841 (2010) | |
| j22 | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: On Metro-Line Crossing Minimization. J. Graph Algorithms Appl. 14(1): 75-96 (2010) | |
| c34 | Patrizio Angelini, Fabrizio Frati, Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Geometric Graph Embeddings into Point Sets. Graph Drawing 2010: 25-37 | |
| c33 | Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: Maximizing the Total Resolution of Graphs. Graph Drawing 2010: 62-67 | |
| c32 | ||
| i6 | Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: Maximizing the Total Resolution of Graphs. CoRR abs/1009.2109 (2010) | |
| i5 | Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis: The Straight-Line RAC Drawing Problem is NP-Hard. CoRR abs/1009.5227 (2010) | |
| i4 | Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis: Upward Point-Set Embeddability. CoRR abs/1010.5937 (2010) | |
| 2009 | ||
| c31 | Tamara Mchedlidze, Antonios Symvonis: Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. COCOON 2009: 76-85 | |
| c30 | Patrizio Angelini, Luca Cittadini, Giuseppe Di Battista, Walter Didimo, Fabrizio Frati, Michael Kaufmann, Antonios Symvonis: On the Perspectives Opened by Right Angle Crossing Drawings. Graph Drawing 2009: 21-32 | |
| c29 | Carla Binucci, Ulrik Brandes, Giuseppe Di Battista, Walter Didimo, Marco Gaertler, Pietro Palladino, Maurizio Patrignani, Antonios Symvonis, Katharina Anna Zweig: Drawing Trees in a Streaming Model. Graph Drawing 2009: 292-303 | |
| c28 | Tamara Mchedlidze, Antonios Symvonis: On rho-Constrained Upward Topological Book Embeddings. Graph Drawing 2009: 411-412 | |
| c27 | Tamara Mchedlidze, Antonios Symvonis: Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. ISAAC 2009: 882-891 | |
| c26 | Tamara Mchedlidze, Antonios Symvonis: Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. WALCOM 2009: 250-261 | |
| i3 | Tamara Mchedlidze, Antonios Symvonis: Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. CoRR abs/0904.2129 (2009) | |
| i2 | Tamara Mchedlidze, Antonios Symvonis: Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. CoRR abs/0909.2787 (2009) | |
| 2008 | ||
| j21 | Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Efficient Labeling of Collinear Sites. J. Graph Algorithms Appl. 12(3): 357-380 (2008) | |
| c25 | Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis: Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. Graph Drawing 2008: 336-347 | |
| c24 | Tamara Mchedlidze, Antonios Symvonis: Spine Crossing Minimization in Upward Topological Book Embeddings. Graph Drawing 2008: 445-446 | |
| c23 | Luca Grilli, Seok-Hee Hong, Antonios Symvonis, Camille Wormser: Locally Delaunay Realizability of Regular Series-Parallel Graphs. ICCSA Workshops 2008: 461-467 | |
| c22 | Michael A. Bekos, Michael Kaufmann, Martin Nöllenburg, Antonios Symvonis: Boundary Labeling with Octilinear Leaders. SWAT 2008: 234-245 | |
| i1 | 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) | |
| 2007 | ||
| j20 | 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) | |
| c21 | ||
| c20 | 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 | |
| c19 | Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Line Crossing Minimization on Metro Maps. Graph Drawing 2007: 231-242 | |
| c18 | Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze, Antonios Symvonis: Computing Upward Topological Book Embeddings of Upward Planar Digraphs. ISAAC 2007: 172-183 | |
| 2006 | ||
| c17 | Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Polygon labelling of minimum leader length. APVIS 2006: 15-21 | |
| c16 | Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Multi-stack Boundary Labeling Problems. FSTTCS 2006: 81-92 | |
| 2005 | ||
| c15 | Michael A. Bekos, Antonios Symvonis: BLer: A Boundary Labeller for Technical Drawings. Graph Drawing 2005: 503-504 | |
| c14 | Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis: Boundary Labelling of Optimal Total Leader Length. Panhellenic Conference on Informatics 2005: 80-89 | |
| 2004 | ||
| j19 | 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) | |
| j18 | 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) | |
| c13 | Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff: Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. Graph Drawing 2004: 49-59 | |
| 2002 | ||
| j17 | 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) | |
| c12 | Chi Nguyen, Doan B. Hoang, Antonios Symvonis: Resource allocation for video-on-demand with "delayed-multicast" protocol. GLOBECOM 2002: 1789-1793 | |
| c11 | 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 | |
| c10 | Michael E. Houle, Antonios Symvonis, David R. Wood: Dimension-Exchange Algorithms for Load Balancing on Trees. SIROCCO 2002: 181-196 | |
| 2001 | ||
| j16 | Alan Roberts, Antonios Symvonis: On the Routing Number of Complete d-ARY Trees. Int. J. Found. Comput. Sci. 12(4): 411-434 (2001) | |
| 2000 | ||
| j15 | Peter Eades, Antonios Symvonis, Sue Whitesides: Three-dimensional orthogonal graph drawing algorithms. Discrete Applied Mathematics 103(1-3): 55-87 (2000) | |
| j14 | Alan Roberts, Antonios Symvonis: Potential-function-based Analysis of an off-line Heap Construction Algorithm. J. UCS 6(2): 240-255 (2000) | |
| c9 | Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood: Refinement of Three-Dimensional Orthogonal Graph Drawings. Graph Drawing 2000: 308-320 | |
| c8 | Alan Roberts, Antonios Symvonis, David R. Wood: Lower bounds for hot-potato permutation routing on trees. SIROCCO 2000: 281-295 | |
| 1999 | ||
| j13 | Antonios Symvonis: A Note on Deflection Worm Routing on Meshes. Inf. Process. Lett. 71(5-6): 235-239 (1999) | |
| j12 | Alan Roberts, Antonios Symvonis: On-Line Matching Routing on Trees. Theor. Comput. Sci. 220(2): 469-488 (1999) | |
| 1998 | ||
| j11 | 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) | |
| c7 | ||
| 1997 | ||
| j10 | Grammati E. Pantziou, Alan Roberts, Antonios Symvonis: Many-to-Many Routings on Trees via Matchings. Theor. Comput. Sci. 185(2): 347-377 (1997) | |
| j9 | 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) | |
| 1996 | ||
| j8 | ||
| j7 | Fillia Makedon, Antonios Symvonis: Flit-Serial Packet Routing on Meshes and Tori. Mathematical Systems Theory 29(4): 311-330 (1996) | |
| j6 | 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) | |
| c6 | Peter Eades, Antonios Symvonis, Sue Whitesides: Two Algorithms for Three Dimensional Orthogonal Graph Drawing. Graph Drawing 1996: 139-154 | |
| c5 | Grammati E. Pantziou, Alan Roberts, Antonios Symvonis: Dynamic Tree Routing under the ``Matching with Consumption'' Model. ISAAC 1996: 275-284 | |
| 1995 | ||
| j5 | ||
| c4 | ||
| 1994 | ||
| j4 | Fillia Makedon, Antonios Symvonis: Optimal-Algorithms for Multipacket Routing Problems on Rings. J. Parallel Distrib. Comput. 22(1): 37-43 (1994) | |
| c3 | Panagiotis Takis Metaxas, Grammati E. Pantziou, Antonios Symvonis: Parallel h-v Drawings of Binary Trees. ISAAC 1994: 487-495 | |
| 1993 | ||
| j3 | Antonios Symvonis, Spyros Tragoudas: Searching a Pseudo 3-Sided Solid Orthoconvex Grid. Int. J. Found. Comput. Sci. 4(4): 325-353 (1993) | |
| j2 | 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) | |
| j1 | 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) | |
| 1992 | ||
| c2 | Antonios Symvonis, Spyros Tragoudas: Searching a Solid Pseudo 3-Sided Orthoconvex Grid. ISAAC 1992: 188-197 | |
| 1990 | ||
| c1 | 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 | |
Colors in the list of coauthors
Last update Fri May 24 03:38:16 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page