Antonios Symvonis

According to our database1, Antonios Symvonis authored at least 106 papers between 1992 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the complexity of the storyplan problem.
J. Comput. Syst. Sci., February, 2024

Convex grid drawings of planar graphs with constant edge-vertex resolution.
Theor. Comput. Sci., January, 2024

On 1-bend Upward Point-set Embeddings of st-digraphs.
CoRR, 2024

2023
Splitting Vertices in 2-Layer Graph Drawings.
IEEE Computer Graphics and Applications, 2023

2022
Strictly-Convex Drawings of 3-Connected Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

2021
Grid drawings of graphs with constant edge-vertex resolution.
Comput. Geom., 2021

Designing for "challenge" in a large-scale adaptive literacy game for primary school children.
Br. J. Educ. Technol., 2021

One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons.
Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

2020
Grid Drawings of Graphs with Constant Edge-Vertex Resolution.
CoRR, 2020

2019
Planar drawings of fixed-mobile bigraphs.
Theor. Comput. Sci., 2019

Greedy rectilinear drawings.
Theor. Comput. Sci., 2019

Coloring outerplanar graphs and planar 3-trees with small monochromatic components.
CoRR, 2019

Geometric Representations of Dichotomous Ordinal Data.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2019

Drawing Planar Graphs with Few Segments on a Polynomial Grid.
Proceedings of the Graph Drawing and Network Visualization - 27th International Symposium, 2019

Towards Evidence-informed Design Principles for Adaptive Reading Games.
Proceedings of the Extended Abstracts of the 2019 CHI Conference on Human Factors in Computing Systems, 2019

Interactive and Personalized Activity eBooks for Learning to Read: The iRead Case.
Proceedings of the First Workshop on Intelligent Textbooks co-located with 20th International Conference on Artificial Intelligence in Education (AIED 2019), 2019

2018
Interactive Personalized eBooks for Education.
Proceedings of the 9th International Conference on Information, 2018

Monotone Drawings of k-Inner Planar Graphs.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
Vertex-Coloring with Defects.
J. Graph Algorithms Appl., 2017

Simple Compact Monotone Tree Drawings.
Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Rooted Uniform Monotone Minimum Spanning Trees.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016
Low Ply Drawings of Trees.
Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015
Fan-planarity: Properties and complexity.
Theor. Comput. Sci., 2015

Many-to-One Boundary Labeling with Backbones.
J. Graph Algorithms Appl., 2015

Computing upward topological book embeddings of upward planar digraphs.
J. Discrete Algorithms, 2015

Profile-Based Text Classification for Children with Dyslexia.
Int. J. Monit. Surveillance Technol. Res., 2015

Monotone Drawings of Graphs with Fixed Embedding.
Algorithmica, 2015

On the construction of increasing-chord graphs on convex point sets.
Proceedings of the 6th International Conference on Information, 2015

Low ply graph drawing.
Proceedings of the 6th International Conference on Information, 2015

A data-logging mechanism to support e-learning systems.
Proceedings of the 6th International Conference on Information, 2015

2014
Making assistive reading tools user friendly: a new platform for Greek dyslexic students empowered by automatic speech recognition.
Multim. Tools Appl., 2014

Text classification for children with dyslexia employing user modelling techniques.
Proceedings of the 5th International Conference on Information, 2014

A Fraud Detection Visualization System Utilizing Radial Drawings and Heat-maps.
Proceedings of the 5th International Conference on Information Visualization Theory and Applications, 2014

2013
Smooth Orthogonal Layouts.
J. Graph Algorithms Appl., 2013

Geometric RAC Simultaneous Drawings of Graphs.
J. Graph Algorithms Appl., 2013

On upward point set embeddability.
Comput. Geom., 2013

Maximizing the Total Resolution of Graphs.
Comput. J., 2013

Occupational fraud detection through visualization.
Proceedings of the 2013 IEEE International Conference on Intelligence and Security Informatics, 2013

2012
The Straight-Line RAC Drawing Problem is NP-Hard.
J. Graph Algorithms Appl., 2012

Drawing trees in a streaming model.
Inf. Process. Lett., 2012

Detecting Periodicity in Serial Data through Visualization.
Proceedings of the Advances in Visual Computing - 8th International Symposium, 2012

2011
Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.
J. Graph Algorithms Appl., 2011

On the Perspectives Opened by Right Angle Crossing Drawings.
J. Graph Algorithms Appl., 2011

Geometric Simultaneous RAC Drawings of Graphs
CoRR, 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.
Algorithmica, 2011

Upward Point-Set Embeddability.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Combining Traditional Map Labeling with Boundary Labeling.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Incorporating Speech Recognition Engine into an Intelligent Assistive Reading System for Dyslexic Students.
Proceedings of the INTERSPEECH 2011, 2011

Upward Point Set Embeddability for Convex Point Sets Is in P.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

