research
∙
09/01/2020
Strong Hanani-Tutte for the Torus
If a graph can be drawn on the torus so that every two independent edges...
share
research
∙
08/24/2020
Polygons with Prescribed Angles in 2D and 3D
We consider the construction of a polygon P with n vertices whose turnin...
research
∙
07/30/2019
Atomic Embeddability, Clustered Planarity, and Thickenability
We study the atomic embeddability testing problem, which is a common gen...
research
∙
03/20/2019
Z_2-genus of graphs and minimum rank of partial symmetric matrices
The genus g(G) of a graph G is the minimum g such that G has an embeddin...
research
∙
12/15/2018
A Note on a Picture-Hanging Puzzle
In the picture-hanging puzzle we are to hang a picture so that the strin...
research
∙
12/12/2018
The Crossing Tverberg Theorem
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
research
∙
08/23/2018
Crossing Minimization in Perturbed Drawings
Due to data compression or low resolution, nearby vertices and edges of ...
research
∙
03/14/2018
The Z_2-genus of Kuratowski minors
A drawing of a graph on a surface is independently even if every pair of...
research
∙
09/26/2017
Recognizing Weak Embeddings of Graphs
We present an efficient algorithm for a problem in the interface between...
research
∙
09/01/2017
