research
∙
09/01/2023
Bichromatic Perfect Matchings with Crossings
We consider bichromatic point sets with n red and n blue points and stud...
share
research
∙
05/16/2023
Using SAT to study plane Hamiltonian substructures in simple drawings
In 1988 Rafla conjectured that every simple drawing of a complete graph ...
research
∙
03/07/2023
An extension theorem for signotopes
In 1926, Levi showed that, for every pseudoline arrangement 𝒜 and two po...
research
∙
02/28/2023
Linear Size Universal Point Sets for Classes of Planar Graphs
A finite set P of points in the plane is n-universal with respect to a c...
research
∙
09/01/2022
The Rique-Number of Graphs
We continue the study of linear layouts of graphs in relation to known d...
research
∙
08/25/2022
Arrangements of Pseudocircles: On Digons and Triangles
In this article, we study the cell-structure of simple arrangements of p...
research
∙
05/17/2022
Coloring circle arrangements: New 4-chromatic planar graphs
Felsner, Hurtado, Noy and Streinu (2000) conjectured that arrangement gr...
research
∙
12/06/2021
Aspect Ratio Universal Rectangular Layouts
A generic rectangular layout (for short, layout) is a subdivision of an ...
research
∙
09/30/2021
Approximating the Bundled Crossing Number
Bundling crossings is a strategy which can enhance the readability of dr...
research
∙
08/23/2021
On the Queue-Number of Partial Orders
The queue-number of a poset is the queue-number of its cover graph viewe...
research
∙
08/11/2021
Linear Layouts of Complete Graphs
A page (queue) with respect to a vertex ordering of a graph is a set of ...
research
∙
08/25/2020
On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens
A star-simple drawing of a graph is a drawing in which adjacent edges do...
research
∙
07/15/2020
Plattenbauten: Touching Rectangles in Space
Planar bipartite graphs can be represented as touching graphs of horizon...
research
∙
05/26/2020
Topological Drawings meet Classical Theorems from Convex Geometry
In this article we discuss classical theorems from Convex Geometry in th...
research
∙
04/13/2020
Pentagon contact representations
Representations of planar triangulations as contact graphs of a set of i...
research
∙
02/27/2020
The Complexity of Finding Tangles
We study the following combinatorial problem. Given a set of n y-monoton...
research
∙
01/23/2020
Arrangements of Approaching Pseudo-Lines
We consider arrangements of n pseudo-lines in the Euclidean plane where ...
research
∙
01/17/2020
On Covering Numbers, Young Diagrams, and the Local Dimension of Posets
We study covering numbers and local covering numbers with respect to dif...
research
∙
11/06/2019
On the Average Complexity of the k-Level
Let A be an arrangement of n lines in the Euclidean plane. The <i>k-leve...
research
∙
08/20/2019
Line and Plane Cover Numbers Revisited
A measure for the visual complexity of a straight-line crossing-free dra...
research
∙
04/14/2019
Drawing HV-Restricted Planar Graphs
A strict orthogonal drawing of a graph G=(V, E) in R^2 is a drawing of G...
research
∙
02/21/2019
A Note on Covering Young Diagrams with Applications to Local Dimension of Posets
We prove that in every cover of a Young diagram with 2kk steps with gene...
research
∙
12/06/2017
Arrangements of Pseudocircles: On Circularizability
An arrangement of pseudocircles is a collection of simple closed curves ...
research
∙
08/21/2017