Authors: Wirth, HC Steffan, J

Citation: Hc. Wirth et J. Steffan, Reload cost problems: minimum diameter spanning tree, DISCR APP M, 113(1), 2001, pp. 73-85

Authors: Hauptmeier, D Krumke, SO Rambau, J Wirth, HC

Citation: D. Hauptmeier et al., Euler is standing in line dial-a-ride problems with precedence-constraints, DISCR APP M, 113(1), 2001, pp. 87-107

Authors: Krumke, SO Marathe, MV Noltemeier, H Ravi, SS Wirth, HC

Citation: So. Krumke et al., Upgrading bottleneck constrained forests, DISCR APP M, 108(1-2), 2001, pp. 129-142

Authors: Noltemeier, H Wirth, HC Krumke, SO

Citation: H. Noltemeier et al., Network design and improvement, ACM C SURV, 31, 1999, pp. 1-5

Authors: Krumke, SO Noltemeier, H Wirth, HC Marathe, MV Ravi, R Ravi, SS Sundaram, R

Citation: So. Krumke et al., Improving spanning trees by upgrading nodes, THEOR COMP, 221(1-2), 1999, pp. 139-155

Authors: Krumke, SO Marathe, MV Noltemeier, H Ravi, R Ravi, SS Sundarum, R Wirth, HC

Citation: So. Krumke et al., Improving minimum cost spanning trees by upgrading nodes, J ALGORITHM, 33(1), 1999, pp. 92-111