default search action
Antonios Symvonis
Antonis Symvonis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j49]Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg
, Antonios Symvonis:
On the complexity of the storyplan problem. J. Comput. Syst. Sci. 139: 103466 (2024) - [j48]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-convex drawings of 3-connected planar graphs. J. Comput. Geom. 15(1): 1-20 (2024) - [j47]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani
Convex grid drawings of planar graphs with constant edge-vertex resolution. Theor. Comput. Sci. 982: 114290 (2024) - [c69]Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-Bend Upward Point-Set Embeddings of st-Digraphs. LATIN (1) 2024: 3-18 - [i26]Emilio Di Giacomo, Henry Förster, Daria Kokhovich, Tamara Mchedlidze, Fabrizio Montecchiani, Antonios Symvonis, Anaïs Villedieu:
On 1-bend Upward Point-set Embeddings of st-digraphs. CoRR abs/2401.03226 (2024) - 2023
- [j46]Abu Reyan Ahmed
Splitting Vertices in 2-Layer Graph Drawings. IEEE Computer Graphics and Applications 43(3): 24-35 (2023) - [i25]Abu Reyan Ahmed, Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista, Michael Kaufmann, Philipp Kindermann
Splitting Vertices in 2-Layer Graph Drawings. CoRR abs/2301.10872 (2023) - 2022
- [c68]Michael A. Bekos
Strictly-Convex Drawings of 3-Connected Planar Graphs. GD 2022: 144-156 - [c67]Carla Binucci
On the Complexity of the Storyplan Problem. GD 2022: 304-318 - [c66]Michael A. Bekos
Convex Grid Drawings of Planar Graphs with Constant Edge-Vertex Resolution. IWOCA 2022: 157-171 - [i24]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Convex Grid Drawings of Planar Graphs\\with Constant Edge-Vertex Resolution. CoRR abs/2204.14040 (2022) - [i23]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis:
Strictly-Convex Drawings of 3-Connected Planar Graphs. CoRR abs/2208.13388 (2022) - [i22]Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nöllenburg, Antonios Symvonis:
On the Complexity of the Storyplan Problem. CoRR abs/2209.00453 (2022) - 2021
- [j45]Laura Benton, Manolis Mavrikis
Designing for "challenge" in a large-scale adaptive literacy game for primary school children. Br. J. Educ. Technol. 52(5): 1862-1880 (2021) - [j44]Michael A. Bekos, Martin Gronemann
Grid drawings of graphs with constant edge-vertex resolution. Comput. Geom. 98: 101789 (2021) - [c65]Patrizio Angelini
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. GD 2021: 184-192 - [i21]Patrizio Angelini, Philipp Kindermann, Andre Löffler, Lena Schlipf, Antonios Symvonis:
One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons. CoRR abs/2108.12321 (2021) - 2020
- [i20]Michael A. Bekos, Martin Gronemann, Fabrizio Montecchiani, Antonios Symvonis, Leonidas Theocharous:
Grid Drawings of Graphs with Constant Edge-Vertex Resolution. CoRR abs/2005.02082 (2020)
2010 – 2019
- 2019
- [j43]Patrizio Angelini
Greedy rectilinear drawings. Theor. Comput. Sci. 795: 375-397 (2019) - [j42]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze
Planar drawings of fixed-mobile bigraphs. Theor. Comput. Sci. 795: 408-419 (2019) - [c64]Nick Deligiannis, Dionysis Panagiotopoulos, Panagiotis Patsilinakos, Chrysanthi N. Raftopoulou, Antonios Symvonis:
Interactive and Personalized Activity eBooks for Learning to Read: The iRead Case. iTextbooks@AIED 2019: 57-69 - [c63]Manolis Mavrikis, Asimina Vasalou
Towards Evidence-informed Design Principles for Adaptive Reading Games. CHI Extended Abstracts 2019 - [c62]Philipp Kindermann
Drawing Planar Graphs with Few Segments on a Polynomial Grid. GD 2019: 416-429 - [c61]Patrizio Angelini
Geometric Representations of Dichotomous Ordinal Data. WG 2019: 205-217 - [i19]Philipp Kindermann, Tamara Mchedlidze, Thomas Schneck, Antonios Symvonis:
Drawing planar graphs with few segments on a polynomial grid. CoRR abs/1903.08496 (2019) - [i18]Michael A. Bekos, Carla Binucci, Michael Kaufmann, Chrysanthi N. Raftopoulou, Antonios Symvonis, Alessandra Tappini:
Coloring outerplanar graphs and planar 3-trees with small monochromatic components. CoRR abs/1911.10863 (2019) - 2018
- [c60]Anargyros Oikonomou, Antonios Symvonis
Monotone Drawings of k-Inner Planar Graphs. GD 2018: 347-353 - [c59]Patrizio Angelini
Greedy Rectilinear Drawings. GD 2018: 495-508 - [c58]Stavros Droutsas, Panagiotis Patsilinakos, Antonios Symvonis
Interactive Personalized eBooks for Education. IISA 2018: 1-8 - [i17]Anargyros Oikonomou, Antonios Symvonis:
Monotone Drawings of k-Inner Planar Graphs. CoRR abs/1808.06892 (2018) - [i16]Patrizio Angelini, Michael A. Bekos, Walter Didimo, Luca Grilli, Philipp Kindermann, Tamara Mchedlidze, Roman Prutkin, Antonios Symvonis, Alessandra Tappini:
Greedy Rectilinear Drawings. CoRR abs/1808.09063 (2018) - 2017
- [j41]Patrizio Angelini
Vertex-Coloring with Defects. J. Graph Algorithms Appl. 21(3): 313-340 (2017) - [c57]Konstantinos Mastakas, Antonios Symvonis
Rooted Uniform Monotone Minimum Spanning Trees. CIAC 2017: 405-417 - [c56]Anargyros Oikonomou, Antonios Symvonis
Simple Compact Monotone Tree Drawings. GD 2017: 326-333 - [c55]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze
Planar Drawings of Fixed-Mobile Bigraphs. GD 2017: 426-439 - [i15]Michael A. Bekos, Felice De Luca, Walter Didimo, Tamara Mchedlidze, Martin Nöllenburg, Antonios Symvonis, Ioannis G. Tollis:
Planar Drawings of Fixed-Mobile Bigraphs. CoRR abs/1708.09238 (2017) - [i14]Anargyros Oikonomou, Antonios Symvonis:
Simple Compact Monotone Tree Drawings. CoRR abs/1708.09653 (2017) - 2016
- [c54]Patrizio Angelini
Low Ply Drawings of Trees. GD 2016: 236-248 - [i13]Konstantinos Mastakas, Antonios Symvonis:
Rooted Uniform Monotone Minimum Spanning Trees. CoRR abs/1607.03338 (2016) - [i12]Patrizio Angelini, Michael A. Bekos, Till Bruckdorfer, Jaroslav Hancl, Michael Kaufmann, Stephen G. Kobourov, Antonios Symvonis, Pavel Valtr:
Low Ply Drawings of Trees. CoRR abs/1608.08538 (2016) - 2015
- [j40]Patrizio Angelini
Monotone Drawings of Graphs with Fixed Embedding. Algorithmica 71(2): 233-257 (2015) - [j39]Chris Litsas, Maria Mastropavlou, Antonios Symvonis:
Profile-Based Text Classification for Children with Dyslexia. Int. J. Monit. Surveillance Technol. Res. 3(1): 21-39 (2015) - [j38]Francesco Giordano, Giuseppe Liotta
Computing upward topological book embeddings of upward planar digraphs. J. Discrete Algorithms 30: 45-69 (2015) - [j37]Michael A. Bekos
Many-to-One Boundary Labeling with Backbones. J. Graph Algorithms Appl. 19(3): 779-816 (2015) - [j36]Carla Binucci
Fan-planarity: Properties and complexity. Theor. Comput. Sci. 589: 76-86 (2015) - [c53]Claudiu Bruda, Chris Litsas, Cantemir Mihu, Ioan Mihu, Antonios Symvonis
A data-logging mechanism to support e-learning systems. IISA 2015: 1-4 - [c52]Emilio Di Giacomo, Walter Didimo, Seok-Hee Hong, Michael Kaufmann, Stephen G. Kobourov
Low ply graph drawing. IISA 2015: 1-6 - [c51]Konstantinos Mastakas, Antonios Symvonis
On the construction of increasing-chord graphs on convex point sets. IISA 2015: 1-6 - 2014
- [j35]Theologos Athanaselis, Stelios Bakamidis, Ioannis Dologlou, Evmorfia N. Argyriou, Antonios Symvonis
Making assistive reading tools user friendly: a new platform for Greek dyslexic students empowered by automatic speech recognition. Multim. Tools Appl. 68(3): 681-699 (2014) - [c50]Evmorfia N. Argyriou, Antonios Symvonis, Vassilis Vassiliou:
A Fraud Detection Visualization System Utilizing Radial Drawings and Heat-maps. IVAPP 2014: 153-160 - [c49]Chris Litsas, Maria Mastropavlou
Text classification for children with dyslexia employing user modelling techniques. IISA 2014: 1-6 - [e1]Christian A. Duncan, Antonios Symvonis
Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, Germany, September 24-26, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8871, Springer 2014, ISBN 978-3-662-45802-0 [contents] - 2013
- [j34]Evmorfia N. Argyriou, Michael A. Bekos
Maximizing the Total Resolution of Graphs. Comput. J. 56(7): 887-900 (2013) - [j33]Michael Kaufmann, Tamara Mchedlidze
On upward point set embeddability. Comput. Geom. 46(6): 774-804 (2013) - [j32]Evmorfia N. Argyriou, Michael A. Bekos
Geometric RAC Simultaneous Drawings of Graphs. J. Graph Algorithms Appl. 17(1): 11-34 (2013) - [j31]Michael A. Bekos
Smooth Orthogonal Layouts. J. Graph Algorithms Appl. 17(5): 575-595 (2013) - [c48]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg
Many-to-One Boundary Labeling with Backbones. GD 2013: 244-255 - [c47]Evmorfia N. Argyriou, Aikaterini A. Sotiraki
Occupational fraud detection through visualization. ISI 2013: 4-6 - [i11]Evmorfia N. Argyriou, Aikaterini A. Sotiraki, Antonios Symvonis:
Occupational Fraud Detection Through Visualization. CoRR abs/1304.6501 (2013) - [i10]Michael A. Bekos, Sabine Cornelsen, Martin Fink, Seok-Hee Hong, Michael Kaufmann, Martin Nöllenburg, Ignaz Rutter, Antonios Symvonis:
Many-to-One Boundary Labeling with Backbones. CoRR abs/1308.6801 (2013) - [i9]Evmorfia N. Argyriou, Antonios Symvonis, Vassilis Vassiliou:
A Fraud Detection Visualization System Utilizing Radial Drawings and Heat-maps. CoRR abs/1311.7259 (2013) - 2012
- [j30]Carla Binucci
Drawing trees in a streaming model. Inf. Process. Lett. 112(11): 418-422 (2012) - [j29]Evmorfia N. Argyriou, Michael A. Bekos
The Straight-Line RAC Drawing Problem is NP-Hard. J. Graph Algorithms Appl. 16(2): 569-597 (2012) - [c46]Evmorfia N. Argyriou, Michael A. Bekos
Geometric RAC Simultaneous Drawings of Graphs. COCOON 2012: 287-298 - [c45]Michael A. Bekos
Smooth Orthogonal Layouts. GD 2012: 150-161 - [c44]Evmorfia N. Argyriou, Antonios Symvonis
Detecting Periodicity in Serial Data through Visualization. ISVC (2) 2012: 295-304 - 2011
- [j28]Ulrik Brandes, Cesim Erten
Colored Simultaneous Geometric Embeddings and Universal Pointsets. Algorithmica 60(3): 569-592 (2011) - [j27]Patrizio Angelini, Luca Cittadini, Walter Didimo, Fabrizio Frati
On the Perspectives Opened by Right Angle Crossing Drawings. J. Graph Algorithms Appl. 15(1): 53-78 (2011) - [j26]Tamara Mchedlidze
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. J. Graph Algorithms Appl. 15(3): 373-415 (2011) - [c43]Patrizio Angelini
Monotone Drawings of Graphs with Fixed Embedding. GD 2011: 379-390 - [c42]Michael Kaufmann, Tamara Mchedlidze
Upward Point Set Embeddability for Convex Point Sets Is in P. GD 2011: 403-414 - [c41]Evmorfia N. Argyriou, Michael A. Bekos
Combining Problems on RAC Drawings and Simultaneous Graph Drawings. GD 2011: 433-434 - [c40]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 - [c39]Evmorfia N. Argyriou, Michael A. Bekos
The Straight-Line RAC Drawing Problem Is NP-Hard. SOFSEM 2011: 74-85 - [c38]Michael A. Bekos
Combining Traditional Map Labeling with Boundary Labeling. SOFSEM 2011: 111-122 - [c37]Markus Geyer, Michael Kaufmann, Tamara Mchedlidze
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
- [j25]Michael A. Bekos
Boundary Labeling with Octilinear Leaders. Algorithmica 57(3): 436-461 (2010) - [j24]Michael A. Bekos
Area-Feature Boundary Labeling. Comput. J. 53(6): 827-841 (2010) - [j23]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis
On Metro-Line Crossing Minimization. J. Graph Algorithms Appl. 14(1): 75-96 (2010) - [c36]Patrizio Angelini
Upward Geometric Graph Embeddings into Point Sets. GD 2010: 25-37 - [c35]Evmorfia N. Argyriou, Michael A. Bekos
Maximizing the Total Resolution of Graphs. GD 2010: 62-67 - [c34]Tamara Mchedlidze
Unilateral Orientation of Mixed Graphs. SOFSEM 2010: 588-599 - [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)
2000 – 2009
- 2009
- [c33]Tamara Mchedlidze
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs. COCOON 2009: 76-85 - [c32]Patrizio Angelini
On the Perspectives Opened by Right Angle Crossing Drawings. GD 2009: 21-32 - [c31]Carla Binucci
Drawing Trees in a Streaming Model. GD 2009: 292-303 - [c30]Tamara Mchedlidze
On rho-Constrained Upward Topological Book Embeddings. GD 2009: 411-412 - [c29]Tamara Mchedlidze
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs. ISAAC 2009: 882-891 - [c28]Tamara Mchedlidze
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
- [j22]Michael A. Bekos
Efficient Labeling of Collinear Sites. J. Graph Algorithms Appl. 12(3): 357-380 (2008) - [c27]Evmorfia N. Argyriou, Michael A. Bekos, Michael Kaufmann, Antonios Symvonis:
Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem. GD 2008: 336-347 - [c26]Tamara Mchedlidze
Spine Crossing Minimization in Upward Topological Book Embeddings. GD 2008: 445-446 - [c25]Paraskevi K. Tzouveli
Adaptive Reading Assistance for the Inclusion of Students with Dyslexia: The AGENT-DYSL Approach. ICALT 2008: 167-171 - [c24]Luca Grilli
Locally Delaunay Realizability of Regular Series-Parallel Graphs. ICCSA Workshops 2008: 461-467 - [c23]Michael A. Bekos
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
- [j21]Michael A. Bekos
Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. 36(3): 215-236 (2007) - [c22]Michael A. Bekos
Labeling collinear sites. APVIS 2007: 45-51 - [c21]Ulrik Brandes, Cesim Erten, J. Joseph Fowler, Fabrizio Frati
Colored Simultaneous Geometric Embeddings. COCOON 2007: 254-263 - [c20]Michael A. Bekos
Line Crossing Minimization on Metro Maps. GD 2007: 231-242 - [c19]Francesco Giordano, Giuseppe Liotta, Tamara Mchedlidze
Computing Upward Topological Book Embeddings of Upward Planar Digraphs. ISAAC 2007: 172-183 - 2006
- [c18]Michael A. Bekos, Michael Kaufmann, Katerina Potika, Antonios Symvonis:
Polygon labelling of minimum leader length. APVIS 2006: 15-21 - [c17]Michael A. Bekos, Michael Kaufmann, Katerina Potika
Multi-stack Boundary Labeling Problems. FSTTCS 2006: 81-92 - 2005
- [c16]Michael A. Bekos
BLer: A Boundary Labeller for Technical Drawings. GD 2005: 503-504 - [c15]Michael A. Bekos
Boundary Labelling of Optimal Total Leader Length. Panhellenic Conference on Informatics 2005: 80-89 - 2004
- [j20]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) - [j19]Michael E. Houle, Antonios Symvonis
Dimension-exchange algorithms for token distribution on tree-connected architectures. J. Parallel Distributed Comput. 64(5): 591-605 (2004) - [c14]Michael A. Bekos, Michael Kaufmann, Antonios Symvonis, Alexander Wolff:
Boundary Labeling: Models and Efficient Algorithms for Rectangular Maps. GD 2004: 49-59 - 2002
- [j18]Alan Roberts, Antonios Symvonis
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms. Comput. J. 45(4): 423-435 (2002) - [c13]Chi Nguyen, Doan B. Hoang, Antonios Symvonis:
Resource allocation for video-on-demand with "delayed-multicast" protocol. GLOBECOM 2002: 1789-1793 - [c12]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 - [c11]Michael E. Houle, Antonios Symvonis, David R. Wood:
Dimension-Exchange Algorithms for Load Balancing on Trees. SIROCCO 2002: 181-196 - 2001
- [j17]Alan Roberts, Antonios Symvonis
On the Routing Number of Complete d-ARY Trees. Int. J. Found. Comput. Sci. 12(4): 411-434 (2001) - 2000
- [j16]Peter Eades, Antonios Symvonis
Three-dimensional orthogonal graph drawing algorithms. Discret. Appl. Math. 103(1-3): 55-87 (2000) - [j15]Alan Roberts, Antonios Symvonis:
Potential-function-based Analysis of an off-line Heap Construction Algorithm. J. Univers. Comput. Sci. 6(2): 240-255 (2000) - [c10]Benjamin Yin-Sun Lynn, Antonios Symvonis
Refinement of Three-Dimensional Orthogonal Graph Drawings. GD 2000: 308-320 - [c9]Hossam El-Gindy, Chi Nguyen, Antonios Symvonis
"Scheduled-multicast" with application in multimedia networks. ICON 2000: 191-198 - [c8]Alan Roberts, Antonios Symvonis, David R. Wood:
Lower bounds for hot-potato permutation routing on trees. SIROCCO 2000: 281-295
1990 – 1999
- 1999
- [j14]Antonios Symvonis:
A Note on Deflection Worm Routing on Meshes. Inf. Process. Lett. 71(5-6): 235-239 (1999) - [j13]Alan Roberts, Antonios Symvonis
On-Line Matching Routing on Trees. Theor. Comput. Sci. 220(2): 469-488 (1999) - 1998
- [j12]Panagiotis Takis Metaxas, Grammati E. Pantziou
A note on parallel algorithms for optimal h-v drawings of binary trees. Comput. Geom. 9(3): 145-158 (1998) - [c7]Alan Roberts, Antonios Symvonis:
On-Line Matching Routing on Trees. LATIN 1998: 282-291 - 1997
- [j11]Grammati E. Pantziou
Many-to-Many Routings on Trees via Matchings. Theor. Comput. Sci. 185(2): 347-377 (1997) - [j10]Alan Roberts, Antonios Symvonis
A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms. IEEE Trans. Parallel Distributed Syst. 8(8): 781-789 (1997) - 1996
- [j9]Antonios Symvonis
Routing on Trees. Inf. Process. Lett. 57(4): 215-223 (1996) - [j8]Fillia Makedon, Antonios Symvonis
Flit-Serial Packet Routing on Meshes and Tori. Math. Syst. Theory 29(4): 311-330 (1996) - [j7]Antonios Symvonis
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
Two Algorithms for Three Dimensional Orthogonal Graph Drawing. GD 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
- [j6]Antonios Symvonis:
Optimal Stable Merging. Comput. J. 38(8): 681-690 (1995) - [c4]Alan Roberts, Antonios Symvonis
Routing on Trees via Matchings. WADS 1995: 251-262 - 1994
- [j5]Fillia Makedon, Antonios Symvonis
Optimal-Algorithms for Multipacket Routing Problems on Rings. J. Parallel Distributed 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
- [j4]Antonios Symvonis, Spyros Tragoudas:
Searching a Pseudo 3-Sided Solid Orthoconvex Grid. Int. J. Found. Comput. Sci. 4(4): 325-353 (1993) - [j3]Fillia Makedon, Antonios Symvonis
Optimal algorithms for the many-to-one routing problem on two-dimensional meshes. Microprocess. Microsystems 17(6): 361-367 (1993) - [j2]Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis
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 Distributed Syst. 4(3): 270-276 (1993) - 1992
- [c2]Antonios Symvonis
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
Coauthor Index
[j48] [j47] [j46] [i25] [c68] [c66] [i24] [i23] [j44] [i20] [j43] [j42] [c61] [i18] [c59] [i16] [j41] [c55] [i15] [c54] [i12] [j37] [j34] [j32] [j31] [c48] [i10] [j29] [c46] [c45] [c41] [c39] [c38] [i8] [j25] [j24] [j23] [c35] [i6] [i5] [j22] [c27] [c23] [j21] [c22] [c20] [c18] [c17] [c16] [c15] [c14]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-15 20:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: