Antonios Symvonis

Proceedings of the 9th International Conference on Information, 2018

Monotone Drawings of k-Inner Planar Graphs.

[BibT_eX]

[DOI]

Anargyros Oikonomou

Chrysanthi N. Raftopoulou

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

Vertex-Coloring with Defects.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Vincenzo Roselli

J. Graph Algorithms Appl., 2017

Simple Compact Monotone Tree Drawings.

[BibT_eX]

[DOI]

Anargyros Oikonomou

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

Rooted Uniform Monotone Minimum Spanning Trees.

[BibT_eX]

[DOI]

Konstantinos Mastakas

Proceedings of the Algorithms and Complexity - 10th International Conference, 2017

2016

Low Ply Drawings of Trees.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

2015

Fan-planarity: Properties and complexity.

[BibT_eX]

[DOI]

Carla Binucci

Emilio Di Giacomo

Walter Didimo

Fabrizio Montecchiani

Maurizio Patrignani

Ioannis G. Tollis

Theor. Comput. Sci., 2015

Many-to-One Boundary Labeling with Backbones.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2015

Computing upward topological book embeddings of upward planar digraphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

Profile-Based Text Classification for Children with Dyslexia.

[BibT_eX]

[DOI]

Chris Litsas

Maria Mastropavlou

Int. J. Monit. Surveillance Technol. Res., 2015

Monotone Drawings of Graphs with Fixed Embedding.

[BibT_eX]

[DOI]

Algorithmica, 2015

On the construction of increasing-chord graphs on convex point sets.

[BibT_eX]

[DOI]

Konstantinos Mastakas

Proceedings of the 6th International Conference on Information, 2015

Low ply graph drawing.

[BibT_eX]

[DOI]

Proceedings of the 6th International Conference on Information, 2015

A data-logging mechanism to support e-learning systems.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theologos Athanaselis

Multim. Tools Appl., 2014

Text classification for children with dyslexia employing user modelling techniques.

[BibT_eX]

[DOI]

Chris Litsas

Maria Mastropavlou

Proceedings of the 5th International Conference on Information, 2014

A Fraud Detection Visualization System Utilizing Radial Drawings and Heat-maps.

[BibT_eX]

[DOI]

Vassilis Vassiliou

Proceedings of the 5th International Conference on Information Visualization Theory and Applications, 2014

2013

Smooth Orthogonal Layouts.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

Geometric RAC Simultaneous Drawings of Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2013

On upward point set embeddability.

[BibT_eX]

[DOI]

Comput. Geom., 2013

Maximizing the Total Resolution of Graphs.

[BibT_eX]

[DOI]

Comput. J., 2013

Occupational fraud detection through visualization.

[BibT_eX]

[DOI]

Aikaterini A. Sotiraki

Proceedings of the 2013 IEEE International Conference on Intelligence and Security Informatics, 2013

2012

The Straight-Line RAC Drawing Problem is NP-Hard.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2012

Drawing trees in a streaming model.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2012

Detecting Periodicity in Serial Data through Visualization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Visual Computing - 8th International Symposium, 2012

2011

Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.

[BibT_eX]

[DOI]

Alejandro Estrella-Balderrama

J. Graph Algorithms Appl., 2011

On the Perspectives Opened by Right Angle Crossing Drawings.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2011

Geometric Simultaneous RAC Drawings of Graphs

[BibT_eX]

[DOI]

CoRR, 2011

Colored Simultaneous Geometric Embeddings and Universal Pointsets.

[BibT_eX]

[DOI]

Ulrik Brandes

Cesim Erten

Algorithmica, 2011

Upward Point-Set Embeddability.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Combining Traditional Map Labeling with Boundary Labeling.

[BibT_eX]

[DOI]

Dimitrios Papadopoulos

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.

[BibT_eX]

[DOI]

Theologos Athanaselis

Proceedings of the 12th Annual Conference of the International Speech Communication Association, 2011

Upward Point Set Embeddability for Convex Point Sets Is in P.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

Combining Problems on RAC Drawings and Simultaneous Graph Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 19th International Symposium, 2011

2010

On Metro-Line Crossing Minimization.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2010

Area-Feature Boundary Labeling.

[BibT_eX]

[DOI]

Comput. J., 2010

Boundary Labeling with Octilinear Leaders.

[BibT_eX]

[DOI]

Algorithmica, 2010

Unilateral Orientation of Mixed Graphs.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Upward Geometric Graph Embeddings into Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing - 18th International Symposium, 2010

2009

Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs

[BibT_eX]

[DOI]

CoRR, 2009

Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Crossing-Free Acyclic Hamiltonian Path Completion for Planar st-Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

On rho-Constrained Upward Topological Book Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 17th International Symposium, 2009

Crossing-Optimal Acyclic HP-Completion for Outerplanar st-Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 15th Annual International Conference, 2009

2008

Efficient Labeling of Collinear Sites.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

Locally Delaunay Realizability of Regular Series-Parallel Graphs.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Paraskevi K. Tzouveli

