Ikuti
Thomas Erlebach
Thomas Erlebach
Professor, Department of Computer Science, Durham University
Email yang diverifikasi di durham.ac.uk - Beranda
Judul
Dikutip oleh
Dikutip oleh
Tahun
Network analysis: methodological foundations
U Brandes
Springer Science & Business Media, 2005
15872005
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
4202006
Polynomial-time approximation schemes for geometric intersection graphs
T Erlebach, K Jansen, E Seidel
SIAM Journal on Computing 34 (6), 1302-1323, 2005
3692005
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
C Ambühl, T Erlebach, M Mihalák, M Nunkesser
International Workshop on Approximation Algorithms for Combinatorial …, 2006
1922006
On temporal graph exploration
T Erlebach, M Hoffmann, F Kammer
Journal of Computer and System Sciences 119, 1-18, 2021
1512021
Optimal bandwidth reservation in hose-model VPNs with multi-path routing
T Erlebach, M Ruegg
IEEE INFOCOM 2004 4, 2275-2282, 2004
1462004
Approximating multiobjective knapsack problems
T Erlebach, H Kellerer, U Pferschy
Management Science 48 (12), 1603-1612, 2002
1432002
The complexity of path coloring and call scheduling
T Erlebach, K Jansen
Theoretical Computer Science 255 (1-2), 33-50, 2001
1402001
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
1311996
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
1052007
Call scheduling in trees, rings and meshes
T Erlebach, K Jansen
Proceedings of the thirtieth Hawaii International Conference on System …, 1997
1001997
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
911999
Computing minimum spanning trees with uncertainty
T Erlebach, M Hoffmann, D Krizanc, M Mihal'Ák, R Raman
arXiv preprint arXiv:0802.2855, 2008
872008
On the spectrum and structure of Internet topology graphs
D Vukadinović, P Huang, T Erlebach
Innovative Internet Computing Systems: Second International Workshop, IICS …, 2002
872002
Constrained bipartite edge coloring with applications to wavelength routing
C Kaklamanis, P Persiano, T Erlebach, K Jansen
Automata, Languages and Programming: 24th International Colloquium, ICALP'97 …, 1997
871997
Length-bounded cuts and flows
G Baier, T Erlebach, A Hall, E Köhler, P Kolman, O Pangrác, H Schilling, ...
ACM Transactions on Algorithms (TALG) 7 (1), 1-27, 2010
802010
NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow
T Erlebach, A Hall
Journal of Scheduling 7, 223-241, 2004
802004
Interval selection: Applications, algorithms, and lower bounds
T Erlebach, FCR Spieksma
Journal of Algorithms 46 (1), 27-53, 2003
742003
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: IFIP 18th World Computer …, 2004
712004
Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries
T Erlebach, P Rossmanith, H Stadtherr, A Steger, T Zeugmann
Theoretical Computer Science 261 (1), 119-156, 2001
712001
Sistem tidak dapat melakukan operasi ini. Coba lagi nanti.
Artikel 1–20