Combining Problems on RAC Drawings and Simultaneous Graph Drawings.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010
On Metro-Line Crossing Minimization.
J. Graph Algorithms Appl., 2010

Area-Feature Boundary Labeling.
Comput. J., 2010

Boundary Labeling with Octilinear Leaders.
Algorithmica, 2010

Unilateral Orientation of Mixed Graphs.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Upward Geometric Graph Embeddings into Point Sets.
Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009
Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs
CoRR, 2009

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Crossing-Free Acyclic Hamiltonian Path Completion for Planar <i>st</i>-Digraphs.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

On <i>rho</i>-Constrained Upward Topological Book Embeddings.
Proceedings of the Graph Drawing, 17th International Symposium, 2009

Crossing-Optimal Acyclic HP-Completion for Outerplanar <i>st</i>-Digraphs.
Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008
Efficient Labeling of Collinear Sites.
J. Graph Algorithms Appl., 2008

Optimal Acyclic Hamiltonian Path Completion for Outerplanar Triangulated st-Digraphs (with Application to Upward Topological Book Embeddings)
CoRR, 2008

Locally Delaunay Realizability of Regular Series-Parallel Graphs.
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

Adaptive Reading Assistance for the Inclusion of Students with Dyslexia: The AGENT-DYSL Approach.
Proceedings of the 8th IEEE International Conference on Advanced Learning Technologies, 2008

Spine Crossing Minimization in Upward Topological Book Embeddings.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.
Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007
Boundary labeling: Models and efficient algorithms for rectangular maps.
Comput. Geom., 2007

Computing Upward Topological Book Embeddings of Upward Planar Digraphs.
Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Line Crossing Minimization on Metro Maps.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.
Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Labeling collinear sites.
Proceedings of the APVIS 2007, 2007

2006
Multi-stack Boundary Labeling Problems.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Polygon labelling of minimum leader length.
Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

2005
Boundary Labelling of Optimal Total Leader Length.
Proceedings of the Advances in Informatics, 2005

BLer: A Boundary Labeller for Technical Drawings.
Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004
Dimension-exchange algorithms for token distribution on tree-connected architectures.
J. Parallel Distributed Comput., 2004

Video-on-Demand Based on Delayed-Multicast: Algorithmic Support.
Comput. J., 2004

2002
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms.
Comput. J., 2002

Dimension-Exchange Algorithms for Load Balancing on Trees.
Proceedings of the SIROCCO 9, 2002

Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol.
Proceedings of the SIROCCO 9, 2002

Resource allocation for video-on-demand with "delayed-multicast" protocol.
Proceedings of the Global Telecommunications Conference, 2002

2001
On the Routing Number of Complete d-ARY Trees.
Int. J. Found. Comput. Sci., 2001

2000
Potential-function-based Analysis of an off-line Heap Construction Algorithm.
J. Univers. Comput. Sci., 2000

Three-dimensional orthogonal graph drawing algorithms.
Discret. Appl. Math., 2000

Lower bounds for hot-potato permutation routing on trees.
Proceedings of the SIROCCO 7, 2000

"Scheduled-multicast" with application in multimedia networks.
Proceedings of the IEEE International Conference on Networks 2000: Networking Trends and Challenges in the New Millennium, 2000

Refinement of Three-Dimensional Orthogonal Graph Drawings.
Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999
On-Line Matching Routing on Trees.
Theor. Comput. Sci., 1999

A Note on Deflection Worm Routing on Meshes.
Inf. Process. Lett., 1999

1998
A note on parallel algorithms for optimal h-v drawings of binary trees.
Comput. Geom., 1998

1997
A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms.
IEEE Trans. Parallel Distributed Syst., 1997

Many-to-Many Routings on Trees via Matchings.
Theor. Comput. Sci., 1997

1996
An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method.
IEEE Trans. Computers, 1996

Flit-Serial Packet Routing on Meshes and Tori.
Math. Syst. Theory, 1996

Routing on Trees.
Inf. Process. Lett., 1996

Dynamic Tree Routing under the "Matching with Consumption" Model.
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Two Algorithms for Three Dimensional Orthogonal Graph Drawing.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995
Optimal Stable Merging.
Comput. J., 1995

Routing on Trees via Matchings.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994
Optimal-Algorithms for Multipacket Routing Problems on Rings.
J. Parallel Distributed Comput., 1994

Parallel h-v Drawings of Binary Trees.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements.
IEEE Trans. Parallel Distributed Syst., 1993

Drawing Graphs in the Plane with High Resolution.
SIAM J. Comput., 1993

Optimal algorithms for the many-to-one routing problem on two-dimensional meshes.
Microprocess. Microsystems, 1993

Searching a Pseudo 3-Sided Solid Orthoconvex Grid.
Int. J. Found. Comput. Sci., 1993

1992
Searching a Solid Pseudo 3-Sided Orthoconvex Grid.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992


  Loading...