
Crossing Numbers of BeyondPlanar Graphs Revisited
Graph drawing beyond planarity focuses on drawings of high visual qualit...
read it

Compacting Squares
Edgeconnected configurations of squares are a common model for modular ...
read it

On Compatible Matchings
A matching is compatible to two or more labeled point sets of size n wit...
read it

Efficient Segment Folding is Hard
We introduce a computational origami problem which we call the segment f...
read it

Upward Point Set Embeddings of Paths and Trees
We study upward planar straightline embeddings (UPSE) of directed trees...
read it

Characterizing Universal Reconfigurability of Modular Pivoting Robots
We give both efficient algorithms and hardness results for reconfiguring...
read it

CrossingOptimal Extension of Simple Drawings
In extension problems of partial graph drawings one is given an incomple...
read it

Saturated kPlane Drawings with Few Edges
A drawing of a graph is kplane if no edge is crossed more than k times....
read it

On the Maximum Number of Crossings in StarSimple Drawings of K_n with No Empty Lens
A starsimple drawing of a graph is a drawing in which adjacent edges do...
read it

New Results in Sona Drawing: Hardness and TSP Separation
Given a set of point sites, a sona drawing is a single closed curve, dis...
read it

Extending simple drawings with one edge is hard
A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...
read it

Extending Simple Drawings
Simple drawings of graphs are those in which each pair of edges share at...
read it

Universal Reconfiguration of FacetConnected Modular Robots by Pivots: The O(1) Musketeers
We present the first universal reconfiguration algorithm for transformin...
read it

Graphs with large total angular resolution
The total angular resolution of a straightline drawing is the minimum a...
read it

On the 2colored crossing number
Let D be a straightline drawing of a graph. The rectilinear 2colored c...
read it

Minimal Representations of Order Types by Geometric Graphs
In order to have a compact visualization of the order type of a given po...
read it

How to Fit a Tree in a Box
We study compact straightline embeddings of trees. We show that perfect...
read it
Irene Parada
is this you? claim profile