The following pages link to Erlebach, Thomas (Q163073):
Displaying 50 items.
- (Q197693) (redirect page) (← links)
- (Q496017) (redirect page) (← links)
- Computational complexity of traffic hijacking under BGP and S-BGP (Q496018) (← links)
- Wavelength conversion in all-optical networks with shortest-path routing (Q818828) (← links)
- Algorithms that access the input via queries (Q831777) (← links)
- Call control in rings (Q878435) (← links)
- An algorithmic view on OVSF code assignment (Q878438) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Routing to reduce the cost of wavelength conversion (Q1005233) (← links)
- Variable sized online interval coloring with bandwidth (Q1024785) (← links)
- Routing flow through a strongly connected graph (Q1348945) (← links)
- Algorithmic complexity of protein identification: Combinatorics of weighted strings (Q1422404) (← links)
- Computing and scheduling with explorable uncertainty (Q1670736) (← links)
- Online algorithms for non-preemptive speed scaling on power-heterogeneous processors (Q1708640) (← links)
- Conversion of coloring algorithms into maximum weight independent set algorithms (Q1775063) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Call control with \(k\) rejections (Q1877703) (← links)
- Trimming of graphs, with application to point labeling (Q1959389) (← links)
- Optimal wavelength routing on directed fiber trees (Q1960521) (← links)
- ``Green'' barrier coverage with mobile sensors (Q1998844) (← links)
- On the fast delivery problem with one or two packages (Q2208259) (← links)
- An adversarial model for scheduling with testing (Q2211361) (← links)
- An efficient algorithm for the fast delivery problem (Q2291419) (← links)
- NP-hardness of broadcast scheduling and inapproximability of single-source unsplittable min-cost flow (Q2464420) (← links)
- An improved randomized on-line algorithm for a weighted interval selection problem (Q2464426) (← links)
- Path problems in generalized stars, complete graphs, and brick wall graphs (Q2489960) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- The Maximum Edge-Disjoint Paths Problem in Bidirected Trees (Q2753529) (← links)
- (Q2768362) (← links)
- Minimum Activation Cost Edge-Disjoint Paths in Graphs with Bounded Tree-Width (Q2798213) (← links)
- Minimum Activation Cost Node-Disjoint Paths in Graphs with Bounded Treewidth (Q2938095) (← links)
- (Q3044357) (← links)
- (Q3045823) (← links)
- Call Control with k Rejections (Q3046505) (← links)
- Connectivity Measures for Internet Topologies on the Level of Autonomous Systems (Q3100404) (← links)
- Approximating Multiobjective Knapsack Problems (Q3114821) (← links)
- Computational Complexity of Traffic Hijacking under BGP and S-BGP (Q3167036) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- Broadcast scheduling (Q3189032) (← links)
- A Game of Cops and Robbers on Graphs with Periodic Edge-Connectivity (Q3297755) (← links)
- Further Results on Capacitated Network Design Games (Q3449582) (← links)
- Discovery of Network Properties with All-Shortest-Paths Queries (Q3511392) (← links)
- A (4 + ε)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs (Q3558921) (← links)
- (Q3579403) (← links)
- (Q3579437) (← links)
- PTAS for Weighted Set Cover on Unit Squares (Q3588405) (← links)
- Constant-Factor Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs (Q3595415) (← links)
- Approximate Discovery of Random Graphs (Q3608500) (← links)
- Length-Bounded Cuts and Flows (Q3613800) (← links)
- (Q4373682) (← links)
