Authors: Erlebach, T Jansen, K

Citation: T. Erlebach et K. Jansen, The maximum edge-disjoint paths problem in bidirected trees, SIAM J DISC, 14(3), 2001, pp. 326-355

Authors: Erlebach, T Rossmanith, P Stadtherr, H Steger, A Zeugmann, T

Citation: T. Erlebach et al., Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, THEOR COMP, 261(1), 2001, pp. 119-156

Authors: Erlebach, T Jansen, K

Citation: T. Erlebach et K. Jansen, The complexity of path coloring and call scheduling, THEOR COMP, 255(1-2), 2001, pp. 33-50

Authors: Bischof, S Ebner, R Erlebach, T

Citation: S. Bischof et al., Parallel load balancing for problems with good bisectors, J PAR DISTR, 60(9), 2000, pp. 1047-1073

Authors: Erlebach, T Jansen, K Kaklamanis, C Mihail, M Persiano, P

Citation: T. Erlebach et al., Optimal wavelength routing on directed fiber trees, THEOR COMP, 221(1-2), 1999, pp. 119-137