Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Erlebach, Thomas - Department of Computer Science, University of Leicester
Call Control in Rings # Udo Adamy 1 , Christoph Ambuehl 1 , R. Sai Anand 2,## , and Thomas Erlebach 2
Maximizing the Number of Connections in Optical Tree Networks
Polynomial-Time Approximation Schemes for Geometric Graphs Thomas Erlebach Klaus Jansen y Eike Seidel y
SCHEDULING OF VIRTUAL CONNECTIONS IN FAST THOMAS ERLEBACH
Call Scheduling in Trees, Rings and Meshes \Lambda T. Erlebach K. Jansen
Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs
NPHardness of Broadcast Scheduling and Inapproximability of SingleSource Unsplittable MinCost Flow
Conversion of Coloring Algorithms into Maximum Weight Independent Set
OffLine and OnLine CallScheduling in Stars and Trees ?
Call Admission Control for Advance Reservation Requests with Alternatives
Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow
Network Discovery and Verification with Distance Queries
O#line Admission Control for Advance Reservations in Star Networks
Constrained Bipartite Edge Coloring with Applications to Wavelength Routing ?
Simple Algorithms for a Weighted Interval Selection Thomas Erlebach 1 and Frits C.R. Spieksma 2
Variable sized online interval coloring with bandwidth Leah Epstein
SUBMISSION TO IEEE/ACM TRANSACTIONS ON NETWORKING 1 Computing the Types of the Relationships between
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Lehrstuhl fur Effiziente Algorithmen der Technischen Universitat Munchen
