dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Michael Hoffmann (Selection)

ETH Zürich

List of publications from the DBLP Bibliography Server - FAQ

other persons with the same name:


Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo


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

Selection of 45 from 45 records - Michael Hoffmann has 42 coauthors

Last update 2012-09-10 CET by the DBLP TeamThis material is Open Data Content released under the ODC-BY 1.0 license — See also our legal information page