A simple linear algorithm for computing rectangle 3-centers. - Michael Hoffmann 001 (CCCG, 1999)

Push-* is NP-hard. - Michael Hoffmann 001 (CCCG, 2000)

Pushing blocks is np-complete for noncrossing solution paths. - Erik D. Demaine; Michael Hoffmann 001 (CCCG, 2001)

Push-2-f is pspace-complete. - Erik D. Demaine; Robert A. Hearn; Michael Hoffmann 001 (CCCG, 2002)

Connecting points in the presence of obstacles in the plane. - Michael Hoffmann 001; Csaba D. Tóth (CCCG, 2002)

Degree Bounds for Constrained Pseudo-Triangulations. - Oswin Aichholzer; Michael Hoffmann 001; Bettina Speckmann; Csaba D. Tóth (CCCG, 2003)

Pushing blocks is hard. - Erik D. Demaine; Martin L. Demaine; Michael Hoffmann 001; Joseph O'Rourke (Comput. Geom., 2003)

Segment endpoint visibility graphs are Hamiltonian. - Michael Hoffmann 001; Csaba D. Tóth (Comput. Geom., 2003)

Alternating paths through disjoint line segments. - Michael Hoffmann 001; Csaba D. Tóth (Inf. Process. Lett., 2003)

Pointed Binary Encompassing Trees. - Michael Hoffmann 001; Bettina Speckmann; Csaba D. Tóth (SWAT, 2004)

Pointed and colored binary encompassing trees. - Michael Hoffmann 001; Csaba D. Tóth (SCG, 2005)

Pointed binary encompassing trees: Simple and optimal. - Michael Hoffmann 001; Csaba D. Tóth (EuroCG, 2005)

A simple linear algorithm for computing rectilinear 3-centers. - Michael Hoffmann 001 (Comput. Geom., 2005)

Spanning trees across axis-parallel segments. - Csaba D. Tóth; Michael Hoffmann 001 (CCCG, 2006)

The minimum weight triangulation problem with few inner points. - Michael Hoffmann 001; Yoshio Okamoto (Comput. Geom., 2006)

The traveling salesman problem with few inner points. - Vladimir G. Deineko; Michael Hoffmann 001; Yoshio Okamoto; Gerhard J. Woeginger (Oper. Res. Lett., 2006)

Coloring octrees. - Udo Adamy; Michael Hoffmann 001; József Solymosi; Milos Stojakovic (Theor. Comput. Sci., 2006)

Chordless paths through three vertices. - Robert Haas 001; Michael Hoffmann 001 (Theor. Comput. Sci., 2006)

Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. - Nadia M. Benbernou; Erik D. Demaine; Martin L. Demaine; Michael Hoffmann 001; Mashhood Ishaque; Diane L. Souvaine; Csaba D. Tóth (CCCG, 2007)

An adaptable and extensible geometry kernel. - Susan Hert; Michael Hoffmann 001; Lutz Kettner; Sylvain Pion; Michael Seel (Comput. Geom., 2007)

Wireless Localization with Vertex Guards is NP-hard. - Tobias Christ; Michael Hoffmann 001 (CCCG, 2009)

The Euclidean degree-4 minimum spanning tree problem is NP-hard. - Andrea Francke; Michael Hoffmann 001 (SCG, 2009)

Minimum and Maximum against k Lies. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (SWAT, 2010)

Improved Bounds for Wireless Localization. - Tobias Christ; Michael Hoffmann 001; Yoshio Okamoto; Takeaki Uno (Algorithmica, 2010)

Pointed binary encompassing trees: Simple and optimal. - Michael Hoffmann 001; Bettina Speckmann; Csaba D. Tóth (Comput. Geom., 2010)

Wireless Localization within Orthogonal Polyhedra. - Tobias Christ; Michael Hoffmann 001 (CCCG, 2011)

Counting Plane Graphs: Flippability and Its Applications. - Michael Hoffmann 001; Micha Sharir; Adam Sheffer; Csaba D. Tóth; Emo Welzl (WADS, 2011)

The t-Pebbling Number is Eventually Linear in t. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (Electron. J. Comb., 2011)

Convex partitions with 2-edge connected dual graphs. - Marwan Al-Jubeh; Michael Hoffmann 001; Mashhood Ishaque; Diane L. Souvaine; Csaba D. Tóth (J. Comb. Optim., 2011)

Minimum and maximum against k lies. - Michael Hoffmann 001; Jirí Matousek 001; Yoshio Okamoto; Philipp Zumstein (Chic. J. Theor. Comput. Sci., 2012)

Convex hull alignment through translation. - Michael Hoffmann 001; Vincent Kusters; Günter Rote; Maria Saumell; Rodrigo I. Silveira (CCCG, 2013)

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. - Andrei Asinowski; Jean Cardinal; Nathann Cohen; Sébastien Collette; Thomas Hackl; Michael Hoffmann 001; Kolja B. Knauer; Stefan Langerman; Michal Lason; Piotr Micek; Günter Rote; Torsten Ueckerdt (WADS, 2013)

