Michael Hoffmann

ETH Zürich

other persons with the same name:

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

	2011
44		Tobias Christ, Michael Hoffmann: Wireless Localization within Orthogonal Polyhedra. CCCG 2011
43		Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl: Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535
42		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: The t-Pebbling Number is Eventually Linear in t. Electr. J. Comb. 18(1): (2011)
41		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)
	2010
40		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and Maximum against k Lies. SWAT 2010: 139-149
39		Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. Algorithmica 57(3): 499-516 (2010)
38		Michael Hoffmann, Jirí Matousek, Yoshio Okamoto, Philipp Zumstein: Minimum and maximum against k lies CoRR abs/1002.0562: (2010)
37		Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl: Counting Plane Graphs: Flippability and its Applications CoRR abs/1012.0591: (2010)
36		Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth: Pointed binary encompassing trees: Simple and optimal. Comput. Geom. 43(1): 35-41 (2010)
35		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)
	2009
34		Tobias Christ, Michael Hoffmann: Wireless Localization with Vertex Guards is NP-hard. CCCG 2009: 149-152
33		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
32		Andrea Francke, Michael Hoffmann: The Euclidean degree-4 minimum spanning tree problem is NP-hard. Symposium on Computational Geometry 2009: 179-188
31		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
30		Tobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. SWAT 2008: 77-89
	2007
29		Lars Arge, Michael Hoffmann, Emo Welzl: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings Springer 2007
28		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
27		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
26		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)
25		Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel: An adaptable and extensible geometry kernel. Comput. Geom. 38(1-2): 16-36 (2007)
	2006
24		Csaba D. Tóth, Michael Hoffmann: Spanning trees across axis-parallel segments. CCCG 2006
23		Michael Hoffmann, Yoshio Okamoto: The minimum weight triangulation problem with few inner points. Comput. Geom. 34(3): 149-158 (2006)
22		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)
21		Robert Haas, Michael Hoffmann: Chordless paths through three vertices. Theor. Comput. Sci. 351(3): 360-371 (2006)
20		Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic: Coloring octrees. Theor. Comput. Sci. 363(1): 11-17 (2006)
	2005
19		Michael Hoffmann, Csaba D. Tóth: Pointed binary encompassing trees: Simple and optimal. EuroCG 2005: 93-96
18		Michael Hoffmann, Csaba D. Tóth: Pointed and colored binary encompassing trees. Symposium on Computational Geometry 2005: 81-90
17		Michael Hoffmann: A simple linear algorithm for computing rectilinear 3-centers. Comput. Geom. 31(3): 150-165 (2005)
	2004
16		Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277
15		Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic: Coloring Octrees. COCOON 2004: 62-71
14		Michael Hoffmann, Yoshio Okamoto: The Minimum Weight Triangulation Problem with Few Inner Points. IWPEC 2004: 200-212
13		Robert Haas, Michael Hoffmann: Chordless Paths Through Three Vertices. IWPEC 2004: 25-36
12		Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth: Pointed Binary Encompassing Trees. SWAT 2004: 442-454
	2003
11		Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth: Degree Bounds for Constrained Pseudo-Triangulations. CCCG 2003: 155-158
10		Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke: Pushing blocks is hard. Comput. Geom. 26(1): 21-36 (2003)
9		Michael Hoffmann, Csaba D. Tóth: Segment endpoint visibility graphs are Hamiltonian. Comput. Geom. 26(1): 47-68 (2003)
8		Michael Hoffmann, Csaba D. Tóth: Alternating paths through disjoint line segments. Inf. Process. Lett. 87(6): 287-294 (2003)
	2002
7		Erik D. Demaine, Robert A. Hearn, Michael Hoffmann: Push-2-f is pspace-complete. CCCG 2002: 31-35
6		Michael Hoffmann, Csaba D. Tóth: Connecting points in the presence of obstacles in the plane. CCCG 2002: 63-67
	2001
5		Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel: An Adaptable and Extensible Geometry Kernel. Algorithm Engineering 2001: 79-90
4		Michael Hoffmann, Csaba D. Tóth: Segment endpoint visibility graphs are hamiltonian. CCCG 2001: 109-112
3		Erik D. Demaine, Michael Hoffmann: Pushing blocks is np-complete for noncrossing solution paths. CCCG 2001: 65-68
	2000
2		Michael Hoffmann: Push-* is NP-hard. CCCG 2000
	1999
1		Michael Hoffmann: A simple linear algorithm for computing rectangle 3-centers. CCCG 1999

Coauthor Index

1	Udo Adamy	[15] [20]
2	Oswin Aichholzer	[11] [26] [27] [31]
3	Marwan Al-Jubeh	[33] [41]
4	Lars Arge	[29]
5	Nadia Benbernou	[28]
6	Tobias Christ	[30] [34] [39] [44]
7	Qiang Cui	[35]
8	Vladimir G. Deineko	[16] [22]
9	Erik D. Demaine	[3] [7] [10] [28]
10	Martin L. Demaine	[10] [28]
11	Andrea Francke	[32]
12	Robert Haas	[13] [21]
13	Thomas Hackl	[26] [27] [31]
14	Robert A. Hearn	[7]
15	Susan Hert	[5] [25]
16	Clemens Huemer	[26] [27]
17	Mashhood Ishaque	[28] [33] [41]
18	Lutz Kettner	[5] [25]
19	Peter Koenig	[35]
20	Jirí Matousek	[38] [40] [42]
21	Joseph O'Rourke	[10]
22	Yoshio Okamoto	[14] [16] [22] [23] [30] [38] [39] [40] [42]
23	Alexander Pilz	[31]
24	Sylvain Pion	[5] [25]
25	Attila Pór	[26] [27]
26	Günter Rote	[31]
27	Francisco Santos	[26] [27]
28	Michael Seel	[5] [25]
29	Micha Sharir	[37] [43]
30	Adam Sheffer	[37] [43]
31	József Solymosi	[15] [20]
32	Diane L. Souvaine	[28] [33] [41]
33	Bettina Speckmann	[11] [12] [26] [27] [31] [36]
34	Milos Stojakovic	[15] [20]
35	Csaba D. Tóth	[4] [6] [8] [9] [11] [12] [18] [19] [24] [28] [33] [36] [37] [41] [43]
36	Takeaki Uno	[30] [39]
37	Birgit Vogtenhuber	[26] [27] [31]
38	Emo Welzl	[29] [37] [43]
39	Gerhard J. Woeginger	[16] [22]
40	Arun Yethiraj	[35]
41	Xiao Zhu	[35]
42	Philipp Zumstein	[38] [40] [42]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page