2008 | ||
---|---|---|
9 | EE | Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner: A note on optimal floodlight illumination of stages. Inf. Process. Lett. 105(4): 121-123 (2008) |
2002 | ||
8 | EE | Andreas Spillner, Hans-Dietrich Hecker: Minimizing the Size of Vertexlights in Simple Polygons. Math. Log. Q. 48(3): 447-458 (2002) |
2000 | ||
7 | EE | Jana Dietel, Hans-Dietrich Hecker: A P-Completeness Result for Visibility Graphs of Simple Polygons. Math. Log. Q. 46(3): 361-375 (2000) |
1998 | ||
6 | Jana Dietel, Hans-Dietrich Hecker: Quadrilaterizing an Orthogonal Polygon in Parallel. Math. Log. Q. 44: 50-68 (1998) | |
5 | Hans-Dietrich Hecker, Dietmar Schuchardt: Variants of Visibility and their Complexity. Math. Log. Q. 44: 522-528 (1998) | |
1995 | ||
4 | Dietmar Schuchardt, Hans-Dietrich Hecker: Two NP-Hard Art-Gallery Problems for Ortho-Polygons. Math. Log. Q. 41: 261-267 (1995) | |
1992 | ||
3 | Uwe Ahlfeld, Hans-Dietrich Hecker: The Computational Complexity of some Guard Sets in Polygons. Elektronische Informationsverarbeitung und Kybernetik 28(6): 331-342 (1992) | |
1989 | ||
2 | Hans-Dietrich Hecker, Dietmar Herwig: Some NP-hard Polygon Cover Problems. Elektronische Informationsverarbeitung und Kybernetik 25(3): 101-108 (1989) | |
1975 | ||
1 | Hans-Dietrich Hecker: Eine Bemerkung zur Berechnungskompliziertheit auf Registermaschinen. Elektronische Informationsverarbeitung und Kybernetik 11(7/8): 437-438 (1975) |
1 | Uwe Ahlfeld | [3] |
2 | Jana Dietel | [6] [7] [9] |
3 | Dietmar Herwig | [2] |
4 | Dietmar Schuchardt | [4] [5] |
5 | Andreas Spillner | [8] [9] |