Some recent talks (2014)

  • London School of Economics, Management science seminar
  • Dagstuhl Seminar: Analysis of algorithms beyond the worst case
  • Workshop on Graph Searching, Theory and Applications (GRASTA)
  • Journées Franciliennes de Recherche Opérationnelle
  • Spyros Angelopoulos

    Surveys

  • Deterministic searching on the line [paper]
    Encyclopedia of Algorithms, 2015

  • Journal publications

  • Optimal scheduling of contract algorithms for anytime problem solving [paper]
    Journal of Artificial Intelligence Research, 2014

  • Multi-target ray searching problems [paper]
    Spyros Angelopoulos, Alejandro Lopez-Ortiz and Konstantinos Panagiotou
    Theoretical Computer Science, 2014

  • Bijective analysis of paging and list update problems [paper]
    Spyros Angelopoulos and Pascal Schweitzer.
    Journal of the ACM, 2013

  • Randomized priority algorithms [pdf]
    Spyros Angelopoulos and Allan Borodin.
    Theoretical Computer Science, 2010

  • Tight Bounds for quasi-random rumor spreading [pdf]
    Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou
    Electronic Journal of Combinatorics, 2009

  • The power of priority algorithms for facility location and set cover [pdf]
    Spyros Angelopoulos and Allan Borodin.
    Algorithmica, 2004 (invited paper)

  • Conference publications

  • Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems
    Spyros Angelopoulos, Giorgio Lucarelli and Kim Thang Nguyen
    In Proc. of the 23rd European Symposium on Algorithms (ESA), 2015

  • Connections between contract-scheduling and ray-searching problems [full paper]
    Spyros Angelopoulos
    In Proc. of the 24th International Joint Conference on Artificial Intelligence (IJCAI), 2015

  • Online bin packing with advice of constant size
    Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault and Adi Rosén
    In Proc. of the 14th Symposium on Algorithms and Data Structures (WADS), 2015

  • Multi-target ray-searching problems [pdf]
    Spyros Angelopoulos, Alejandro Lopez-Ortiz and Konstantinos Panagiotou
    In Proc. of the 12th Symposium on Algorithms and Data Structures (WADS), 2011

  • On the competitiveness of the online asymmetric and Euclidean Steiner tree problems [pdf]
    Spyros Angelopoulos
    In Proc. of the 7th Workshop on Approximation and Online Algorithms (WAOA), 2009

  • Online priority Steiner tree problems [pdf]
    Spyros Angelopoulos
    In Proc. of the 11th Symposium on Algorithms and Data Structures (WADS), 2009

  • Interruptible algorithms for multi-problem solving [pdf]
    Spyros Angelopoulos and Alejandro Lopez-Ortiz
    In Proc. of the 21st International Joint Conference In Artificial Intelligence (IJCAI), 2009

  • Paging and list update under bijective analysis [pdf]
    Spyros Angelopoulos and Pascal Schweitzer
    In Proc. of the 20th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2009

  • A near-tight bound for the online Steiner tree problem in graphs of bounded asymmetry [pdf]
    Spyros Angelopoulos
    In Proc. of the 16th European Symposium on Algorithms (ESA), 2008

  • Optimal scheduling of contract algorithms with soft deadlines [pdf]
    Spyros Angelopoulos and Alejandro López-Ortiz.
    In Proc. of the 23rd National Conference on Artificial Intelligence (AAAI), 2008

  • List update with locality of reference [pdf]
    Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz.
    In Proc. of the 8th Latin-American Theoretical Informatics Symposium (LATIN), 2008

  • Improved bounds for the online Steiner tree problem in graphs of bounded edge asymmetry [pdf]
    Spyros Angelopoulos
    In Proc. of the 18th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2007

  • On the separation and equivalence of paging strategies [pdf]
    Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz.
    In Proc. of the 18th ACM/SIAM Symposium on Discrete Algorithms (SODA), 2007

  • Optimal scheduling of contract algorithms for anytime problems [pdf]
    In Proc. of the 21st National Conference on Artificial Intelligence (AAAI), 2006

  • The node-weighted Steiner problem in graphs of restricted node weights [pdf]
    Spyros Angelopoulos.
    In Proc. of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), 2006

  • Online algorithms for market equilibria [pdf]
    Spyros Angelopoulos, Atish DasSarma, Avner Magen, and Anastasios Viglas.
    In Proc. of the 11th Annual International Conference on Computing and Combinatorics (COCOON), 2005

  • Order-preserving transformations and greedy-like algorithms [pdf]
    Spyros Angelopoulos.
    In Proc. of the 2nd International Workshop on Approximation and Online Algorithms (WAOA), 2004"

  • Randomized priority algorithms [pdf]
    Spyros Angelopoulos
    Proc. of the 1st International Workshop on Approximation and Online Algorithms (WAOA), 2003"

  • The power of priority algorithms For facility location and set cover [pdf]
    Spyros Angelopoulos and Allan Borodin.
    Proc. of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), 2002