research
∙
09/02/2023
Cops and Robbers on 1-Planar Graphs
Cops and Robbers is a well-studied pursuit-evasion game in which a set o...
share
research
∙
08/27/2022
An FPT Algorithm for Bipartite Vertex Splitting
Bipartite graphs model the relationship between two disjoint sets of obj...
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
∙
03/10/2020
Drawing Graphs with Circular Arcs and Right-Angle Crossings
In a RAC drawing of a graph, vertices are represented by points in the p...
research
∙
07/18/2019
On Arrangements of Orthogonal Circles
In this paper, we study arrangements of orthogonal circles, that is, arr...
research
∙
12/11/2018
Bundled Crossings Revisited
An effective way to reduce clutter in a graph drawing that has (many) cr...
research
∙
04/20/2018
Planar Steiner Orientation is NP-complete
Many applications in graph theory are motivated by routing or flow probl...
research
∙
09/20/2017
Drawing Graphs on Few Circles and Few Spheres
Given a drawing of a graph, its visual complexity is defined as the numb...
research
∙
08/29/2017