380 results on '"Thomas Erlebach"'
Search Results
2. Parameterized Algorithms for Multi-Label Periodic Temporal Graph Realization.
3. Competitive Query Minimization for Stable Matching with One-Sided Uncertainty.
4. Scheduling with Obligatory Tests.
5. A faster algorithm for the construction of optimal factoring automata.
6. Sorting and Hypergraph Orientation under Uncertainty with Predictions.
7. List 3-Coloring on Comb-Convex and Caterpillar-Convex Bipartite Graphs.
8. Exploration and Rendezvous in Temporal Graphs (Invited Talk).
9. Parameterised temporal exploration problems.
10. Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries.
11. A cop and robber game on edge-periodic temporal graphs.
12. Parameterized Temporal Exploration Problems.
13. Learning-Augmented Query Policies for Minimum Spanning Tree with Uncertainty.
14. Package Delivery Using Drones with Restricted Movement Areas.
15. Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous.
16. Car-sharing between two locations: Online scheduling with flexible advance bookings.
17. Exploration of k-edge-deficient temporal graphs.
18. Round-Competitive Algorithms for Uncertainty Problems with Parallel Queries.
19. Orienting (Hyper)graphs Under Explorable Stochastic Uncertainty.
20. Algorithms that Access the Input via Queries.
21. Exploration of k-Edge-Deficient Temporal Graphs.
22. Non-strict Temporal Exploration.
23. A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity.
24. On the fast delivery problem with one or two packages.
25. On temporal graph exploration.
26. 'Green' barrier coverage with mobile sensors.
27. Two Moves per Time Step Make a Difference.
28. Car-Sharing on a Star Network: On-Line Scheduling with k Servers.
29. An Efficient Algorithm for the Fast Delivery Problem.
30. An Adversarial Model for Scheduling with Testing.
31. Computing and Scheduling with Explorable Uncertainty.
32. Scheduling with Explorable Uncertainty.
33. Partitioning Vectors into Quadruples: Worst-Case Analysis of a Matching-Based Algorithm.
34. Online Scheduling of Car-Sharing Requests Between Two Locations with Many Cars and Flexible Advance Bookings.
35. Car-Sharing Between Two Locations: Online Scheduling with Flexible Advance Bookings.
36. Faster Exploration of Degree-Bounded Temporal Graphs.
37. Car-Sharing between Two Locations: Online Scheduling with Two Servers.
38. Complexity and online algorithms for minimum skyline coloring of intervals.
39. Throughput Improvement by Reducing Dropped Packets at Interface Queue (IFQ) in Multi-channel Wireless Mesh Networks.
40. Complexity and Online Algorithms for Minimum Skyline Coloring of Intervals.
41. Online Algorithms for Non-preemptive Speed Scaling on Power-Heterogeneous Processors.
42. A Bi-objective Scheduling Approach for Energy Optimisation of Executing and Transmitting HPC Applications in Decentralised Multi-cloud Systems.
43. Untrusted Predictions Improve Trustable Query Policies.
44. Energy Aware Scheduling of HPC Tasks in Decentralised Cloud Systems.
45. Algorithms for Queryable Uncertainty.
46. The extra-bit technique for reducing idle listening in data collection.
47. Special Issue on Approximation and Online Algorithms.
48. A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity.
49. On Temporal Graph Exploration.
50. Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.