2000 | ||
---|---|---|
9 | EE | Ansgar Bredenfeld, Edmund Ihler, Oliver Vogel: GENVIS - Model-Based Generation of Data Visualizers. TOOLS (33) 2000: 396-406 |
1999 | ||
8 | EE | Edmund Ihler, Gabriele Reich, Peter Widmayer: Class Steiner Trees and VLSI-design. Discrete Applied Mathematics 90(1-3): 173-194 (1999) |
1996 | ||
7 | EE | Edmund Ihler: On polynomial time approximation schemes and approximation preserving reductions Electronic Colloquium on Computational Complexity (ECCC) 3(43): (1996) |
1994 | ||
6 | Edmund Ihler: The rectilinear class Steiner tree problem for intervals on two parallel lines. Math. Program. 63: 281-296 (1994) | |
1993 | ||
5 | Edmund Ihler, Dorothea Wagner, Frank Wagner: Modeling Hypergraphs by Graphs with the Same Mincut Properties. Inf. Process. Lett. 45(4): 171-175 (1993) | |
1992 | ||
4 | Edmund Ihler: Minimum Rectilinear Steiner Tree for Intervals on two Parallel Lines. WG 1992: 123-134 | |
1991 | ||
3 | Edmund Ihler: The Complexity of Approximating the Class Steiner Tree Problem. WG 1991: 85-96 | |
2 | Edmund Ihler, Gabriele Reich, Peter Widmayer: On Shortest Networks for Classes of Points in the Plane. Workshop on Computational Geometry 1991: 103-111 | |
1990 | ||
1 | Edmund Ihler: Bounds on the quality of approximate solutions to the Group Steiner Problem. WG 1990: 109-118 |
1 | Ansgar Bredenfeld | [9] |
2 | Frank Geraets (Frank Wagner) | [5] |
3 | Gabriele Reich | [2] [8] |
4 | Oliver Vogel | [9] |
5 | Dorothea Wagner | [5] |
6 | Peter Widmayer | [2] [8] |