38 citations · 50 across the 13 of their papers we have counts for
19 papers
Tangling and Untangling Trees on Point-sets
Giuseppe Di Battista, Giuseppe Liotta, Maurizio Patrignani +2
We study a question that lies at the intersection of classical research subjects in Topological Graph Theory and Graph Drawing: Computing a drawing of a graph with a prescribed num…
Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces
Patrizio Angelini, Carla Binucci, Giuseppe Di Battista +5
Unit edge-length drawings, rectilinear drawings (where each edge is either a horizontal or a vertical segment), and rectangular face drawings are among the most studied subjects in…
Weakly Leveled Planarity with Bounded Span
Michael Bekos, Giordano Da Lozzo, Fabrizio Frati +5
This paper studies planar drawings of graphs in which each vertex is represented as a point along a sequence of horizontal lines, called levels, and each edge is either a horizonta…
Parameterized Linear Time Transitive Closure
Giorgos Kritikakis, Ioannis G Tollis
Inquiries such as whether a task A depends on a task B, whether an author A has been influenced by a paper B, whether a certain protein is associated with a specific biological pro…
Fast and Practical DAG Decomposition with Reachability Applications
Giorgos Kritikakis, Ioannis G. Tollis
We present practical linear and almost linear-time algorithms to compute a chain decomposition of a directed acyclic graph (DAG), . The number of vertex-disjoint chains co…
Experiments and a User Study for Hierarchical Drawings of Graphs
Panagiotis Lionakis, Giorgos Kritikakis, Ioannis G. Tollis
We present experimental results and a user study for hierarchical drawings of graphs. A detailed hierarchical graph drawing technique that is based on the Path Based Framework (PBF…
Computing a Feedback Arc Set Using PageRank
Vasileios Geladaris, Panagiotis Lionakis, Ioannis G. Tollis
We present a new heuristic algorithm for computing a minimum Feedback Arc Set in directed graphs. The new technique produces solutions that are better than the ones produced by the…
Computing Weak Dominance Drawings with Minimum Number of Fips
Giacomo Ortali, Ioannis G. Tollis
A weak dominance drawing of a DAG , is a -dimensional drawing such that there is a directed path from a vertex to a vertex in if for every…
Algorithms and Experiments Comparing Two Hierarchical Drawing Frameworks
Panagiotis Lionakis, Giorgos Kritikakis, Ioannis G. Tollis
We present algorithms that extend the path-based hierarchical drawing framework and give experimental results. Our algorithms run in time, where is the number of paths…
Adventures in Abstraction: Reachability in Hierarchical Drawings
Panagiotis Lionakis, Giacomo Ortali, Ioannis G. Tollis
We present algorithms and experiments for the visualization of directed graphs that focus on displaying their reachability information. Our algorithms are based on the concepts of…
Multidimensional Dominance Drawings
Giacomo Ortali, Ioannis G. Tollis
Let be a DAG with vertices and edges. Two vertices are incomparable if doesn't reach and vice versa. We denote by \emph{width} of a DAG , , the ma…
Algorithms and Bounds for Drawing Directed Graphs
Giacomo Ortali, Ioannis G. Tollis
In this paper we present a new approach to visualize directed graphs and their hierarchies that completely departs from the classical four-phase framework of Sugiyama and computes…
Planar L-Drawings of Directed Graphs
Steven Chaplick, Markus Chimani, Sabine Cornelsen +5
We study planar drawings of directed graphs in the L-drawing standard. We provide necessary conditions for the existence of these drawings and show that testing for the existence o…
Planar Drawings of Fixed-Mobile Bigraphs
Michael Bekos, Felice De Luca, Walter Didimo +4
A fixed-mobile bigraph G is a bipartite graph such that the vertices of one partition set are given with fixed positions in the plane and the mobile vertices of the other part, tog…
Algorithms for Visualizing Phylogenetic Networks
Ioannis G. Tollis, Konstantinos G. Kakoulis
We study the problem of visualizing phylogenetic networks, which are extensions of the Tree of Life in biology. We use a space filling visualization method, called DAGmaps, in orde…
L-Drawings of Directed Graphs
Patrizio Angelini, Giordano Da Lozzo, Marco Di Bartolomeo +4
We introduce L-drawings, a novel paradigm for representing directed graphs aiming at combining the readability features of orthogonal drawings with the expressive power of matrix r…
Properties and Complexity of Fan-Planarity
Carla Binucci, Emilio Di Giacomo, Walter Didimo +3
In a \emph{fan-planar drawing} of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who pro…
Algorithms and Bounds for Drawing Non-planar Graphs with Crossing-free Subgraphs
Patrizio Angelini, Carla Binucci, Giordano Da Lozzo +5
We initiate the study of the following problem: Given a non-planar graph G and a planar subgraph S of G, does there exist a straight-line drawing Γ of G in the plane such that the…
Weak Dominance Drawings and Linear Extension Diameter
Evgenios M. Kornaropoulos, Ioannis G. Tollis
We introduce the problem of Weak Dominance Drawing for general directed acyclic graphs and we show the connection with the linear extension diameter of a partial order P. We presen…