We study a variant of the geometric multicut problem, where we are given...
We study the maximum geometric independent set and clique problems in th...
Many problems in Discrete and Computational Geometry deal with simple
po...
We introduce a computational origami problem which we call the segment
f...
In extension problems of partial graph drawings one is given an incomple...
A drawing of a graph is k-plane if no edge is crossed more than k times....
The problem of extending partial geometric graph representations such as...
Algorithmic extension problems of partial graph representations such as
...
An embedding of a graph in a book consists of a linear order of its vert...
We study two new versions of independent and dominating set problems on
...
A matching is a set of edges without common endpoint. It was recently sh...
Label placement in maps is a very challenging task that is critical for ...
A simple drawing D(G) of a graph G = (V,E) is a drawing in which two
edg...
A k-page linear graph layout of a graph G = (V,E) draws all vertices
alo...
Partial edge drawing (PED) is a drawing style for non-planar graphs, in ...
A strict confluent (SC) graph drawing is a drawing of a graph with verti...
Circular layouts are a popular graph drawing style, where vertices are p...