Planar Packing of Binary Trees. - Markus Geyer; Michael Hoffmann 001; Michael Kaufmann 001; Vincent Kusters; Csaba D. Tóth (WADS, 2013)

Maximizing maximal angles for plane straight-line graphs. - Oswin Aichholzer; Thomas Hackl; Michael Hoffmann 001; Clemens Huemer; Attila Pór; Francisco Santos; Bettina Speckmann; Birgit Vogtenhuber (Comput. Geom., 2013)

Interference Minimization in Asymmetric Sensor Networks. - Yves Brise; Kevin Buchin; Dustin Eversmann; Michael Hoffmann 001; Wolfgang Mulzer (ALGOSENSORS, 2014)

Graph Drawings with Relative Edge Length Specifications. - Oswin Aichholzer; Michael Hoffmann 001; Marc J. van Kreveld; Günter Rote (CCCG, 2014)

Quality Ratios of Measures for Graph Drawing Styles. - Michael Hoffmann 001; Marc J. van Kreveld; Vincent Kusters; Günter Rote (CCCG, 2014)

Halving Balls in Deterministic Linear Time. - Michael Hoffmann 001; Vincent Kusters; Tillmann Miltzow (ESA, 2014)

Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations. - Kevin Buchin; Arthur van Goethem; Michael Hoffmann 001; Marc J. van Kreveld; Bettina Speckmann (GIScience, 2014)

Editorial. - Michael Hoffmann 001; Emo Welzl (Comput. Geom., 2014)

Plane Graphs with Parity Constraints. - Oswin Aichholzer; Thomas Hackl; Michael Hoffmann 001; Alexander Pilz; Günter Rote; Bettina Speckmann; Birgit Vogtenhuber (Graphs Comb., 2014)

Vertex-Colored Encompassing Graphs. - Michael Hoffmann 001; Csaba D. Tóth (Graphs Comb., 2014)

Covering Folded Shapes. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Michael Hoffmann 001; Anna Lubiw; Jack Snoeyink; Andrew Winslow (J. Comput. Geom., 2014)

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (JCDCGG, 2015)

On Universal Point Sets for Planar Graphs. - Jean Cardinal; Michael Hoffmann 001; Vincent Kusters (J. Graph Algorithms Appl., 2015)

Single-Player and Two-Player Buttons & Scissors Games. - Kyle Burke; Erik D. Demaine; Harrison Gregg; Robert A. Hearn; Adam Hesterberg; Michael Hoffmann 001; Hiro Ito; Irina Kostitsyna; Jody Leonard; Maarten Löffler; Aaron Santiago; Christiane Schmidt 001; et al. (CoRR, 2016)

Two-Planar Graphs Are Quasiplanar. - Michael Hoffmann 001; Csaba D. Tóth (MFCS, 2017)

Obedient Plane Drawings for Disk Intersection Graphs. - Bahareh Banyassady; Michael Hoffmann 001; Boris Klemz; Maarten Löffler; Tillmann Miltzow (WADS, 2017)

Netrunner Mate-in-1 or -2 is Weakly NP-Hard. - Jeffrey Bosboom; Michael Hoffmann 001 (CoRR, 2017)

Column planarity and partially-simultaneous geometric embedding. - Luis Barba; William S. Evans; Michael Hoffmann 001; Vincent Kusters; Maria Saumell; Bettina Speckmann (J. Graph Algorithms Appl., 2017)

Computing nonsimple polygons of minimum perimeter. - Sándor P. Fekete; Andreas Haas; Michael Hemmer; Michael Hoffmann 001; Irina Kostitsyna; Dominik Krupke; Florian Maurer 001; Joseph S. B. Mitchell; Arne Schmidt 001; Christiane Schmidt 001; Julian Troegel (J. Comput. Geom., 2017)

The planar tree packing theorem. - Markus Geyer; Michael Hoffmann 001; Michael Kaufmann 001; Vincent Kusters; Csaba D. Tóth (J. Comput. Geom., 2017)

Convex Hulls in Polygonal Domains. - Luis Barba; Michael Hoffmann 001; Matias Korman; Alexander Pilz (SWAT, 2018)

Arc diagrams, flip distances, and Hamiltonian triangulations. - Jean Cardinal; Michael Hoffmann 001; Vincent Kusters; Csaba D. Tóth; Manuel Wettstein (Comput. Geom., 2018)

Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. - Michael Hoffmann 001; Boris Klemz (ESA, 2019)

The QuaSEFE Problem. - Patrizio Angelini; Henry Förster; Michael Hoffmann 001; Michael Kaufmann 001; Stephen G. Kobourov; Giuseppe Liotta; Maurizio Patrignani (GD, 2019)

Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (CoRR, 2019)

