2 citations · 3 across the 13 of their papers we have counts for
15 papers
Navigating Posets with Few Maps
Stefan Felsner, Jędrzej Hodor, Giacomo Ortali +1
We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset is a…
Grounded String Representations of Series-Parallel Graphs without Transitive Edges
Sabine Cornelsen, Jan Kratochvíl, Miriam Münch +3
In a {\em grounded string representation} of a graph there is a horizontal line and each vertex is represented as a simple curve below with one end point on su…
On Planar Straight-Line Dominance Drawings
Patrizio Angelini, Michael A. Bekos, Giuseppe Di Battista +3
We study the following question, which has been considered since the 90's: Does every -planar graph admit a planar straight-line dominance drawing? We show concrete evidence fo…
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…
Optimal Orthogonal Drawings in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali +1
A planar orthogonal drawing Γ of a connected planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn…
Unbent Collections of Orthogonal Drawings
Todor Antić, Giuseppe Liotta, Tomáš Masařík +5
Recently, there has been interest in representing single graphs by multiple drawings; for example, using graph stories, storyplans, or uncrossed collections. In this paper, we appl…
On the Parameterized Complexity of Bend-Minimum Orthogonal Planarity
Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta +2
Computing planar orthogonal drawings with the minimum number of bends is one of the most relevant topics in Graph Drawing. The problem is known to be NP-hard, even when we want to…
On the Parameterized Complexity of Computing -Orientations with Few Transitive Edges
Carla Binucci, Giuseppe Liotta, Fabrizio Montecchiani +2
Orienting the edges of an undirected graph such that the resulting digraph satisfies some given constraints is a classical problem in graph theory, with multiple algorithmic applic…
Small Point-Sets Supporting Graph Stories
Giuseppe Di Battista, Walter Didimo, Luca Grilli +4
In a graph story the vertices enter a graph one at a time and each vertex persists in the graph for a fixed amount of time , called viewing window. At any time, the user can see…
Rectilinear Planarity of Partial 2-Trees
Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1
A graph is rectilinear planar if it admits a planar orthogonal drawing without bends. While testing rectilinear planarity is NP-hard in general (Garg and Tamassia, 2001), it is a l…
On the Parameterized Complexity of the -Club Cluster Edge Deletion Problem
Fabrizio Montecchiani, Giacomo Ortali, Tommaso Piselli +1
We study the parameterized complexity of the -Club Cluster Edge Deletion problem: Given a graph and two integers and , is it possible to remove at most $k…
Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time
Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1
A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph with vertex-degree at most four) is a crossing-free drawing that maps each vertex of G to a distinct point o…
Spirality and Rectilinear Planarity Testing of Independent-Parallel SP-Graphs
Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1
We study the long-standing open problem of efficiently testing rectilinear planarity of series-parallel graphs (SP-graphs) in the variable embedding setting. A key ingredient behin…
Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time
Walter Didimo, Michael Kaufmann, Giuseppe Liotta +1
A plane graph is rectilinear planar if it admits an embedding-preserving straight-line drawing where each edge is either horizontal or vertical. We prove that rectilinear planarity…
Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
Walter Didimo, Giuseppe Liotta, Giacomo Ortali +1
A planar orthogonal drawing of a planar graph is a geometric representation of such that the vertices are drawn as distinct points of the plane, the edges are drawn as…