The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Antonios Symvonis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:86-95 [Conf]
  2. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
    Multi-stack Boundary Labeling Problems. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:81-92 [Conf]
  3. Michael A. Bekos, Antonios Symvonis
    BLer: A Boundary Labeller for Technical Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2005, pp:503-504 [Conf]
  4. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
    Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2004, pp:49-59 [Conf]
  5. Peter Eades, Antonios Symvonis, Sue Whitesides
    Two Algorithms for Three Dimensional Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1996, pp:139-154 [Conf]
  6. Benjamin Yin-Sun Lynn, Antonios Symvonis, David R. Wood
    Refinement of Three-Dimensional Orthogonal Graph Drawings. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2000, pp:308-320 [Conf]
  7. Panagiotis Takis Metaxas, Grammati E. Pantziou, Antonios Symvonis
    Parallel h-v Drawings of Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:487-495 [Conf]
  8. Grammati E. Pantziou, Alan Roberts, Antonios Symvonis
    Dynamic Tree Routing under the ``Matching with Consumption'' Model. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1996, pp:275-284 [Conf]
  9. Antonios Symvonis, Spyros Tragoudas
    Searching a Solid Pseudo 3-Sided Orthoconvex Grid. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:188-197 [Conf]
  10. Alan Roberts, Antonios Symvonis
    On-Line Matching Routing on Trees. [Citation Graph (0, 0)][DBLP]
    LATIN, 1998, pp:282-291 [Conf]
  11. Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis
    Boundary Labelling of Optimal Total Leader Length. [Citation Graph (0, 0)][DBLP]
    Panhellenic Conference on Informatics, 2005, pp:80-89 [Conf]
  12. Nikolaos Glinos, Doan B. Hoang, Chi Nguyen, Antonios Symvonis
    Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:133-148 [Conf]
  13. Michael E. Houle, Antonios Symvonis, David R. Wood
    Dimension-Exchange Algorithms for Load Balancing on Trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:181-196 [Conf]
  14. Alan Roberts, Antonios Symvonis, David R. Wood
    Lower bounds for hot-potato permutation routing on trees. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:281-295 [Conf]
  15. Alan Roberts, Antonios Symvonis, Louxin Zhang
    Routing on Trees via Matchings. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:251-262 [Conf]
  16. Nikolaos Glinos, Doan B. Hoang, Chi Nguyen, Antonios Symvonis
    Video-on-Demand Based on Delayed-Multicast: Algorithmic Support. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2004, v:47, n:5, pp:545-559 [Journal]
  17. Alan Roberts, Antonios Symvonis, David R. Wood
    Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2002, v:45, n:4, pp:423-435 [Journal]
  18. Antonios Symvonis
    Optimal Stable Merging. [Citation Graph (0, 0)][DBLP]
    Comput. J., 1995, v:38, n:8, pp:681-690 [Journal]
  19. Panagiotis Takis Metaxas, Grammati E. Pantziou, Antonios Symvonis
    A note on parallel algorithms for optimal h-v drawings of binary trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:9, n:3, pp:145-158 [Journal]
  20. Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff
    Boundary labeling: Models and efficient algorithms for rectangular maps. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:3, pp:215-236 [Journal]
  21. Peter Eades, Antonios Symvonis, Sue Whitesides
    Three-dimensional orthogonal graph drawing algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:55-87 [Journal]
  22. Alan Roberts, Antonios Symvonis
    On the Routing Number of Complete d-ARY Trees. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2001, v:12, n:4, pp:411-434 [Journal]
  23. Antonios Symvonis, Spyros Tragoudas
    Searching a Pseudo 3-Sided Solid Orthoconvex Grid. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:4, pp:325-353 [Journal]
  24. Antonios Symvonis
    Routing on Trees. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:57, n:4, pp:215-223 [Journal]
  25. Antonios Symvonis
    A Note on Deflection Worm Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:71, n:5-6, pp:235-239 [Journal]
  26. Michael E. Houle, Antonios Symvonis, David R. Wood
    Dimension-exchange algorithms for token distribution on tree-connected architectures. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2004, v:64, n:5, pp:591-605 [Journal]
  27. Fillia Makedon, Antonios Symvonis
    Optimal-Algorithms for Multipacket Routing Problems on Rings. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:22, n:1, pp:37-43 [Journal]
  28. Alan Roberts, Antonios Symvonis
    Potential-function-based Analysis of an off-line Heap Construction Algorithm. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:2, pp:240-255 [Journal]
  29. Fillia Makedon, Antonios Symvonis
    Flit-Serial Packet Routing on Meshes and Tori. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:4, pp:311-330 [Journal]
  30. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:1035-1052 [Journal]
  31. Antonios Symvonis, Jonathon Tidswell
    An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:5, pp:619-625 [Journal]
  32. Grammati E. Pantziou, Alan Roberts, Antonios Symvonis
    Many-to-Many Routings on Trees via Matchings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:185, n:2, pp:347-377 [Journal]
  33. Alan Roberts, Antonios Symvonis
    On-Line Matching Routing on Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:2, pp:469-488 [Journal]
  34. Fillia Makedon, Antonios Symvonis
    An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:3, pp:270-276 [Journal]
  35. Alan Roberts, Antonios Symvonis
    A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:8, pp:781-789 [Journal]
  36. Ulrik Brandes, Cesim Erten, J. Fowler, Fabrizio Frati, Markus Geyer, Carsten Gutwenger, S. Hong, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Petra Mutzel, Antonios Symvonis
    Colored Simultaneous Geometric Embeddings. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:254-263 [Conf]

  37. Polygon labelling of minimum leader length. [Citation Graph (, )][DBLP]


  38. Labeling collinear sites. [Citation Graph (, )][DBLP]


  39. Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. [Citation Graph (, )][DBLP]


  40. On the Perspectives Opened by Right Angle Crossing Drawings. [Citation Graph (, )][DBLP]


  41. Drawing Trees in a Streaming Model. [Citation Graph (, )][DBLP]


  42. Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. [Citation Graph (, )][DBLP]


  43. Line Crossing Minimization on Metro Maps. [Citation Graph (, )][DBLP]


  44. Spine Crossing Minimization in Upward Topological Book Embeddings. [Citation Graph (, )][DBLP]


  45. On rho-Constrained Upward Topological Book Embeddings. [Citation Graph (, )][DBLP]


  46. Computing Upward Topological Book Embeddings of Upward Planar Digraphs. [Citation Graph (, )][DBLP]


  47. Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. [Citation Graph (, )][DBLP]


  48. Unilateral Orientation of Mixed Graphs. [Citation Graph (, )][DBLP]


  49. Boundary Labeling with Octilinear Leaders. [Citation Graph (, )][DBLP]


  50. Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings. [Citation Graph (, )][DBLP]


  51. Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings) [Citation Graph (, )][DBLP]


  52. Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs [Citation Graph (, )][DBLP]


  53. Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002