Simultaneous Embeddings with Few Bends and Crossings. - Fabrizio Frati; Michael Hoffmann 001; Vincent Kusters (J. Graph Algorithms Appl., 2019)

Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. - Oswin Aichholzer; Michael Hoffmann 001; Johannes Obenaus; Rosna Paul; Daniel Perz; Nadja Seiferth; Birgit Vogtenhuber; Alexandra Weinberger (GD, 2020)

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. - Stefan Felsner; Michael Hoffmann 001; Kristin Knorr; Irene Parada (GD, 2020)

Simple Topological Drawings of k-Planar Graphs. - Michael Hoffmann 001; Chih-Hung Liu 001; Meghana M. Reddy; Csaba D. Tóth (GD, 2020)

Simple k-planar graphs are simple (k + 1)-quasiplanar. - Patrizio Angelini; Michael A. Bekos; Franz J. Brandenburg; Giordano Da Lozzo; Giuseppe Di Battista; Walter Didimo; Michael Hoffmann 001; Giuseppe Liotta; Fabrizio Montecchiani; Ignaz Rutter; Csaba D. Tóth (J. Comb. Theory B, 2020)

Minimal Representations of Order Types by Geometric Graphs. - Oswin Aichholzer; Martin Balko; Michael Hoffmann 001; Jan Kyncl; Wolfgang Mulzer; Irene Parada; Alexander Pilz; Manfred Scheucher; Pavel Valtr 001; Birgit Vogtenhuber; Emo Welzl (J. Graph Algorithms Appl., 2020)

Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. - Michael Hoffmann 001; Jayson Lynch; Andrew Winslow (J. Inf. Process., 2020)

Halving balls by a hyperplane in deterministic linear time. - Michael Hoffmann 001; Vincent Kusters; Tillmann Miltzow (J. Comput. Geom., 2020)

Long Plane Trees. - Sergio Cabello; Michael Hoffmann 001; Katharina Klost; Wolfgang Mulzer; Josef Tkadlec (SoCG, 2022)

Drawing Shortest Paths in Geodetic Graphs. - Sabine Cornelsen; Maximilian Pfister 002; Henry Förster; Martin Gronemann; Michael Hoffmann 001; Stephen G. Kobourov; Thomas Schneck (J. Graph Algorithms Appl., 2022)

On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. - Stefan Felsner; Michael Hoffmann 001; Kristin Knorr; Jan Kyncl; Irene Parada (J. Graph Algorithms Appl., 2022)

The Number of Edges in Maximal 2-Planar Graphs. - Michael Hoffmann 001; Meghana M. Reddy (SoCG, 2023)

Drawings of Complete Multipartite Graphs up to Triangle Flips. - Oswin Aichholzer; Man-Kwun Chiu; Hung P. Hoang 001; Michael Hoffmann 001; Jan Kyncl; Yannic Maus; Birgit Vogtenhuber; Alexandra Weinberger (SoCG, 2023)

Universal geometric graphs. - Fabrizio Frati; Michael Hoffmann 001; Csaba D. Tóth (Comb. Probab. Comput., 2023)

On k-Planar Graphs Without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (GD, 2024)

Monotone Arc Diagrams with Few Biarcs. - Steven Chaplick; Henry Förster; Michael Hoffmann 001; Michael Kaufmann 001 (GD, 2024)

Recognition of Unit Segment and Polyline Graphs is $ exists mathbb {R} $-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (WG, 2024)

Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. - Michael Hoffmann 001; Tillmann Miltzow; Simon Weber 001; Lasse Wulf (CoRR, 2024)

On k-planar Graphs without Short Cycles. - Michael A. Bekos; Prosenjit Bose; Aaron Büngener; Vida Dujmovic; Michael Hoffmann 001; Michael Kaufmann 001; Pat Morin; Saeed Odak; Alexandra Weinberger (CoRR, 2024)

Bounding and Computing Obstacle Numbers of Graphs. - Martin Balko; Steven Chaplick; Robert Ganian; Siddharth Gupta 002; Michael Hoffmann 001; Pavel Valtr 001; Alexander Wolff 001 (SIAM J. Discret. Math., 2024)

Geometric Realizations of Dichotomous Ordinal Graphs. - Patrizio Angelini; Sabine Cornelsen; Carolina Haase; Michael Hoffmann 001; Eleni Katsanou; Fabrizio Montecchiani; Raphael Steiner; Antonios Symvonis (SoCG, 2025)

ParkView: Visualizing Monotone Interleavings. - Thijs Beurskens; Steven van den Broek; Arjen Simons; Willem Sonke; Kevin Verbeek; Tim Ophelders; Michael Hoffmann 001; Bettina Speckmann (PacificVis, 2025)

Crossing Number of 3-Plane Drawings. - Miriam Goetze; Michael Hoffmann 001; Ignaz Rutter; Torsten Ueckerdt (CoRR, 2025)