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?
12. Congestion and Network Density Adaptive Broadcasting in Mobile Ad Hoc Networks
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
16. Mehrheitsbestimmung – Wer wird Klassensprecher?
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
33. Online Coloring of Intervals with Bandwidth
34. Scheduling AND/OR-Networks on Identical Parallel Machines
35. Routing and Call Control Algorithms for Ring Networks
36. Resource Allocation Problems in Multifiber WDM Tree Networks
37. Greedy Edge-Disjoint Paths in Complete Graphs
38. On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
39. Wavelength Conversion in Shortest-Path All-Optical Networks
40. On the Spectrum and Structure of Internet Topology Graphs
41. On-line Algorithms for Edge-Disjoint Paths in Trees of Rings
42. Call Control with k Rejections
43. Call Control in Rings
44. On the Complexity of Train Assignment Problems
45. Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees
46. Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings
47. New Results for Path Problems in Generalized Stars, Complete Graphs, and Brick Wall Graphs
48. On the Complexity of Scheduling Conditional Real-Time Code
49. Approximating Multi-objective Knapsack Problems
50. Simple Algorithms for a Weighted Interval Selection Problem
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.