Hans-Dietrich Hecker

According to our database, Hans-Dietrich Hecker authored at least 14 papers between 1975 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

A note on optimal floodlight illumination of stages.

Jana Dietel, Hans-Dietrich Hecker, Andreas Spillner

Inf. Process. Lett., 2008

2002

Minimizing the Size of Vertexlights in Simple Polygons.

Andreas Spillner, Hans-Dietrich Hecker

Math. Log. Q., 2002

2000

A P-Completeness Result for Visibility Graphs of Simple Polygons.

Jana Dietel, Hans-Dietrich Hecker

Math. Log. Q., 2000

1998

Variants of Visibility and their Complexity.

Hans-Dietrich Hecker, Dietmar Schuchardt

Math. Log. Q., 1998

Quadrilaterizing an Orthogonal Polygon in Parallel.

Jana Dietel, Hans-Dietrich Hecker

Math. Log. Q., 1998

1995

Two NP-Hard Art-Gallery Problems for Ortho-Polygons.

Dietmar Schuchardt, Hans-Dietrich Hecker

Math. Log. Q., 1995

1992

The Computational Complexity of some Guard Sets in Polygons.

Uwe Ahlfeld, Hans-Dietrich Hecker

J. Inf. Process. Cybern., 1992

1989

Some NP-hard Polygon Cover Problems.

Hans-Dietrich Hecker, Dietmar Herwig

J. Inf. Process. Cybern., 1989

1984

Das Kompressionstheorem FüR Tempomasze.

Hans-Dietrich Hecker

Math. Log. Q., 1984

Abstrakte Tempomasze und Speed-up-Theoremea FüR Enumerationen rekursiv-AufzäHlbarer Mengen.

Hans-Dietrich Hecker

Math. Log. Q., 1984

1983

Zur Theorie der Enumerationen rekursiv-aufzählbarer Mengen.

Hans-Dietrich Hecker

PhD thesis, 1983

1980

Enumerationen in Speziellen Standardklassen Rekursiv-Aufzählbarer Mengen.

Hans-Dietrich Hecker

Math. Log. Q., 1980

1976

Zur Programmkomplexität Rekursiv Aufzählbarer Mengen.

Hans-Dietrich Hecker

Math. Log. Q., 1976

1975

Eine Bemerkung zur Berechnungskompliziertheit auf Registermaschinen.

Hans-Dietrich Hecker

J. Inf. Process. Cybern., 1975