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

Michael Hoffmann Vis

ETH Zürich

List of publications from the DBLP Bibliography Server - FAQ

other persons with the same name:


Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
32EEMarwan 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
31EEAndrea Francke, Michael Hoffmann: The Euclidean degree-4 minimum spanning tree problem is NP-hard. Symposium on Computational Geometry 2009: 179-188
30EEOswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber: Plane Graphs with Parity Constraints. WADS 2009: 13-24
2008
29EETobias Christ, Michael Hoffmann, Yoshio Okamoto, Takeaki Uno: Improved Bounds for Wireless Localization. SWAT 2008: 77-89
2007
28 Lars Arge, Michael Hoffmann, Emo Welzl: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings Springer 2007
27 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
26EEOswin 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
25EEOswin 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)
24EESusan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel: An adaptable and extensible geometry kernel. Comput. Geom. 38(1-2): 16-36 (2007)
2006
23EECsaba D. Tóth, Michael Hoffmann: Spanning trees across axis-parallel segments. CCCG 2006
22EEMichael Hoffmann, Yoshio Okamoto: The minimum weight triangulation problem with few inner points. Comput. Geom. 34(3): 149-158 (2006)
21EEVladimir 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)
20EERobert Haas, Michael Hoffmann: Chordless paths through three vertices. Theor. Comput. Sci. 351(3): 360-371 (2006)
19EEUdo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic: Coloring octrees. Theor. Comput. Sci. 363(1): 11-17 (2006)
2005
18EEMichael Hoffmann, Csaba D. Tóth: Pointed and colored binary encompassing trees. Symposium on Computational Geometry 2005: 81-90
17EEMichael Hoffmann: A simple linear algorithm for computing rectilinear 3-centers. Comput. Geom. 31(3): 150-165 (2005)
2004
16EEVladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger: The Traveling Salesman Problem with Few Inner Points. COCOON 2004: 268-277
15EEUdo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic: Coloring Octrees. COCOON 2004: 62-71
14EEMichael Hoffmann, Yoshio Okamoto: The Minimum Weight Triangulation Problem with Few Inner Points. IWPEC 2004: 200-212
13EERobert Haas, Michael Hoffmann: Chordless Paths Through Three Vertices. IWPEC 2004: 25-36
12EEMichael 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
10EEErik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke: Pushing blocks is hard. Comput. Geom. 26(1): 21-36 (2003)
9EEMichael Hoffmann, Csaba D. Tóth: Segment endpoint visibility graphs are Hamiltonian. Comput. Geom. 26(1): 47-68 (2003)
8EEMichael Hoffmann, Csaba D. Tóth: Alternating paths through disjoint line segments. Inf. Process. Lett. 87(6): 287-294 (2003)
2002
7EEErik D. Demaine, Robert A. Hearn, Michael Hoffmann: Push-2-f is pspace-complete. CCCG 2002: 31-35
6EEMichael Hoffmann, Csaba D. Tóth: Connecting points in the presence of obstacles in the plane. CCCG 2002: 63-67
2001
5EESusan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel: An Adaptable and Extensible Geometry Kernel. Algorithm Engineering 2001: 79-90
4EEMichael Hoffmann, Csaba D. Tóth: Segment endpoint visibility graphs are hamiltonian. CCCG 2001: 109-112
3EEErik D. Demaine, Michael Hoffmann: Pushing blocks is np-complete for noncrossing solution paths. CCCG 2001: 65-68
2000
2EEMichael Hoffmann: Push-* is NP-hard. CCCG 2000
1999
1EEMichael Hoffmann: A simple linear algorithm for computing rectangle 3-centers. CCCG 1999

Coauthor Index

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

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)