Michael Hoffmann

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 50

Top Venues

CoRR

Graph Drawing

J. Graph Algorithms Appl.

J. Comput. Geom.

Publications

Michael Hoffmann, Tillmann Miltzow, Simon Weber, Lasse Wulf
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR (2024)
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. 38 (2) (2024)
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
Drawings of Complete Multipartite Graphs up to Triangle Flips. SoCG (2023)
Michael Hoffmann, Meghana M. Reddy
The Number of Edges in Maximal 2-Planar Graphs. SoCG (2023)
Michael Hoffmann, Meghana M. Reddy
The Number of Edges in Maximal 2-planar Graphs. CoRR (2023)
Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
Universal geometric graphs. Comb. Probab. Comput. 32 (5) (2023)
Oswin Aichholzer, Man-Kwun Chiu, Hung P. Hoang, Michael Hoffmann, Jan Kyncl, Yannic Maus, Birgit Vogtenhuber, Alexandra Weinberger
Drawings of Complete Multipartite Graphs Up to Triangle Flips. CoRR (2023)
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
Drawing Shortest Paths in Geodetic Graphs. J. Graph Algorithms Appl. 26 (3) (2022)
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
Bounding and Computing Obstacle Numbers of Graphs. ESA (2022)
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
Long Plane Trees. SoCG (2022)
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl, Irene Parada
On the Maximum Number of Crossings in Star-Simple Drawings of $K_n$ with No Empty Lens. J. Graph Algorithms Appl. 26 (3) (2022)
Martin Balko, Steven Chaplick, Robert Ganian, Siddharth Gupta, Michael Hoffmann, Pavel Valtr, Alexander Wolff
Bounding and computing obstacle numbers of graphs. CoRR (2022)
Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec
Long plane trees. CoRR (2021)
Michael Hoffmann, Jayson Lynch, Andrew Winslow
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. CoRR (2020)
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger
. CoRR (2020)
Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth
Simple Topological Drawings of k-Planar Graphs. Graph Drawing (2020)
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
 + 1)-quasiplanar. J. Comb. Theory, Ser. B 142 (2020)
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada
with No Empty Lens. Graph Drawing (2020)
Michael Hoffmann, Jayson Lynch, Andrew Winslow
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. J. Inf. Process. 28 (2020)
Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
Universal Geometric Graphs. CoRR (2020)
Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger
. Graph Drawing (2020)
Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada
with No Empty Lens. CoRR (2020)
Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann
Monotone Arc Diagrams with few Biarcs. CoRR (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24 (4) (2020)
Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth
Universal Geometric Graphs. WG (2020)
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
Drawing Shortest Paths in Geodetic Graphs. Graph Drawing (2020)
Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck
Drawing Shortest Paths in Geodetic Graphs. CoRR (2020)
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
Halving balls by a hyperplane in deterministic linear time. J. Comput. Geom. 11 (1) (2020)
Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth
Simple Topological Drawings of k-Planar Graphs. CoRR (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. CoRR (2019)
Michael Hoffmann, Boris Klemz
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. ESA (2019)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. Graph Drawing (2019)
Fabrizio Frati, Michael Hoffmann, Vincent Kusters
Simultaneous Embeddings with Few Bends and Crossings. J. Graph Algorithms Appl. 23 (4) (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. Graph Drawing (2019)
Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani
The QuaSEFE Problem. CoRR (2019)
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
Simple k-Planar Graphs are Simple (k+1)-Quasiplanar. CoRR (2019)
Luis Barba, Michael Hoffmann, Matias Korman, Alexander Pilz
Convex Hulls in Polygonal Domains. SWAT (2018)
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68 (2018)
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
Computing nonsimple polygons of minimum perimeter. J. Comput. Geom. 8 (1) (2017)
Luis Barba, William Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell, Bettina Speckmann
Column planarity and partially-simultaneous geometric embedding. J. Graph Algorithms Appl. 21 (6) (2017)
Jeffrey Bosboom, Michael Hoffmann
Netrunner Mate-in-1 or -2 is Weakly NP-Hard. CoRR (2017)
Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow
Obedient Plane Drawings for Disk Intersection Graphs. WADS (2017)
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
The planar tree packing theorem. J. Comput. Geom. 8 (2) (2017)
Michael Hoffmann, Csaba D. Tóth
Two-Planar Graphs Are Quasiplanar. MFCS (2017)
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
Computing Nonsimple Polygons of Minimum Perimeter. SEA (2016)
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
The Planar Tree Packing Theorem. CoRR (2016)
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
Arc diagrams, flip distances, and Hamiltonian triangulations. CoRR (2016)
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
The Planar Tree Packing Theorem. SoCG (2016)
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
Computing Nonsimple Polygons of Minimum Perimeter. CoRR (2016)
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
Single-Player and Two-Player Buttons & Scissors Games. CoRR (2016)
Fabrizio Frati, Michael Hoffmann, Vincent Kusters
Simultaneous Embeddings with Few Bends and Crossings. CoRR (2015)
Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. STACS (2015)
Fabrizio Frati, Michael Hoffmann, Vincent Kusters
Simultaneous Embeddings with Few Bends and Crossings. Graph Drawing (2015)
Jean Cardinal, Michael Hoffmann, Vincent Kusters
On Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 19 (1) (2015)
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
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG (2015)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber
Plane Graphs with Parity Constraints. Graphs Comb. 30 (1) (2014)
Kevin Buchin, Arthur van Goethem, Michael Hoffmann, Marc J. van Kreveld, Bettina Speckmann
Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations. GIScience (2014)
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
Halving Balls in Deterministic Linear Time. CoRR (2014)
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
Covering Folded Shapes. J. Comput. Geom. 5 (1) (2014)
Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote
Quality Ratios of Measures for Graph Drawing Styles. CCCG (2014)
Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer
Interference Minimization in Asymmetric Sensor Networks. ALGOSENSORS (2014)
Michael Hoffmann, Emo Welzl
Editorial. Comput. Geom. 47 (6) (2014)
Michael Hoffmann, Vincent Kusters, Tillmann Miltzow
Halving Balls in Deterministic Linear Time. ESA (2014)
Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer
Interference Minimization in Asymmetric Sensor Networks. CoRR (2014)
Michael Hoffmann, Csaba D. Tóth
Vertex-Colored Encompassing Graphs. Graphs Comb. 30 (4) (2014)
Oswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote
Graph Drawings with Relative Edge Length Specifications. CCCG (2014)
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
Covering Folded Shapes. CoRR (2014)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
Maximizing maximal angles for plane straight-line graphs. Comput. Geom. 46 (1) (2013)
Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow
Covering Folded Shapes. CCCG (2013)
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
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles CoRR (2013)
Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth
Planar Packing of Binary Trees. WADS (2013)
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
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS (2013)
Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira
Convex hull alignment through translation. CCCG (2013)
Jean Cardinal, Michael Hoffmann, Vincent Kusters
On Universal Point Sets for Planar Graphs CoRR (2012)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
Minimum and maximum against k lies. Chic. J. Theor. Comput. Sci. 2012 (2012)
Jean Cardinal, Michael Hoffmann, Vincent Kusters
On Universal Point Sets for Planar Graphs. TJJCCGG (2012)
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
Convex partitions with 2-edge connected dual graphs. J. Comb. Optim. 22 (3) (2011)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
. Electron. J. Comb. 18 (1) (2011)
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
Counting Plane Graphs: Flippability and Its Applications. WADS (2011)
Tobias Christ, Michael Hoffmann
Wireless Localization within Orthogonal Polyhedra. CCCG (2011)
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
Improved Bounds for Wireless Localization. Algorithmica 57 (3) (2010)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
Lies. SWAT (2010)
Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
Pointed binary encompassing trees: Simple and optimal. Comput. Geom. 43 (1) (2010)
Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
Minimum and maximum against k lies CoRR (2010)
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
Counting Plane Graphs: Flippability and its Applications CoRR (2010)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber
Plane Graphs with Parity Constraints. WADS (2009)
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
Convex Partitions with 2-Edge Connected Dual Graphs. COCOON (2009)
Andrea Francke, Michael Hoffmann
The Euclidean degree-4 minimum spanning tree problem is NP-hard. SCG (2009)
Tobias Christ, Michael Hoffmann
Wireless Localization with Vertex Guards is NP-hard. CCCG (2009)
Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno
Improved Bounds for Wireless Localization. SWAT (2008)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
Maximizing Maximal Angles for Plane Straight-Line Graphs. WADS (2007)
Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber
Maximizing Maximal Angles for Plane Straight-Line Graphs CoRR (2007)
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
An adaptable and extensible geometry kernel. Comput. Geom. 38 (1-2) (2007)
Nadia M. Benbernou, Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth
Disjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs. CCCG (2007)
Csaba D. Tóth, Michael Hoffmann
Spanning trees across axis-parallel segments. CCCG (2006)
Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic
Coloring octrees. Theor. Comput. Sci. 363 (1) (2006)
Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
The traveling salesman problem with few inner points. Oper. Res. Lett. 34 (1) (2006)
Robert Haas, Michael Hoffmann
Chordless paths through three vertices. Theor. Comput. Sci. 351 (3) (2006)
Michael Hoffmann, Yoshio Okamoto
The minimum weight triangulation problem with few inner points. Comput. Geom. 34 (3) (2006)
Michael Hoffmann, Csaba D. Tóth
Pointed binary encompassing trees: Simple and optimal. EuroCG (2005)

Michael Hoffmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Hoffmann