MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Thomas Erlebach" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

41 documents found, showing 1 through 10. Next 10 →

ATOM

Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms
by Thomas Erlebach, Klaus Jansen, K. Jansen — 2000 — Workshop on Approximation and Randomization Algorithms in Communication Networks (2000), Carleton Scienti
…Conversion of Coloring Algorithms into Maximum Weight Independent Set Algorithms T. ERLEBACH ETH Z…
Cited by 11 (5 self) – Add To MetaCart

Independence and Coloring Problems on Intersection Graphs of Disks
by Thomas Erlebach, Jiri Fiala — 2001
…Independence and coloring problems on intersection graphs of disks Thomas Erlebach 1 and Jir…
Cited by 7 (2 self) – Add To MetaCart

Maximizing the Number of Connections in Optical Tree Networks
by Thomas Erlebach, Klaus Jansen — 1998 — In Proceedings of the 9th Annual International Symposium on Algorithms and Computation (1998), LNCS 1533
…Maximizing the Number of Connections in Optical Tree Networks Thomas Erlebach ?;1 and Klaus…
Cited by 10 (4 self) – Add To MetaCart

Efficient Implementation of an Optimal Greedy Algorithm for Wavelength Assignment in Directed Tree Networks
by Thomas Erlebach, Klaus Jansen — 1998 — Proceedings of the 2nd Workshop on Algorithm Engineering WAE'98, Technical Report MPI-I-98-1-019, pages 13--24, Max-Planck-Institut fur Informatik, Saarbrucken
… Thomas Erlebach 1 Institut fur Informatik, TU Munchen, 80290 Munchen, Germany e-mail: erlebach…
Cited by 2 (1 self) – Add To MetaCart

Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees
by Thomas Erlebach, Klaus Jansen — 2000
… in Bidirected Trees Thomas Erlebach 1 and Klaus Jansen 2 1 Computer Engineering and Networks Laboratory…
Cited by 1 (0 self) – Add To MetaCart

On-Line Coloring of Geometric Intersection Graphs
by Thomas Erlebach, Jiri Fiala — 2002
…On-line coloring of geometric intersection graphs Thomas Erlebach 1 Jir Fiala y2 1 ETH Z…
Cited by 2 (0 self) – Add To MetaCart

Routing in All-Optical Ring Networks Revisited
by Stamatis Stefanakos, Thomas Erlebach — 2004
… Thomas Erlebach Computer Engineering and Networks Laboratory (TIK) ETH Zürich, CH-8092 Zürich…
Cited by 1 (1 self) – Add To MetaCart

Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing
by Thomas Erlebach, Maurice Rüegg — 2004 — IEEE Infocom
…Optimal Bandwidth Reservation in Hose-Model VPNs with Multi-Path Routing Thomas Erlebach Computer…
Cited by 16 (0 self) – Add To MetaCart

Scheduling of Virtual Connections in Fast Networks
by Thomas Erlebach, Klaus Jansen — 1996 — In Proc. of Parallel Systems and Algorithms (PASA
…SCHEDULING OF VIRTUAL CONNECTIONS IN FAST NETWORKS THOMAS ERLEBACH Institut fur Informatik…
Cited by 49 (6 self) – Add To MetaCart

The Maximum Edge-Disjoint Paths Problem In Bidirected Trees
by Thomas Erlebach, Klaus Jansen — 1998 — SIAM Journal on Discrete Mathematics
…THE MAXIMUM EDGE-DISJOINT PATHS PROBLEM IN BIDIRECTED TREES THOMAS ERLEBACH y AND KLAUS JANSEN…
Cited by 14 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB