| 2009 |
|---|
| 13 | EE | Spyros Angelopoulos,
Pascal Schweitzer:
Paging and list update under bijective analysis.
SODA 2009: 1136-1145 |
| 2008 |
|---|
| 12 | | Spyros Angelopoulos,
Alejandro López-Ortiz,
Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms with Soft Deadlines.
AAAI 2008: 868-873 |
| 11 | EE | Spyros Angelopoulos:
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.
ESA 2008: 76-87 |
| 10 | EE | Spyros Angelopoulos,
Reza Dorrigiv,
Alejandro López-Ortiz:
List Update with Locality of Reference.
LATIN 2008: 399-410 |
| 2007 |
|---|
| 9 | EE | Spyros Angelopoulos,
Reza Dorrigiv,
Alejandro López-Ortiz:
On the separation and equivalence of paging strategies.
SODA 2007: 229-237 |
| 8 | EE | Spyros Angelopoulos:
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry.
SODA 2007: 248-257 |
| 2006 |
|---|
| 7 | | Alejandro López-Ortiz,
Spyros Angelopoulos,
Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problems.
AAAI 2006 |
| 6 | EE | Spyros Angelopoulos:
The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.
SWAT 2006: 208-219 |
| 2005 |
|---|
| 5 | EE | Spyros Angelopoulos,
Atish Das Sarma,
Avner Magen,
Anastasios Viglas:
On-Line Algorithms for Market Equilibria.
COCOON 2005: 596-607 |
| 2004 |
|---|
| 4 | EE | Spyros Angelopoulos:
Order-Preserving Transformations and Greedy-Like Algorithms.
WAOA 2004: 197-210 |
| 3 | EE | Spyros Angelopoulos,
Allan Borodin:
The Power of Priority Algorithms for Facility Location and Set Cover.
Algorithmica 40(4): 271-291 (2004) |
| 2003 |
|---|
| 2 | EE | Spyros Angelopoulos:
Randomized Priority Algorithms: (Extended Abstract).
WAOA 2003: 27-40 |
| 2002 |
|---|
| 1 | EE | Spyros Angelopoulos,
Allan Borodin:
On the Power of Priority Algorithms for Facility Location and Set Cover.
APPROX 2002: 26-39 |
