
Strong HananiTutte for the Torus
If a graph can be drawn on the torus so that every two independent edges...
read it

Polygons with Prescribed Angles in 2D and 3D
We consider the construction of a polygon P with n vertices whose turnin...
read it

Atomic Embeddability, Clustered Planarity, and Thickenability
We study the atomic embeddability testing problem, which is a common gen...
read it

Z_2genus 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...
read it

A Note on a PictureHanging Puzzle
In the picturehanging puzzle we are to hang a picture so that the strin...
read it

The Crossing Tverberg Theorem
Tverberg's theorem is one of the cornerstones of discrete geometry. It s...
read it

Crossing Minimization in Perturbed Drawings
Due to data compression or low resolution, nearby vertices and edges of ...
read it

The Z_2genus of Kuratowski minors
A drawing of a graph on a surface is independently even if every pair of...
read it

Recognizing Weak Embeddings of Graphs
We present an efficient algorithm for a problem in the interface between...
read it

Counterexample to an extension of the HananiTutte theorem on the surface of genus 4
We find a graph of genus 5 and its drawing on the orientable surface of ...
read it
Radoslav Fulek
is this you? claim profile