Proceedings of the 8th IEEE International Conference on Advanced Learning Technologies, 2008

Spine Crossing Minimization in Upward Topological Book Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

Two Polynomial Time Algorithms for the Metro-line Crossing Minimization Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 16th International Symposium, 2008

2007

Boundary labeling: Models and efficient algorithms for rectangular maps.

[BibT_eX]

[DOI]

Comput. Geom., 2007

Computing Upward Topological Book Embeddings of Upward Planar Digraphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 18th International Symposium, 2007

Line Crossing Minimization on Metro Maps.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

Colored Simultaneous Geometric Embeddings.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 13th Annual International Conference, 2007

Labeling collinear sites.

[BibT_eX]

[DOI]

Proceedings of the APVIS 2007, 2007

2006

Multi-stack Boundary Labeling Problems.

[BibT_eX]

[DOI]

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Polygon labelling of minimum leader length.

[BibT_eX]

[DOI]

Proceedings of the Asia-Pacific Symposium on Information Visualisation, 2006

2005

Boundary Labelling of Optimal Total Leader Length.

[BibT_eX]

[DOI]

Proceedings of the Advances in Informatics, 2005

BLer: A Boundary Labeller for Technical Drawings.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 13th International Symposium, 2005

2004

Dimension-exchange algorithms for token distribution on tree-connected architectures.

[BibT_eX]

[DOI]

Michael E. Houle

J. Parallel Distributed Comput., 2004

Video-on-Demand Based on Delayed-Multicast: Algorithmic Support.

[BibT_eX]

[DOI]

Comput. J., 2004

2002

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

[BibT_eX]

[DOI]

Comput. J., 2002

Dimension-Exchange Algorithms for Load Balancing on Trees.

[BibT_eX]

Michael E. Houle

Proceedings of the SIROCCO 9, 2002

Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol.

[BibT_eX]

Proceedings of the SIROCCO 9, 2002

Resource allocation for video-on-demand with "delayed-multicast" protocol.

[BibT_eX]

[DOI]

Chi Nguyen

Doan B. Hoang

Proceedings of the Global Telecommunications Conference, 2002

2001

On the Routing Number of Complete d-ARY Trees.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2001

2000

Potential-function-based Analysis of an off-line Heap Construction Algorithm.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2000

Three-dimensional orthogonal graph drawing algorithms.

[BibT_eX]

[DOI]

Peter Eades

Sue Whitesides

Discret. Appl. Math., 2000

Lower bounds for hot-potato permutation routing on trees.

[BibT_eX]

Proceedings of the SIROCCO 7, 2000

"Scheduled-multicast" with application in multimedia networks.

[BibT_eX]

[DOI]

Hossam El-Gindy

Chi Nguyen

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.

[BibT_eX]

[DOI]

Benjamin Yin-Sun Lynn

Proceedings of the Graph Drawing, 8th International Symposium, 2000

1999

On-Line Matching Routing on Trees.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

A Note on Deflection Worm Routing on Meshes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1999

1998

A note on parallel algorithms for optimal h-v drawings of binary trees.

[BibT_eX]

[DOI]

Panagiotis Takis Metaxas

Comput. Geom., 1998

1997

A General Method for Deflection Worm Routing on Meshes Based on Packet Routing Algorithms.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1997

Many-to-Many Routings on Trees via Matchings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

1996

An Empirical Study of Off-Line Permutation Packet Routing on Two-Dimensional Meshes Based on the Multistage Routing Method.

[BibT_eX]

[DOI]

Jonathon Tidswell

IEEE Trans. Computers, 1996

Flit-Serial Packet Routing on Meshes and Tori.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1996

Routing on Trees.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1996

Dynamic Tree Routing under the "Matching with Consumption" Model.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 7th International Symposium, 1996

Two Algorithms for Three Dimensional Orthogonal Graph Drawing.

[BibT_eX]

[DOI]

Peter Eades

Sue Whitesides

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

Optimal Stable Merging.

[BibT_eX]

[DOI]

Comput. J., 1995

Routing on Trees via Matchings.

[BibT_eX]

[DOI]

Louxin Zhang

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

Optimal-Algorithms for Multipacket Routing Problems on Rings.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Parallel h-v Drawings of Binary Trees.

[BibT_eX]

[DOI]

Panagiotis Takis Metaxas

Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

1993

An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1993

Drawing Graphs in the Plane with High Resolution.

[BibT_eX]

[DOI]

Frank Thomson Leighton

Emo Welzl

Gerhard J. Woeginger

SIAM J. Comput., 1993

Optimal algorithms for the many-to-one routing problem on two-dimensional meshes.

[BibT_eX]

[DOI]

Microprocess. Microsystems, 1993

Searching a Pseudo 3-Sided Solid Orthoconvex Grid.

[BibT_eX]

[DOI]

Spyros Tragoudas

Int. J. Found. Comput. Sci., 1993

1992

Searching a Solid Pseudo 3-Sided Orthoconvex Grid.

[BibT_eX]

[DOI]