Michael Hoffmann

134 papers A* 5A 15B 11C 2Misc 3Journal 71Unranked 27
YearRankTypeTitle / Venue / Authors
2026 J jnl
A Gray code for arborescences of tournaments.
CoRR
Marthe Bonamy, Michael Hoffmann, Clément Legrand-Duchesne, Günter Rote
2026 J jnl
Long Plane Trees.
ACM Trans. Algorithms
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
2025 J jnl
Crossing Number of 3-Plane Drawings.
CoRR
Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt
2025 A conf
Crossing Number of Simple 3-Plane Drawings.
GD
Miriam Goetze, Michael Hoffmann, Ignaz Rutter, Torsten Ueckerdt
2025 A* conf
Geometric Realizations of Dichotomous Ordinal Graphs.
SoCG
Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, Antonios Symvonis
2025 J jnl
Geometric realizations of dichotomous ordinal graphs.
CoRR
Patrizio Angelini, Sabine Cornelsen, Carolina Haase, Michael Hoffmann, Eleni Katsanou, Fabrizio Montecchiani, Raphael Steiner, Antonios Symvonis
2025 J jnl
On k-planar Graphs without Short Cycles.
J. Graph Algorithms Appl.
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2025 B conf
ParkView: Visualizing Monotone Interleavings.
PacificVis
Thijs Beurskens, Steven van den Broek, Arjen Simons, Willem Sonke, Kevin Verbeek, Tim Ophelders, Michael Hoffmann, Bettina Speckmann
2025 J jnl
ParkView: Visualizing Monotone Interleavings.
CoRR
Thijs Beurskens, Steven van den Broek, Arjen Simons, Willem Sonke, Kevin Verbeek, Tim Ophelders, Michael Hoffmann, Bettina Speckmann
2024 J jnl
Bounding and Computing Obstacle Numbers of Graphs.
SIAM J. Discret. Math.
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2024 A conf
Monotone Arc Diagrams with Few Biarcs.
GD
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2024 J jnl
Monotone Arc Diagrams with few Biarcs.
CoRR
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2024 J jnl
On
CoRR
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2024 A conf
On k-Planar Graphs Without Short Cycles.
GD
Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger
2024 B conf
Recognition of Unit Segment and Polyline Graphs is $\exists \mathbb {R} $-Complete.
WG
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2024 J jnl
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete.
CoRR
Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
2023 J jnl
Drawings of Complete Multipartite Graphs Up to Triangle Flips.
CoRR
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
2023 A* conf
Drawings of Complete Multipartite Graphs up to Triangle Flips.
SoCG
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
2023 J jnl
Drawings of complete multipartite graphs up to triangle flips.
J. Comput. Geom.
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
2023 A* conf
The Number of Edges in Maximal 2-Planar Graphs.
SoCG
Michael Hoffmann, Meghana M. Reddy
2023 J jnl
The Number of Edges in Maximal 2-planar Graphs.
CoRR
Michael Hoffmann, Meghana M. Reddy
2023 J jnl
Universal geometric graphs.
Comb. Probab. Comput.
Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
2022 A conf
Bounding and Computing Obstacle Numbers of Graphs.
ESA
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022 J jnl
Bounding and computing obstacle numbers of graphs.
CoRR
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
2022 J jnl
Drawing Shortest Paths in Geodetic Graphs.
J. Graph Algorithms Appl.
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
2022 A* conf
Long Plane Trees.
SoCG
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
2022 J jnl
On the Maximum Number of Crossings in Star-Simple Drawings of K
J. Graph Algorithms Appl.
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada
2021 J jnl
Long plane trees.
CoRR
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
2020 A conf
Drawing Shortest Paths in Geodetic Graphs.
GD
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
2020 J jnl
Drawing Shortest Paths in Geodetic Graphs.
CoRR
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
2020 J jnl
Halving balls by a hyperplane in deterministic linear time.
J. Comput. Geom.
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
2020 J jnl
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.
CoRR
Michael Hoffmann, Jayson Lynch, Andrew Winslow
2020 J jnl
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.
J. Inf. Process.
Michael Hoffmann, Jayson Lynch, Andrew Winslow
2020 J jnl
Minimal Representations of Order Types by Geometric Graphs.
J. Graph Algorithms Appl.
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2020 J jnl
Monotone Arc Diagrams with few Biarcs.
CoRR
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
2020 A conf
On the Maximum Number of Crossings in Star-Simple Drawings of K
GD
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada
2020 J jnl
On the Maximum Number of Crossings in Star-Simple Drawings of K
CoRR
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada
2020 A conf
Plane Spanning Trees in Edge-Colored Simple Drawings of K
GD
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger
2020 J jnl
Plane Spanning Trees in Edge-Colored Simple Drawings of K
CoRR
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger
2020 J jnl
Simple
J. Comb. Theory B
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2020 A conf
Simple Topological Drawings of k-Planar Graphs.
GD
Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth
2020 J jnl
Simple Topological Drawings of k-Planar Graphs.
CoRR
Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth
2020 B conf
Universal Geometric Graphs.
WG
Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
2020 J jnl
Universal Geometric Graphs.
CoRR
Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
2019 A conf
Minimal Representations of Order Types by Geometric Graphs.
GD
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2019 J jnl
Minimal Representations of Order Types by Geometric Graphs.
CoRR
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2019 J jnl
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar.
CoRR
Patrizio Angelini, Michael A. Bekos, Franz J. Brandenburg, Giordano Da Lozzo, Giuseppe Di Battista, Walter Didimo, Michael Hoffmann, Giuseppe Liotta, Fabrizio Montecchiani, Ignaz Rutter, Csaba D. Tóth
2019 J jnl
Simultaneous Embeddings with Few Bends and Crossings.
J. Graph Algorithms Appl.
Fabrizio Frati, Michael Hoffmann, Vincent Kusters
2019 A conf
The QuaSEFE Problem.
GD
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
2019 J jnl
The QuaSEFE Problem.
CoRR
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
2019 A conf
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian.
ESA
Michael Hoffmann, Boris Klemz
2018 J jnl
Arc diagrams, flip distances, and Hamiltonian triangulations.
Comput. Geom.
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
2018 — conf
Convex Hulls in Polygonal Domains.
SWAT
Luis Barba, Michael Hoffmann, Matias Korman, Alexander Pilz
2017 J jnl
Column planarity and partially-simultaneous geometric embedding.
J. Graph Algorithms Appl.
Luis Barba, William S. Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell, Bettina Speckmann
2017 J jnl
Computing nonsimple polygons of minimum perimeter.
J. Comput. Geom.
Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel
2017 J jnl
Netrunner Mate-in-1 or -2 is Weakly NP-Hard.
CoRR
Jeffrey Bosboom, Michael Hoffmann
2017 B conf
Obedient Plane Drawings for Disk Intersection Graphs.
WADS
Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow
2017 J jnl
The planar tree packing theorem.
J. Comput. Geom.
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2017 B conf
Two-Planar Graphs Are Quasiplanar.
MFCS
Michael Hoffmann, Csaba D. Tóth
2016 J jnl
Arc diagrams, flip distances, and Hamiltonian triangulations.
CoRR
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
2016 B conf
Computing Nonsimple Polygons of Minimum Perimeter.
SEA
Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel
2016 J jnl
Computing Nonsimple Polygons of Minimum Perimeter.
CoRR
Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel
2016 J jnl
Single-Player and Two-Player Buttons & Scissors Games.
CoRR
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
2016 A* conf
The Planar Tree Packing Theorem.
SoCG
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2016 J jnl
The Planar Tree Packing Theorem.
CoRR
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2015 A conf
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations.
STACS
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
2015 J jnl
On Universal Point Sets for Planar Graphs.
J. Graph Algorithms Appl.
Jean Cardinal, Michael Hoffmann, Vincent Kusters
2015 A conf
Simultaneous Embeddings with Few Bends and Crossings.
GD
Fabrizio Frati, Michael Hoffmann, Vincent Kusters
2015 J jnl
Simultaneous Embeddings with Few Bends and Crossings.
CoRR
Fabrizio Frati, Michael Hoffmann, Vincent Kusters
2015 — conf
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).
JCDCGG
Kyle Burke, Erik D. Demaine, Harrison Gregg, Robert A. Hearn, Adam Hesterberg, Michael Hoffmann, Hiro Ito, Irina Kostitsyna, Jody Leonard, Maarten Löffler, Aaron Santiago, Christiane Schmidt, Ryuhei Uehara, Yushi Uno, Aaron Williams
2014 J jnl
Covering Folded Shapes.
CoRR
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2014 J jnl
Covering Folded Shapes.
J. Comput. Geom.
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2014 J jnl
Editorial.
Comput. Geom.
Michael Hoffmann, Emo Welzl
2014 — conf
Graph Drawings with Relative Edge Length Specifications.
CCCG
Oswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote
2014 A conf
Halving Balls in Deterministic Linear Time.
ESA
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
2014 J jnl
Halving Balls in Deterministic Linear Time.
CoRR
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
2014 C conf
Interference Minimization in Asymmetric Sensor Networks.
ALGOSENSORS
Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer
2014 J jnl
Interference Minimization in Asymmetric Sensor Networks.
CoRR
Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer
2014 J jnl
Plane Graphs with Parity Constraints.
Graphs Comb.
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber
2014 — conf
Quality Ratios of Measures for Graph Drawing Styles.
CCCG
Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote
2014 — conf
Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations.
GIScience
Kevin Buchin, Arthur van Goethem, Michael Hoffmann, Marc J. van Kreveld, Bettina Speckmann
2014 J jnl
Vertex-Colored Encompassing Graphs.
Graphs Comb.
Michael Hoffmann, Csaba D. Tóth
2013 J jnl
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
CoRR
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
2013 B conf
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
WADS
Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt
2013 — conf
Convex hull alignment through translation.
CCCG
Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira
2013 — conf
Covering Folded Shapes.
CCCG
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
2013 J jnl
Maximizing maximal angles for plane straight-line graphs.
Comput. Geom.
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
2013 B conf
Planar Packing of Binary Trees.
WADS
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
2012 J jnl
Minimum and maximum against k lies.
Chic. J. Theor. Comput. Sci.
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2012 J jnl
On Universal Point Sets for Planar Graphs
CoRR
Jean Cardinal, Michael Hoffmann, Vincent Kusters
2012 — conf
On Universal Point Sets for Planar Graphs.
TJJCCGG
Jean Cardinal, Michael Hoffmann, Vincent Kusters
2011 J jnl
Convex partitions with 2-edge connected dual graphs.
J. Comb. Optim.
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
2011 B conf
Counting Plane Graphs: Flippability and Its Applications.
WADS
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
2011 J jnl
The
Electron. J. Comb.
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2011 — conf
Wireless Localization within Orthogonal Polyhedra.
CCCG
Tobias Christ, Michael Hoffmann
2010 J jnl
Counting Plane Graphs: Flippability and its Applications
CoRR
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
2010 J jnl
Improved Bounds for Wireless Localization.
Algorithmica
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
2010 — conf
Minimum and Maximum against
SWAT
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010 J jnl
Minimum and maximum against k lies
CoRR
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
2010 J jnl
Pointed binary encompassing trees: Simple and optimal.
Comput. Geom.
Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
2009 Misc conf
Convex Partitions with 2-Edge Connected Dual Graphs.
COCOON
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
2009 B conf
Plane Graphs with Parity Constraints.
WADS
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber
2009 — conf
The Euclidean degree-4 minimum spanning tree problem is NP-hard.
SCG
Andrea Francke, Michael Hoffmann
2009 — conf
Wireless Localization with Vertex Guards is NP-hard.
CCCG
Tobias Christ, Michael Hoffmann
2008 — conf
Improved Bounds for Wireless Localization.
SWAT
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
2007 A ed.
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings
ESA
Lars Arge, Michael Hoffmann, Emo Welzl
2007 J jnl
An adaptable and extensible geometry kernel.
Comput. Geom.
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
2007 — conf
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs.
CCCG
Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
2007 J jnl
Maximizing Maximal Angles for Plane Straight-Line Graphs
CoRR
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
2007 B conf
Maximizing Maximal Angles for Plane Straight-Line Graphs.
WADS
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
2006 J jnl
Chordless paths through three vertices.
Theor. Comput. Sci.
Robert Haas, Michael Hoffmann
2006 J jnl
Coloring octrees.
Theor. Comput. Sci.
Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic
2006 — conf
Spanning trees across axis-parallel segments.
CCCG
Csaba D. Tóth, Michael Hoffmann
2006 J jnl
The minimum weight triangulation problem with few inner points.
Comput. Geom.
Michael Hoffmann, Yoshio Okamoto
2006 J jnl
The traveling salesman problem with few inner points.
Oper. Res. Lett.
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2005 J jnl
A simple linear algorithm for computing rectilinear 3-centers.
Comput. Geom.
Michael Hoffmann
2005 — conf
Pointed and colored binary encompassing trees.
SCG
Michael Hoffmann, Csaba D. Tóth
2005 C conf
Pointed binary encompassing trees: Simple and optimal.
EuroCG
Michael Hoffmann, Csaba D. Tóth
2004 — conf
Chordless Paths Through Three Vertices.
IWPEC
Robert Haas, Michael Hoffmann
2004 Misc conf
Coloring Octrees.
COCOON
Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic
2004 — conf
Pointed Binary Encompassing Trees.
SWAT
Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
2004 — conf
The Minimum Weight Triangulation Problem with Few Inner Points.
IWPEC
Michael Hoffmann, Yoshio Okamoto
2004 Misc conf
The Traveling Salesman Problem with Few Inner Points.
COCOON
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
2003 J jnl
Alternating paths through disjoint line segments.
Inf. Process. Lett.
Michael Hoffmann, Csaba D. Tóth
2003 — conf
Degree Bounds for Constrained Pseudo-Triangulations.
CCCG
Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
2003 J jnl
Pushing blocks is hard.
Comput. Geom.
Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke
2003 J jnl
Segment endpoint visibility graphs are Hamiltonian.
Comput. Geom.
Michael Hoffmann, Csaba D. Tóth
2002 — conf
Connecting points in the presence of obstacles in the plane.
CCCG
Michael Hoffmann, Csaba D. Tóth
2002 — conf
Push-2-f is pspace-complete.
CCCG
Erik D. Demaine, Robert A. Hearn, Michael Hoffmann
2001 — conf
An Adaptable and Extensible Geometry Kernel.
WAE
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
2001 — conf
Pushing blocks is np-complete for noncrossing solution paths.
CCCG
Erik D. Demaine, Michael Hoffmann
2001 — conf
Segment endpoint visibility graphs are hamiltonian.
CCCG
Michael Hoffmann, Csaba D. Tóth
2000 — conf
Push-* is NP-hard.
CCCG
Michael Hoffmann
1999 — conf
A simple linear algorithm for computing rectangle 3-centers.
CCCG
Michael Hoffmann