44 citations · 47 across the 2 of their papers we have counts for
4 papers
A universality theorem for allowable sequences with applications
Udo Hoffmann, Keno Merckx
Order types are a well known abstraction of combinatorial properties of a point set. By Mnëv's universality theorem for each semi-algebraic set there is an order type with a re…
Grid Intersection Graphs and Order Dimension
Steven Chaplick, Stefan Felsner, Udo Hoffmann +1
We study subclasses of grid intersection graphs from the perspective of order dimension. We show that partial orders of height two whose comparability graph is a grid intersection…
Upper and Lower Bounds on Long Dual-Paths in Line Arrangements
Udo Hoffmann, Linda Kleist, Tillmann Miltzow
Given a line arrangement with lines, we show that there exists a path of length in the dual graph of formed by its faces. This bound is tight u…
Recognition and Complexity of Point Visibility Graphs
Jean Cardinal, Udo Hoffmann
A point visibility graph is a graph induced by a set of points in the plane, where every vertex corresponds to a point, and two vertices are adjacent whenever the two corresponding…