Thomas Erlebach
Thomas Erlebach
Professor, Department of Computer Science, Durham University
Verified email at - Homepage
Cited by
Cited by
Network analysis: methodological foundations
U Brandes
Springer Science & Business Media, 2005
Network discovery and verification
Z Beerliova, F Eberhard, T Erlebach, A Hall, M Hoffmann, M Mihal'ak, ...
IEEE Journal on selected areas in communications 24 (12), 2168-2181, 2006
Polynomial-time approximation schemes for geometric intersection graphs
T Erlebach, K Jansen, E Seidel
SIAM Journal on Computing 34 (6), 1302-1323, 2005
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
C Ambühl, T Erlebach, M Mihalák, M Nunkesser
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
Optimal bandwidth reservation in hose-model VPNs with multi-path routing
T Erlebach, M Ruegg
IEEE INFOCOM 2004 4, 2275-2282, 2004
Polynomial-time approximation schemes for geometric graphs.
T Erlebach, K Jansen, E Seidel
SODA 1, 671-679, 2001
Scheduling of virtual connections in fast networks
T Erlebach, K Jansen
Proceedings of 4th Workshop on Parallel Systems and Algorithms (PASA˘96), 13-32, 1996
Approximating multiobjective knapsack problems
T Erlebach, H Kellerer, U Pferschy
Management Science 48 (12), 1603-1612, 2002
The complexity of path coloring and call scheduling
T Erlebach, K Jansen
Theoretical Computer Science 255 (1-2), 33-50, 2001
Computing the types of the relationships between autonomous systems
G Di Battista, T Erlebach, A Hall, M Patrignani, M Pizzonia, T Schank
IEEE/ACM Transactions on networking 15 (2), 267-280, 2007
Call scheduling in trees, rings and meshes
T Erlebach, K Jansen
Proceedings of the thirtieth Hawaii International Conference on System …, 1997
Optimal wavelength routing on directed fiber trees
T Erlebach, K Jansen, C Kaklamanis, M Mihail, P Persiano
Theoretical Computer Science 221 (1-2), 119-137, 1999
Constrained bipartite edge coloring with applications to wavelength routing
C Kaklamanis, P Persiano, T Erlebach, K Jansen
International Colloquium on Automata, Languages, and Programming, 493-504, 1997
On the spectrum and structure of Internet topology graphs
D Vukadinović, P Huang, T Erlebach
International Workshop on Innovative Internet Community Systems, 83-95, 2002
On temporal graph exploration
T Erlebach, M Hoffmann, F Kammer
Journal of Computer and System Sciences 119, 1-18, 2021
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
T Erlebach, A Hall
Journal of Scheduling 7 (3), 223-241, 2004
Interval selection: Applications, algorithms, and lower bounds
T Erlebach, FCR Spieksma
Journal of Algorithms 46 (1), 27-53, 2003
Scheduling with release times and deadlines on a minimum number of machines
M Cieliebak, T Erlebach, F Hennecke, B Weber, P Widmayer
Exploring new frontiers of theoretical informatics, 209-222, 2004
Classifying customer-provider relationships in the Internet
T Erlebach, A Hall, T Schank
TIK-Report 145, 2002
A (4+ ĺ)-approximation for the minimum-weight dominating set problem in unit disk graphs
T Erlebach, M Mihalák
International Workshop on Approximation and Online Algorithms, 135-146, 2009
The system can't perform the operation now. Try again later.
Articles 1–20