Michael Hoffmann

ETH Zürich

other persons with the same name:

• Michael Hoffmann 0002 - University of Leicester, UK
• Michael Hoffmann 0003
• Michael Hoffmann 0004
• Michael Hoffmann 0005 - Institut für Mikrowellentechnik, Universität Ulm

	2013
j16		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): 17-28 (2013)
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
j15		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and maximum against k lies. Chicago J. Theor. Comput. Sci. 2012 (2012)
i5		Jean Cardinal, Michael Hoffmann, Vincent Kusters: On Universal Point Sets for Planar Graphs. CoRR abs/1209.3594 (2012)
	2011
j14		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: The t-Pebbling Number is Eventually Linear in t. Electr. J. Comb. 18(1) (2011)
j13		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
j12		Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010)
j11		Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth: Pointed binary encompassing trees: Simple and optimal. Comput. Geom. 43(1): 35-41 (2010)
j10		Xiao Zhu, Peter Koenig, Michael Hoffmann, Arun Yethiraj, Qiang Cui: Establishing effective simulation protocols for beta- and alpha/beta-peptides. III. Molecular mechanical model for acyclic beta-amino acids. Journal of Computational Chemistry 31(10): 2063-2077 (2010)
c23		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: 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)
	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. Symposium on Computational Geometry 2009: 179-188
c19		Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber: Plane Graphs with Parity Constraints. WADS 2009: 13-24
	2008
c18		Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: 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 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, Attila Pór, Francisco Santos, Bettina Speckmann, Birgit Vogtenhuber: Maximizing Maximal Angles for Plane Straight-Line Graphs. WADS 2007: 458-469
e1		Lars Arge, Michael Hoffmann, Emo Welzl (Eds.): 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
i2		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 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, Gerhard J. Woeginger: 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. Symposium on Computational Geometry 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, Csaba D. Tóth: 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. Algorithm Engineering 2001: 79-90
	2000
c2		Michael Hoffmann: Push-* is NP-hard. CCCG 2000
	1999
c1		Michael Hoffmann: A simple linear algorithm for computing rectangle 3-centers. CCCG 1999

Coauthor Index

Colors in the list of coauthors

Last update Sat May 25 03:04:36 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page