Search

Your search keyword '"Erlebach, Thomas"' showing total 334 results

Search Constraints

Start Over You searched for: Author "Erlebach, Thomas" Remove constraint Author: "Erlebach, Thomas" Publisher springer berlin heidelberg Remove constraint Publisher: springer berlin heidelberg
334 results on '"Erlebach, Thomas"'

Search Results

2. Further Results on Capacitated Network Design Games

3. On Temporal Graph Exploration

4. Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty

5. Fundamentals

6. Introduction

7. Least Channel Variation Multi-channel MAC (LCV-MMAC)

8. Approximating Maximum Disjoint Coverage in Wireless Sensor Networks

9. Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost

10. Computational Complexity of Traffic Hijacking under BGP and S-BGP

11. Majority - Who Gets Elected Class Rep?

13. Scheduling Multicast Transmissions under SINR Constraints

14. PTAS for Weighted Set Cover on Unit Squares

15. A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs

17. Discovery of Network Properties with All-Shortest-Paths Queries

18. Domination in Geometric Intersection Graphs

19. Online Capacitated Interval Coloring

20. Approximate Discovery of Random Graphs

21. Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs

22. Robustness of the Internet at the Topology and Routing Level

23. Length-Bounded Cuts and Flows

24. Variable Sized Online Interval Coloring with Bandwidth

25. Network Discovery and Verification with Distance Queries

26. Independence and Coloring Problems on Intersection Graphs of Disks

27. Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

28. Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing

29. Off-line Admission Control for Advance Reservations in Star Networks

30. Joint Base Station Scheduling

31. Network Discovery and Verification

32. An Algorithmic View on OVSF Code Assignment

42. Call Control with k Rejections

43. Call Control in Rings

44. On the Complexity of Train Assignment Problems

Catalog

Books, media, physical & digital resources