The following pages link to Spyros Angelopoulos (Q515542):
Displayed 39 items.
- Infinite linear programming and online searching with turn cost (Q515543) (← links)
- On the separation and equivalence of paging strategies and other online algorithms (Q666671) (← links)
- Online maximum matching with recourse (Q830934) (← links)
- Randomized priority algorithms (Q974749) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- The power of priority algorithms for facility location and set cover (Q1884771) (← links)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Competitive search in a network (Q2184175) (← links)
- Interruptible algorithms for multiproblem solving (Q2197326) (← links)
- Stochastic dominance and the bijective ratio of online algorithms (Q2309465) (← links)
- Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems (Q2319627) (← links)
- Online bin packing with advice of small size (Q2322702) (← links)
- Parameterized analysis of the online priority and node-weighted Steiner tree problems (Q2322716) (← links)
- Tight bounds for quasirandom rumor spreading (Q2380260) (← links)
- Multi-processor search and scheduling problems with setup cost (Q2398209) (← links)
- Optimal scheduling of contract algorithms with soft deadlines (Q2400436) (← links)
- Multi-target ray searching problems (Q2453158) (← links)
- (Q2934601) (← links)
- (Q2934603) (← links)
- Online Priority Steiner Tree Problems (Q3183439) (← links)
- Online Bin Packing with Advice of Small Size (Q3449804) (← links)
- A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry (Q3541076) (← links)
- On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems (Q3558908) (← links)
- (Q4411275) (← links)
- The expanding search ratio of a graph (Q4601858) (← links)
- (Q4633928) (← links)
- Online Maximum Matching with Recourse (Q5005104) (← links)
- (Q5090453) (← links)
- Multi-target Ray Searching Problems (Q5199229) (← links)
- Paging and list update under bijective analysis (Q5395706) (← links)
- List Update with Locality of Reference (Q5458546) (← links)
- Approximation and Online Algorithms (Q5713437) (← links)
- Computing and Combinatorics (Q5716981) (← links)
- The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights (Q5757874) (← links)
- (Q5875754) (← links)
- Approximation and Online Algorithms (Q5896920) (← links)
- Best-of-both-worlds analysis of online search (Q6066770) (← links)
- Weighted online search (Q6133641) (← links)
- Online search with a hint (Q6186319) (← links)