Ioannis Tollis

Prof. Dr. Ioannis Tollis

Department of Computer Science, University of Crete, Voutes Campus, 700 13 Heraklion, Crete, Greece

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 1999 in Journal of Graph Algorithms and Applications
Verified
Journal Article
Open access
APAchilleas Papakostas
Achilleas Papakostas
Ioannis TollisIoannis Tollis
Ioannis Tollis

4 June 2021 in SN Computer Science
Verified
Journal Article
Closed access
PDF file
PLPanagiotis Lionakis
Panagiotis Lionakis
GOGiacomo Ortali
Giacomo Ortali
Ioannis TollisIoannis Tollis
Ioannis Tollis

1 January 2013
Verified
Book Chapter
Open access
PDF file
EGEmilio Di Giacomo
Emilio Di Giacomo
WDWalter Didimo
Walter Didimo
GLGiuseppe Liotta
Giuseppe Liotta
Fabrizio MontecchianiFabrizio Montecchiani
Fabrizio Montecchiani
Ioannis TollisIoannis Tollis
Ioannis Tollis
We propose an approach that allows a user to explore a layout produced by any graph drawing algorithm, in order to reduce the visual complexity and clarify its presentation. Our approach is based on stratifying the drawing into layers with desired properties; layers can be explored and combined by the user to gradually acquire details. We present stratification heuristics, a user study, and an experimental analysis that evaluates how our stratification heuristics behave on the drawings computed by a variety of popular force-directed algorithms.

19 January 2023
Verified
Book Chapter
Closed access
PDF file
VGVasileios Geladaris
Vasileios Geladaris
PLPanagiotis Lionakis
Panagiotis Lionakis
Ioannis TollisIoannis Tollis
Ioannis Tollis

29 May 2023 in IEEE Access
Verified
Journal Article
Open access
PLPanagiotis Lionakis
Panagiotis Lionakis
GKGiorgos Kritikakis
Giorgos Kritikakis
Ioannis TollisIoannis Tollis
Ioannis Tollis
We present a detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF) . Extensive edge bundling is applied to draw all edges of the graph and the height of the drawing is minimized using compaction. We present experimental results and a user study for hierarchical drawings of graphs that show the usefulness of the new drawing technique. The drawings produced by the new framework are compared to drawings produced by the well known Sugiyama framework in terms of area, number of bends, number of crossings, and execution time. The new algorithm runs very fast and produces drawings that are readable and more efficient in terms of area and number of bends. Furthermore, since there are advantages (and disadvantages) to both frameworks, we performed a user study. The results show that the drawings produced by the new framework are well received in terms of clarity, readability, and usability. Hence, the new technique offers an interesting alternative to drawing hierarchical graphs, and is especially useful in applications where user defined paths are important and need to be highlighted.

28 March 2016 in Algorithms
Verified
Journal Article
Open access
PDF file
KKKonstantinos Kakoulis
Konstantinos Kakoulis
Ioannis TollisIoannis Tollis
Ioannis Tollis
In this paper, we investigate how one can modify an orthogonal graph drawing to accommodate the placement of overlap-free labels with the minimum cost (i.e., minimum increase of the area and preservation of the quality of the drawing). We investigate computational complexity issues of variations of that problem, and we present polynomial time algorithms that find the minimum increase of space in one direction, needed to resolve overlaps, while preserving the orthogonal representation of the orthogonal drawing when objects have a predefined partial order.