Search the dblp DataBase
Michael Hoffmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Oswin Aichholzer, Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
Degree Bounds for Constrained Pseudo-Triangulations. [Citation Graph (0, 0)][DBLP]
CCCG, 2003, pp:155-158 [Conf] - Erik D. Demaine, Michael Hoffmann
Pushing blocks is np-complete for noncrossing solution paths. [Citation Graph (0, 0)][DBLP]
CCCG, 2001, pp:65-68 [Conf] - Erik D. Demaine, Robert A. Hearn, Michael Hoffmann
Push-2-f is pspace-complete. [Citation Graph (0, 0)][DBLP]
CCCG, 2002, pp:31-35 [Conf] - Michael Hoffmann
Push-* is NP-hard. [Citation Graph (0, 0)][DBLP]
CCCG, 2000, pp:- [Conf] - Michael Hoffmann
A simple linear algorithm for computing rectangle 3-centers. [Citation Graph (0, 0)][DBLP]
CCCG, 1999, pp:- [Conf] - Michael Hoffmann, Csaba D. Tóth
Segment endpoint visibility graphs are hamiltonian. [Citation Graph (0, 0)][DBLP]
CCCG, 2001, pp:109-112 [Conf] - Michael Hoffmann, Csaba D. Tóth
Connecting points in the presence of obstacles in the plane. [Citation Graph (0, 0)][DBLP]
CCCG, 2002, pp:63-67 [Conf] - Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic
Coloring Octrees. [Citation Graph (0, 0)][DBLP]
COCOON, 2004, pp:62-71 [Conf] - Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
The Traveling Salesman Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP]
COCOON, 2004, pp:268-277 [Conf] - Michael Hoffmann, Csaba D. Tóth
Pointed and colored binary encompassing trees. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2005, pp:81-90 [Conf] - Robert Haas, Michael Hoffmann
Chordless Paths Through Three Vertices. [Citation Graph (0, 0)][DBLP]
IWPEC, 2004, pp:25-36 [Conf] - Michael Hoffmann, Yoshio Okamoto
The Minimum Weight Triangulation Problem with Few Inner Points. [Citation Graph (0, 0)][DBLP]
IWPEC, 2004, pp:200-212 [Conf] - Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
Pointed Binary Encompassing Trees. [Citation Graph (0, 0)][DBLP]
SWAT, 2004, pp:442-454 [Conf] - Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
An Adaptable and Extensible Geometry Kernel. [Citation Graph (0, 0)][DBLP]
Algorithm Engineering, 2001, pp:79-90 [Conf] - Erik D. Demaine, Martin L. Demaine, Michael Hoffmann, Joseph O'Rourke
Pushing blocks is hard. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2003, v:26, n:1, pp:21-36 [Journal] - Michael Hoffmann
A simple linear algorithm for computing rectilinear 3-centers. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2005, v:31, n:3, pp:150-165 [Journal] - Michael Hoffmann, Yoshio Okamoto
The minimum weight triangulation problem with few inner points. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2006, v:34, n:3, pp:149-158 [Journal] - Michael Hoffmann, Csaba D. Tóth
Segment endpoint visibility graphs are Hamiltonian. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2003, v:26, n:1, pp:47-68 [Journal] - Michael Hoffmann, Csaba D. Tóth
Alternating paths through disjoint line segments. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 2003, v:87, n:6, pp:287-294 [Journal] - Vladimir G. Deineko, Michael Hoffmann, Yoshio Okamoto, Gerhard J. Woeginger
The traveling salesman problem with few inner points. [Citation Graph (0, 0)][DBLP]
Oper. Res. Lett., 2006, v:34, n:1, pp:106-110 [Journal] - Udo Adamy, Michael Hoffmann, József Solymosi, Milos Stojakovic
Coloring octrees. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:363, n:1, pp:11-17 [Journal] - Robert Haas, Michael Hoffmann
Chordless paths through three vertices. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2006, v:351, n:3, pp:360-371 [Journal] - Csaba D. Tóth, Michael Hoffmann
Spanning trees across axis-parallel segments. [Citation Graph (0, 0)][DBLP]
CCCG, 2006, pp:- [Conf] - 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. [Citation Graph (0, 0)][DBLP]
CCCG, 2007, pp:13-16 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
WADS, 2007, pp:458-469 [Conf] - Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, Michael Seel
An adaptable and extensible geometry kernel. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 2007, v:38, n:1-2, pp:16-36 [Journal] - 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 [Citation Graph (0, 0)][DBLP]
CoRR, 2007, v:0, n:, pp:- [Journal]
Wireless Localization with Vertex Guards is NP-hard. [Citation Graph (, )][DBLP]
Convex Partitions with 2-Edge Connected Dual Graphs. [Citation Graph (, )][DBLP]
The Euclidean degree-4 minimum spanning tree problem is NP-hard. [Citation Graph (, )][DBLP]
Pointed binary encompassing trees: Simple and optimal. [Citation Graph (, )][DBLP]
Improved Bounds for Wireless Localization. [Citation Graph (, )][DBLP]
Minimum and Maximum against k Lies. [Citation Graph (, )][DBLP]
Plane Graphs with Parity Constraints. [Citation Graph (, )][DBLP]
Pointed binary encompassing trees: Simple and optimal. [Citation Graph (, )][DBLP]
Minimum and maximum against k lies [Citation Graph (, )][DBLP]
Search in 0.269secs, Finished in 0.272secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002