- 205Session C6.2 12th Canadian Conference on Computational Geometry Motion Planning Amidst Movable Square Blocks
- A Simple Linear Algorithm for Computing Rectangular 3-Centers Michael Ho mann
- Connecting Points in the Presence of Obstacles in the Plane Michael Ho mann 1 Csaba D. T oth 1;2
- Covering Polygons with Few Rectangles (Extended Abstract)
- CCCG 2006, Kingston, Ontario, August 1416, 2006 Spanning trees across axis-parallel segments
- Session C6.2 12th Canadian Conference on Computational Geometry Motion Planning Amidst Movable Square Blocks
- Pointed Binary Encompassing Trees: Simple and Optimal Michael Ho#mann # Csaba D. Toth +
- Pointed and Colored Binary Encompassing Trees Michael Ho#mann
- PushPushk is PSPACEComplete # Erik D. Demaine a , Michael Ho#mann b , and Markus Holzer c
- Pointed Binary Encompassing Trees: Simple and Optimal Michael Hoffmann
- Pointed and Colored Binary Encompassing Trees Michael Hoffmann
- Natural Wireless Localization is NP-hard Tobias Christ1
- Segment endpoint visibility graphs are Hamiltonian M. Ho mann and Cs. D. T oth
- Maximizing Maximal Angles for Plane Straight Line Graphs Oswin Aichholzer
- Alternating Paths through Disjoint Line Segments Michael Hoffmann and Csaba D. Toth
- An Adaptable and Extensible Geometry Kernel Susan Hert, Michael Hoffmann, Lutz Kettner,
- A Simple Linear Algorithm for Computing Rectangular 3Centers Michael Hoffmann \Lambda
- CCCG 2009, Vancouver, BC, August 1719, 2009 Wireless Localization with Vertex Guards is NP-hard
- Pointed Encompassing Trees (Extended Abstract)
- Degree Bounds for Constrained Pseudo-Triangulations Oswin Aichholzer
- An Adaptable and Extensible Geometry Kernel Susan Hert 1 , Michael Hoffmann 2 , Lutz Kettner 3 ,
- Pointed Encompassing Trees (Extended Abstract)
- Degree Bounds for Constrained PseudoTriangulations Oswin Aichholzer # Michael Ho#mann + Bettina Speckmann # Csaba D. Toth
- Alternating Paths through Disjoint Line Segments ? Michael Hoffmann and Csaba D. T
- CCCG 2006, Kingston, Ontario, August 14--16, 2006 Spanning trees across axisparallel segments
