The following pages link to Thomas Erlebach (Q163073):
Displaying 50 items.
- (Q4373682) (← links)
- (Q4395324) (← links)
- (Q4418643) (← links)
- Interval selection: Applications, algorithms, and lower bounds (Q4419479) (← links)
- (Q4472496) (← links)
- (Q4474107) (← links)
- Constrained bipartite edge coloring with applications to wavelength routing (Q4571980) (← links)
- Algorithms for Queryable Uncertainty (Q4632163) (← links)
- (Q4673408) (← links)
- (Q4702950) (← links)
- (Q4703851) (← links)
- (Q4737208) (← links)
- (Q4778541) (← links)
- (Q4778556) (← links)
- (Q4779157) (← links)
- (Q4782743) (← links)
- Trimming of Graphs, with Application to Point Labeling (Q4910725) (← links)
- Approximation Algorithms for Disjoint st-Paths with Minimum Activation Cost (Q4924633) (← links)
- Scheduling with explorable uncertainty (Q4993294) (← links)
- Faster exploration of degree-bounded temporal graphs (Q5005137) (← links)
- Car-Sharing between Two Locations: Online Scheduling with Two Servers (Q5005152) (← links)
- Car-sharing on a star network: on-line scheduling with k servers (Q5090502) (← links)
- Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm (Q5091037) (← links)
- Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings. (Q5091058) (← links)
- (Q5092344) (← links)
- Non-strict Temporal Exploration (Q5100955) (← links)
- Algorithms and Computation (Q5191688) (← links)
- STACS 2004 (Q5309706) (← links)
- Polynomial-Time Approximation Schemes for Geometric Intersection Graphs (Q5317197) (← links)
- Cuts and Disjoint Paths in the Valley-Free Path Model (Q5384925) (← links)
- Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow (Q5450805) (← links)
- Independence and Coloring Problems on Intersection Graphs of Disks (Q5450806) (← links)
- Domination in Geometric Intersection Graphs (Q5458576) (← links)
- A memetic algorithm to schedule planned maintenance for the national grid (Q5463389) (← links)
- Implementation of approximation algorithms for weighted and unweighted edge-disjoint paths in bidirected trees (Q5463430) (← links)
- Network Analysis (Q5703970) (← links)
- Network Analysis (Q5703977) (← links)
- Approximation and Online Algorithms (Q5713438) (← links)
- Approximation and Online Algorithms (Q5713439) (← links)
- Variable Sized Online Interval Coloring with Bandwidth (Q5757892) (← links)
- Exploration of \(k\)-edge-deficient temporal graphs (Q5896891) (← links)
- Car-sharing between two locations: online scheduling with flexible advance bookings (Q5896897) (← links)
- Approximation and Online Algorithms (Q5896918) (← links)
- Approximation and Online Algorithms (Q5896927) (← links)
- Algorithms and Data Structures (Q5900753) (← links)
- Online Capacitated Interval Coloring (Q5900914) (← links)
- Online Capacitated Interval Coloring (Q5901463) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902517) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902523) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5915896) (← links)
