The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Spyros Angelopoulos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel
    Optimal Scheduling of Contract Algorithms for Anytime Problems. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  2. Spyros Angelopoulos, Allan Borodin
    On the Power of Priority Algorithms for Facility Location and Set Cover. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:26-39 [Conf]
  3. Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas
    On-Line Algorithms for Market Equilibria. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:596-607 [Conf]
  4. Spyros Angelopoulos
    The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights. [Citation Graph (0, 0)][DBLP]
    SWAT, 2006, pp:208-219 [Conf]
  5. Spyros Angelopoulos
    Randomized Priority Algorithms: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WAOA, 2003, pp:27-40 [Conf]
  6. Spyros Angelopoulos
    Order-Preserving Transformations and Greedy-Like Algorithms. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:197-210 [Conf]
  7. Spyros Angelopoulos, Allan Borodin
    The Power of Priority Algorithms for Facility Location and Set Cover. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:4, pp:271-291 [Journal]
  8. Spyros Angelopoulos
    Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:248-257 [Conf]
  9. Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz
    On the separation and equivalence of paging strategies. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:229-237 [Conf]

  10. Optimal Scheduling of Contract Algorithms with Soft Deadlines. [Citation Graph (, )][DBLP]


  11. Emerging Barriers in E-Government Implementation. [Citation Graph (, )][DBLP]


  12. A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. [Citation Graph (, )][DBLP]


  13. Interruptible Algorithms for Multi-Problem Solving. [Citation Graph (, )][DBLP]


  14. List Update with Locality of Reference. [Citation Graph (, )][DBLP]


  15. Paging and list update under bijective analysis. [Citation Graph (, )][DBLP]


  16. Online Priority Steiner Tree Problems. [Citation Graph (, )][DBLP]


  17. On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002