Udo Hoffmann

hoff mann.odu@ gmail.com
Algorithms Research Group
Computer Science Department
Universitée libre de Bruxelles

I am a postdoc in the Algorithms Research Group at Université libre de Bruxelles.

Before, I was a PhD student of Stefan Felsner in the Discrete Mathematics group at TU Berlin in supported by the research training group Methods for Discrete Structures.

My research interests are mainly combinatorial and computational geometry.

Publications

1. "Recognition of simple triangle graphs."
   
   • Masters thesis, RWTH Aachen
2. "The slope number of segment intersection graphs"
   
   • EuroCG 2015
3. "Upper and lower bounds on long dual-paths in line arrangements." [arXiv]
   with Linda Kleist and Tillman Miltzow
   • EuroCG 2015
   • Mathematical Foundations of Computer Science 2015
4. "Recognition and complexity of point visibility graphs." [arXiv]
   with Jean Cardinal
   • SOCG 2015
   • Discrete and Computational Geometry
5. "Intersection graphs and geometric objects in the plane."
   • Dissertation, TU Berlin
6. "On the complexity of the planar slope number problem"
   
   • CCCG 2016
   • JGAA
7. "Grid intersection graphs and order dimension" [arXiv]
   with Steve Chaplick, Stefan Felsner and Veit Wiechert
   • accepted ORDER
8. "A universality theorem for allowable sequences with applications."
   with Keno Merckx
   • submitted
9. "Convex allowable sequences"
   with Jean Cardinal
   • EuroCG