research
∙
02/25/2022
Outside-Obstacle Representations with All Vertices on the Outer Face
An obstacle representation of a graph G consists of a set of polygonal o...
share
research
∙
02/23/2022
The Segment Number: Algorithms and Universal Lower Bounds for Some Classes of Planar Graphs
The segment number of a planar graph G is the smallest number of line se...
research
∙
08/30/2021
Simplifying Non-Simple Fan-Planar Drawings
A drawing of a graph is fan-planar if the edges intersecting a common ed...
research
∙
03/17/2021
Adjacency Graphs of Polyhedral Surfaces
We study whether a given graph can be realized as an adjacency graph of ...
research
∙
08/23/2019
On the edge-vertex ratio of maximal thrackles
A drawing of a graph in the plane is a thrackle if every pair of edges i...
research
∙
09/07/2018
The Partition Spanning Forest Problem
Given a set of colored points in the plane, we ask if there exists a cro...
research
∙
02/19/2018
Convexity-Increasing Morphs of Planar Graphs
We study the problem of convexifying drawings of planar graphs. Given an...
research
∙
11/13/2017
Linear-Time Algorithms for Maximum-Weight Induced Matchings and Minimum Chain Covers in Convex Bipartite Graphs
A bipartite graph G=(U,V,E) is convex if the vertices in V can be linear...
research
∙
08/24/2017
