2 citations · 3 across the 13 of their papers we have counts for
4 papers · 1 filter
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…