default search action
Michael Hoffmann 0001
Person information
- affiliation: ETH Zürich, Switzerland
Other persons with the same name
- Michael Hoffmann — disambiguation page
- Michael Hoffmann 0002 — University of Leicester, UK
- Michael Hoffmann 0003 — Scheer Management GmbH, Saarbrücken, Germany (and 1 more)
- Michael Hoffmann 0004 — Technische Universität Braunschweig, Germany
- Michael Hoffmann 0005 — Universität Ulm, Institut für Mikrowellentechnik, Germany
- Michael Hoffmann 0006
— Fraunhofer Institute for Manufacturing Technology and Advanced Materials, Bremen, Germany
- Michael Hoffmann 0007 — University of Leipzig, AKSW Research Group, Germany
- Michael Hoffmann 0008 — NaMLab GmbH, Dresden, Germany
- Michael Hoffmann 0009 — Hybridlab Inc., Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j33]Martin Balko
Bounding and Computing Obstacle Numbers of Graphs. SIAM J. Discret. Math. 38(2): 1537-1565 (2024) - [c57]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with Few Biarcs. GD 2024: 11:1-11:16 - [c56]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-Planar Graphs Without Short Cycles. GD 2024: 27:1-27:17 - [i32]Michael Hoffmann, Tillmann Miltzow, Simon Weber
Recognition of Unit Segment and Polyline Graphs is ∃R-Complete. CoRR abs/2401.02172 (2024) - [i31]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2408.14299 (2024) - [i30]Michael A. Bekos, Prosenjit Bose, Aaron Büngener, Vida Dujmovic, Michael Hoffmann, Michael Kaufmann, Pat Morin, Saeed Odak, Alexandra Weinberger:
On k-planar Graphs without Short Cycles. CoRR abs/2408.16085 (2024) - 2023
- [j32]Fabrizio Frati
Universal geometric graphs. Comb. Probab. Comput. 32(5): 742-761 (2023) - [c55]Oswin Aichholzer
Drawings of Complete Multipartite Graphs up to Triangle Flips. SoCG 2023: 6:1-6:16 - [c54]Michael Hoffmann, Meghana M. Reddy:
The Number of Edges in Maximal 2-Planar Graphs. SoCG 2023: 39:1-39:15 - [i29]Oswin Aichholzer
Drawings of Complete Multipartite Graphs Up to Triangle Flips. CoRR abs/2303.07401 (2023) - [i28]Michael Hoffmann, Meghana M. Reddy:
The Number of Edges in Maximal 2-planar Graphs. CoRR abs/2303.08726 (2023) - 2022
- [j31]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): 353-361 (2022) - [j30]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Jan Kyncl
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. J. Graph Algorithms Appl. 26(3): 381-399 (2022) - [c53]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long Plane Trees. SoCG 2022: 23:1-23:17 - [c52]Martin Balko
Bounding and Computing Obstacle Numbers of Graphs. ESA 2022: 11:1-11:13 - [i27]Martin Balko
Bounding and computing obstacle numbers of graphs. CoRR abs/2206.15414 (2022) - 2021
- [i26]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long plane trees. CoRR abs/2101.00445 (2021) - 2020
- [j29]Patrizio Angelini
Simple k-planar graphs are simple (k + 1)-quasiplanar. J. Comb. Theory B 142: 1-35 (2020) - [j28]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24(4): 551-572 (2020) - [j27]Michael Hoffmann, Jayson Lynch, Andrew Winslow:
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. J. Inf. Process. 28: 919-928 (2020) - [j26]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving balls by a hyperplane in deterministic linear time. J. Comput. Geom. 11(1): 576-614 (2020) - [c51]Sabine Cornelsen
Drawing Shortest Paths in Geodetic Graphs. GD 2020: 333-340 - [c50]Stefan Felsner
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. GD 2020: 382-389 - [c49]Michael Hoffmann
Simple Topological Drawings of k-Planar Graphs. GD 2020: 390-402 - [c48]Oswin Aichholzer
Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. GD 2020: 482-489 - [c47]Fabrizio Frati
Universal Geometric Graphs. WG 2020: 174-186 - [i25]Steven Chaplick, Henry Förster, Michael Hoffmann, Michael Kaufmann:
Monotone Arc Diagrams with few Biarcs. CoRR abs/2003.05332 (2020) - [i24]Fabrizio Frati, Michael Hoffmann, Csaba D. Tóth:
Universal Geometric Graphs. CoRR abs/2006.11262 (2020) - [i23]Sabine Cornelsen, Maximilian Pfister, Henry Förster, Martin Gronemann, Michael Hoffmann, Stephen G. Kobourov, Thomas Schneck:
Drawing Shortest Paths in Geodetic Graphs. CoRR abs/2008.07637 (2020) - [i22]Oswin Aichholzer, Michael Hoffmann, Johannes Obenaus, Rosna Paul, Daniel Perz, Nadja Seiferth, Birgit Vogtenhuber, Alexandra Weinberger:
Plane Spanning Trees in Edge-Colored Simple Drawings of Kn. CoRR abs/2008.08827 (2020) - [i21]Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth:
Simple Topological Drawings of k-Planar Graphs. CoRR abs/2008.10794 (2020) - [i20]Stefan Felsner, Michael Hoffmann, Kristin Knorr, Irene Parada:
On the Maximum Number of Crossings in Star-Simple Drawings of Kn with No Empty Lens. CoRR abs/2008.11058 (2020) - [i19]Michael Hoffmann, Jayson Lynch, Andrew Winslow:
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard. CoRR abs/2010.08862 (2020)
2010 – 2019
- 2019
- [j25]Fabrizio Frati
Simultaneous Embeddings with Few Bends and Crossings. J. Graph Algorithms Appl. 23(4): 683-713 (2019) - [c46]Michael Hoffmann
Triconnected Planar Graphs of Maximum Degree Five are Subhamiltonian. ESA 2019: 58:1-58:14 - [c45]Oswin Aichholzer
Minimal Representations of Order Types by Geometric Graphs. GD 2019: 101-113 - [c44]Patrizio Angelini
The QuaSEFE Problem. GD 2019: 268-275 - [i18]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 abs/1908.05124 (2019) - [i17]Patrizio Angelini, Henry Förster, Michael Hoffmann, Michael Kaufmann, Stephen G. Kobourov, Giuseppe Liotta, Maurizio Patrignani:
The QuaSEFE Problem. CoRR abs/1908.08708 (2019) - [i16]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 abs/1909.00223 (2019) - 2018
- [j24]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. Comput. Geom. 68: 206-225 (2018) - [c43]Luis Barba, Michael Hoffmann, Matias Korman, Alexander Pilz:
Convex Hulls in Polygonal Domains. SWAT 2018: 8:1-8:13 - 2017
- [j23]Luis Barba, William Evans, Michael Hoffmann, Vincent Kusters, Maria Saumell
Column planarity and partially-simultaneous geometric embedding. J. Graph Algorithms Appl. 21(6): 983-1002 (2017) - [j22]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt
Computing nonsimple polygons of minimum perimeter. J. Comput. Geom. 8(1): 340-365 (2017) - [j21]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The planar tree packing theorem. J. Comput. Geom. 8(2): 109-177 (2017) - [c42]Michael Hoffmann, Csaba D. Tóth:
Two-Planar Graphs Are Quasiplanar. MFCS 2017: 47:1-47:14 - [c41]Bahareh Banyassady, Michael Hoffmann, Boris Klemz, Maarten Löffler, Tillmann Miltzow:
Obedient Plane Drawings for Disk Intersection Graphs. WADS 2017: 73-84 - [i15]Jeffrey Bosboom, Michael Hoffmann:
Netrunner Mate-in-1 or -2 is Weakly NP-Hard. CoRR abs/1710.05121 (2017) - 2016
- [c40]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. SoCG 2016: 41:1-41:15 - [c39]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna
Computing Nonsimple Polygons of Minimum Perimeter. SEA 2016: 134-149 - [i14]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 abs/1603.07077 (2016) - [i13]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
The Planar Tree Packing Theorem. CoRR abs/1603.07737 (2016) - [i12]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 abs/1607.01826 (2016) - [i11]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc diagrams, flip distances, and Hamiltonian triangulations. CoRR abs/1611.02541 (2016) - 2015
- [j20]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. J. Graph Algorithms Appl. 19(1): 529-547 (2015) - [c38]Fabrizio Frati
Simultaneous Embeddings with Few Bends and Crossings. GD 2015: 166-179 - [c37]Kyle Burke
Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract). JCDCGG 2015: 60-72 - [c36]Jean Cardinal, Michael Hoffmann, Vincent Kusters, Csaba D. Tóth, Manuel Wettstein:
Arc Diagrams, Flip Distances, and Hamiltonian Triangulations. STACS 2015: 197-210 - [i10]Fabrizio Frati, Michael Hoffmann, Vincent Kusters:
Simultaneous Embeddings with Few Bends and Crossings. CoRR abs/1508.07921 (2015) - 2014
- [j19]Michael Hoffmann, Emo Welzl:
Editorial. Comput. Geom. 47(6): 643 (2014) - [j18]Oswin Aichholzer
Plane Graphs with Parity Constraints. Graphs Comb. 30(1): 47-69 (2014) - [j17]Michael Hoffmann, Csaba D. Tóth:
Vertex-Colored Encompassing Graphs. Graphs Comb. 30(4): 933-947 (2014) - [j16]Oswin Aichholzer
Covering Folded Shapes. J. Comput. Geom. 5(1): 150-167 (2014) - [c35]Yves Brise, Kevin Buchin
Interference Minimization in Asymmetric Sensor Networks. ALGOSENSORS 2014: 136-151 - [c34]Oswin Aichholzer, Michael Hoffmann, Marc J. van Kreveld, Günter Rote:
Graph Drawings with Relative Edge Length Specifications. CCCG 2014 - [c33]Michael Hoffmann, Marc J. van Kreveld, Vincent Kusters, Günter Rote:
Quality Ratios of Measures for Graph Drawing Styles. CCCG 2014 - [c32]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving Balls in Deterministic Linear Time. ESA 2014: 566-578 - [c31]Kevin Buchin
Travel-Time Maps: Linear Cartograms with Fixed Vertex Locations. GIScience 2014: 18-33 - [i9]Michael Hoffmann, Vincent Kusters, Tillmann Miltzow:
Halving Balls in Deterministic Linear Time. CoRR abs/1405.1894 (2014) - [i8]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 abs/1405.2378 (2014) - [i7]Yves Brise, Kevin Buchin, Dustin Eversmann, Michael Hoffmann, Wolfgang Mulzer:
Interference Minimization in Asymmetric Sensor Networks. CoRR abs/1406.7753 (2014) - 2013
- [j15]Oswin Aichholzer
Maximizing maximal angles for plane straight-line graphs. Comput. Geom. 46(1): 17-28 (2013) - [c30]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 - [c29]Michael Hoffmann, Vincent Kusters, Günter Rote, Maria Saumell, Rodrigo I. Silveira:
Convex hull alignment through translation. CCCG 2013 - [c28]Andrei Asinowski
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [c27]Markus Geyer, Michael Hoffmann, Michael Kaufmann, Vincent Kusters, Csaba D. Tóth:
Planar Packing of Binary Trees. WADS 2013: 353-364 - [i6]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 abs/1302.2426 (2013) - 2012
- [j14]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
Minimum and maximum against k lies. Chic. J. Theor. Comput. Sci. 2012 (2012) - [c26]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. TJJCCGG 2012: 30-41 - [i5]Jean Cardinal, Michael Hoffmann, Vincent Kusters:
On Universal Point Sets for Planar Graphs. CoRR abs/1209.3594 (2012) - 2011
- [j13]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein:
The t-Pebbling Number is Eventually Linear in t. Electron. J. Comb. 18(1) (2011) - [j12]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): 409-425 (2011) - [c25]Tobias Christ, Michael Hoffmann:
Wireless Localization within Orthogonal Polyhedra. CCCG 2011 - [c24]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535 - 2010
- [j11]Tobias Christ, Michael Hoffmann, Yoshio Okamoto
Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010) - [j10]Michael Hoffmann, Bettina Speckmann
Pointed binary encompassing trees: Simple and optimal. Comput. Geom. 43(1): 35-41 (2010) - [c23]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto
Minimum and Maximum against k Lies. SWAT 2010: 139-149 - [i4]Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein
Minimum and maximum against k lies. CoRR abs/1002.0562 (2010) - [i3]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and its Applications. CoRR abs/1012.0591 (2010)
2000 – 2009
- 2009
- [c22]Tobias Christ, Michael Hoffmann:
Wireless Localization with Vertex Guards is NP-hard. CCCG 2009: 149-152 - [c21]Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth:
Convex Partitions with 2-Edge Connected Dual Graphs. COCOON 2009: 192-204 - [c20]Andrea Francke, Michael Hoffmann:
The Euclidean degree-4 minimum spanning tree problem is NP-hard. SCG 2009: 179-188 - [c19]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz
Plane Graphs with Parity Constraints. WADS 2009: 13-24 - 2008
- [c18]Tobias Christ, Michael Hoffmann, Yoshio Okamoto
Improved Bounds for Wireless Localization. SWAT 2008: 77-89 - 2007
- [j9]Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel:
An adaptable and extensible geometry kernel. Comput. Geom. 38(1-2): 16-36 (2007) - [c17]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: 13-16 - [c16]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer
Maximizing Maximal Angles for Plane Straight-Line Graphs. WADS 2007: 458-469 - [e1]Lars Arge, Michael Hoffmann, Emo Welzl:
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Lecture Notes in Computer Science 4698, Springer 2007, ISBN 978-3-540-75519-7 [contents] - [i2]Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Clemens Huemer, Attila Pór, Francisco Santos
Maximizing Maximal Angles for Plane Straight-Line Graphs. CoRR abs/0705.3820 (2007) - 2006
- [j8]Michael Hoffmann, Yoshio Okamoto
The minimum weight triangulation problem with few inner points. Comput. Geom. 34(3): 149-158 (2006) - [j7]Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto
The traveling salesman problem with few inner points. Oper. Res. Lett. 34(1): 106-110 (2006) - [j6]Robert Haas, Michael Hoffmann:
Chordless paths through three vertices. Theor. Comput. Sci. 351(3): 360-371 (2006) - [j5]Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic
Coloring octrees. Theor. Comput. Sci. 363(1): 11-17 (2006) - [c15]Csaba D. Tóth, Michael Hoffmann:
Spanning trees across axis-parallel segments. CCCG 2006 - 2005
- [j4]Michael Hoffmann:
A simple linear algorithm for computing rectilinear 3-centers. Comput. Geom. 31(3): 150-165 (2005) - [c14]Michael Hoffmann, Csaba D. Tóth:
Pointed and colored binary encompassing trees. SCG 2005: 81-90 - [i1]Michael Hoffmann, Csaba D. Tóth:
Pointed binary encompassing trees: Simple and optimal. EuroCG 2005: 93-96 - 2004
- [c13]Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic:
Coloring Octrees. COCOON 2004: 62-71 - [c12]Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger:
The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277 - [c11]Robert Haas, Michael Hoffmann:
Chordless Paths Through Three Vertices. IWPEC 2004: 25-36 - [c10]Michael Hoffmann, Yoshio Okamoto:
The Minimum Weight Triangulation Problem with Few Inner Points. IWPEC 2004: 200-212 - [c9]Michael Hoffmann, Bettina Speckmann
Pointed Binary Encompassing Trees. SWAT 2004: 442-454 - 2003
- [j3]Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke:
Pushing blocks is hard. Comput. Geom. 26(1): 21-36 (2003) - [j2]Michael Hoffmann, Csaba D. Tóth:
Segment endpoint visibility graphs are Hamiltonian. Comput. Geom. 26(1): 47-68 (2003) - [j1]Michael Hoffmann, Csaba D. Tóth:
Alternating paths through disjoint line segments. Inf. Process. Lett. 87(6): 287-294 (2003) - [c8]Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth:
Degree Bounds for Constrained Pseudo-Triangulations. CCCG 2003: 155-158 - 2002
- [c7]Erik D. Demaine, Robert A. Hearn, Michael Hoffmann:
Push-2-f is pspace-complete. CCCG 2002: 31-35 - [c6]Michael Hoffmann, Csaba D. Tóth:
Connecting points in the presence of obstacles in the plane. CCCG 2002: 63-67 - 2001
- [c5]Erik D. Demaine, Michael Hoffmann:
Pushing blocks is np-complete for noncrossing solution paths. CCCG 2001: 65-68 - [c4]Michael Hoffmann, Csaba D. Tóth:
Segment endpoint visibility graphs are hamiltonian. CCCG 2001: 109-112 - [c3]Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel:
An Adaptable and Extensible Geometry Kernel. WAE 2001: 79-90 - 2000
- [c2]Michael Hoffmann:
Push-* is NP-hard. CCCG 2000
1990 – 1999
- 1999
- [c1]Michael Hoffmann:
A simple linear algorithm for computing rectangle 3-centers. CCCG 1999
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-30 20:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: