38 citations · 41 across the 16 of their papers we have counts for
20 papers
Stack and Queue Layouts with Defects
Michael A. Bekos, Carla Binucci, Emilio Di Giacomo +5
Linear layouts of graphs -- particularly \emph{stack} and \emph{queue} layouts -- are well-established types of representations in graph drawing, thanks to their connection with nu…
Design Space and Implementation of RAG-Based Avatars for Virtual Archaeology
Wilhelm Kerle-Malcharek, Giulio Biondi, Karsten Klein +8
Immersive technologies, such as virtual and augmented reality, are transforming digital heritage by enabling users to explore and interact with culturally significant sites. It is…
Planar Stories of Graph Drawings: Algorithms and Experiments
Carla Binucci, Sabine Cornelsen, Walter Didimo +5
We address the problem of computing a dynamic visualization of a geometric graph as a sequence of frames. Each frame shows only a portion of the graph but their union covers $G…
Flipping Matchings is Hard
Carla Binucci, Fabrizio Montecchiani, Daniel Perz +1
Given a point set and a plane perfect matching on , a flip is an operation that replaces two edges of such that another plane…
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…
Evaluating Animation Parameters for Morphing Edge Drawings
Carla Binucci, Henry Förster, Julia Katheder +1
Partial edge drawings (PED) of graphs avoid edge crossings by subdividing each edge into three parts and representing only its stubs, i.e., the parts incident to the end-nodes. The…
Min--planar Drawings of Graphs
Carla Binucci, Aaron Büngener, Giuseppe Di Battista +7
The study of nonplanar drawings of graphs with restricted crossing configurations is a well-established topic in graph drawing, often referred to as beyond-planar graph drawing. On…
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…
-planar Placement and Packing of -regular Caterpillars
Carla Binucci, Emilio Di Giacomo, Michael Kaufmann +2
This paper studies a \emph{packing} problem in the so-called beyond-planar setting, that is when the host graph is ``almost-planar'' in some sense. Precisely, we consider the case…
On the Complexity of the Storyplan Problem
Carla Binucci, Emilio Di Giacomo, William J. Lenhart +4
Motivated by dynamic graph visualization, we study the problem of representing a graph in the form of a \emph{storyplan}, that is, a sequence of frames with the following prope…
st-Orientations with Few Transitive Edges
Carla Binucci, Walter Didimo, Maurizio Patrignani
The problem of orienting the edges of an undirected graph such that the resulting digraph is acyclic and has a single source s and a single sink t has a long tradition in graph the…
Quasi-upward Planar Drawings with Minimum Curve Complexity
Carla Binucci, Emilio Di Giacomo, Giuseppe Liotta +1
This paper studies the problem of computing quasi-upward planar drawings of bimodal plane digraphs with minimum curve complexity, i.e., drawings such that the maximum number of ben…
On Turn-Regular Orthogonal Representations
Michael A. Bekos, Carla Binucci, Giuseppe Di Battista +5
An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other…
Coloring outerplanar graphs and planar 3-trees with small monochromatic components
Michael A. Bekos, Carla Binucci, Michael Kaufmann +3
In this work, we continue the study of vertex colorings of graphs, in which adjacent vertices are allowed to be of the same color as long as each monochromatic connected component…
An Experimental Study of a 1-planarity Testing and Embedding Algorithm
Carla Binucci, Walter Didimo, Fabrizio Montecchiani
The definition of -planar graphs naturally extends graph planarity, namely a graph is -planar if it can be drawn in the plane with at most one crossing per edge. Unfortunatel…
Upward Book Embeddings of st-Graphs
Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo +3
We study -page upward book embeddings (UBEs) of -graphs, that is, book embeddings of single-source single-sink directed acyclic graphs on pages with the additional re…
Visibility Representations of Boxes in 2.5 Dimensions
Alessio Arleo, Carla Binucci, Emilio Di Giacomo +7
We initiate the study of 2.5D box visibility representations (2.5D-BR) where vertices are mapped to 3D boxes having the bottom face in the plane and edges are unobstructed li…
Placing Arrows in Directed Graph Drawings
Carla Binucci, Markus Chimani, Walter Didimo +2
We consider the problem of placing arrow heads in directed graph drawings without them overlapping other drawn objects. This gives drawings where edge directions can be deduced una…
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…