Randomized Priority Algorithms: (Extended Abstract). - Spyros Angelopoulos 001 (WAOA, 2003)

Order-Preserving Transformations and Greedy-Like Algorithms. - Spyros Angelopoulos 001 (WAOA, 2004)

The Power of Priority Algorithms for Facility Location and Set Cover. - Spyros Angelopoulos 001; Allan Borodin (Algorithmica, 2004)

On-Line Algorithms for Market Equilibria. - Spyros Angelopoulos 001; Atish Das Sarma; Avner Magen; Anastasios Viglas (COCOON, 2005)

Optimal Scheduling of Contract Algorithms for Anytime Problems. - Alejandro López-Ortiz; Spyros Angelopoulos 001; Angèle M. Hamel (AAAI, 2006)

The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights. - Spyros Angelopoulos 001 (SWAT, 2006)

Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. - Spyros Angelopoulos 001 (SODA, 2007)

On the separation and equivalence of paging strategies. - Spyros Angelopoulos 001; Reza Dorrigiv; Alejandro López-Ortiz (SODA, 2007)

A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. - Spyros Angelopoulos 001 (ESA, 2008)

List Update with Locality of Reference. - Spyros Angelopoulos 001; Reza Dorrigiv; Alejandro López-Ortiz (LATIN, 2008)

Parameterized Analysis of Online Steiner Tree Problems. - Spyros Angelopoulos 001 (Adaptive, Output Sensitive, Online and Parameterized Algorithms, 2009)

Interruptible Algorithms for Multi-Problem Solving. - Spyros Angelopoulos 001; Alejandro López-Ortiz (IJCAI, 2009)

Online Priority Steiner Tree Problems. - Spyros Angelopoulos 001 (WADS, 2009)

On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. - Spyros Angelopoulos 001 (WAOA, 2009)

Tight Bounds for Quasirandom Rumor Spreading. - Spyros Angelopoulos 001; Benjamin Doerr; Anna Huber; Konstantinos Panagiotou (Electron. J. Comb., 2009)

Randomized priority algorithms. - Spyros Angelopoulos 001; Allan Borodin (Theor. Comput. Sci., 2010)

Paging and list update under bijective analysis. - Spyros Angelopoulos 001; Pascal Schweitzer (J. ACM, 2013)

Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving. - Alejandro López-Ortiz; Spyros Angelopoulos 001; Angèle M. Hamel (J. Artif. Intell. Res., 2014)

Multi-target ray searching problems. - Spyros Angelopoulos 001; Alejandro López-Ortiz; Konstantinos Panagiotou (Theor. Comput. Sci., 2014)

Deterministic Searching on the Line. - Spyros Angelopoulos 001 (Encyclopedia of Algorithms, 2016)

Optimal strategies for weighted ray search. - Spyros Angelopoulos 001; Konstantinos Panagiotou (CoRR, 2017)

Multi-processor Search and Scheduling Problems with Setup Cost. - Spyros Angelopoulos 001; Diogo Arsénio; Christoph Dürr; Alejandro López-Ortiz (Theory Comput. Syst., 2017)

Optimal scheduling of contract algorithms with soft deadlines. - Spyros Angelopoulos 001; Alejandro López-Ortiz; Angèle M. Hamel (J. Sched., 2017)

Infinite linear programming and online searching with turn cost. - Spyros Angelopoulos 001; Diogo Arsénio; Christoph Dürr (Theor. Comput. Sci., 2017)

Online Bin Packing with Advice of Small Size. - Spyros Angelopoulos 001; Christoph Dürr; Shahin Kamali; Marc P. Renault; Adi Rosén (Theory Comput. Syst., 2018)

Earliest-Completion Scheduling of Contract Algorithms with End Guarantees. - Spyros Angelopoulos 001; Shendan Jin (IJCAI, 2019)

Best-Of-Two-Worlds Analysis of Online Search. - Spyros Angelopoulos 001; Christoph Dürr; Shendan Jin (STACS, 2019)

On the Separation and Equivalence of Paging Strategies and Other Online Algorithms. - Spyros Angelopoulos 001; Reza Dorrigiv; Alejandro López-Ortiz (Algorithmica, 2019)

Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems. - Spyros Angelopoulos 001; Giorgio Lucarelli; Kim Thang Nguyen (Algorithmica, 2019)

The expanding search ratio of a graph. - Spyros Angelopoulos 001; Christoph Dürr; Thomas Lidbetter (Discret. Appl. Math., 2019)

Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems. - Spyros Angelopoulos 001 (Theory Comput. Syst., 2019)

Preface to special issue on Theory and Applications of Graph Searching. - Spyros Angelopoulos 001; Nicolas Nisse; Dimitrios M. Thilikos (Theor. Comput. Sci., 2019)

Computation under Uncertainty: From Online Algorithms to Search Games and Interruptible Systems. - Spyros Angelopoulos 001 (2020)

Stochastic Dominance and the Bijective Ratio of Online Algorithms. - Spyros Angelopoulos 001; Marc P. Renault; Pascal Schweitzer (Algorithmica, 2020)

Competitive search in a network. - Spyros Angelopoulos 001; Thomas Lidbetter (Eur. J. Oper. Res., 2020)

Online maximum matching with recourse. - Spyros Angelopoulos 001; Christoph Dürr; Shendan Jin (J. Comb. Optim., 2020)

Interruptible algorithms for multiproblem solving. - Spyros Angelopoulos 001; Alejandro López-Ortiz (J. Sched., 2020)

Online Search with Maximum Clearance. - Spyros Angelopoulos 001; Malachi Voss (AAAI, 2021)

Competitive Sequencing with Noisy Advice. - Spyros Angelopoulos 001; Diogo Arsénio; Shahin Kamali (CoRR, 2021)

Preface to the special issue on Graph Searching: Theory and Applications. - Spyros Angelopoulos 001; Nancy E. Clarke; Fedor V. Fomin; Archontia C. Giannopoulou; Roman Rabinovich 001 (Theor. Comput. Sci., 2021)

Online Search with Best-Price and Query-Based Predictions. - Spyros Angelopoulos 001; Shahin Kamali; Dehou Zhang (AAAI, 2022)

Further connections between contract-scheduling and ray-searching problems. - Spyros Angelopoulos 001 (J. Sched., 2022)

Competitive Search in the Line and the Star with Predictions. - Spyros Angelopoulos 001 (MFCS, 2023)

Rényi-Ulam Games and Online Computation with Imperfect Advice. - Spyros Angelopoulos 001; Shahin Kamali (MFCS, 2023)

Contract Scheduling with Predictions. - Spyros Angelopoulos 001; Shahin Kamali (J. Artif. Intell. Res., 2023)

Online Bin Packing with Predictions. - Spyros Angelopoulos 001; Shahin Kamali; Kimia Shadkami (J. Artif. Intell. Res., 2023)

Best-of-Both-Worlds Analysis of Online Search. - Spyros Angelopoulos 001; Christoph Dürr; Shendan Jin (Algorithmica, 2023)

Online search with a hint. - Spyros Angelopoulos 001 (Inf. Comput., 2023)

Weighted online search. - Spyros Angelopoulos 001; Konstantinos Panagiotou (J. Comput. Syst. Sci., 2023)

Contract Scheduling with Distributional and Multiple Advice. - Spyros Angelopoulos 001; Marcin Bienkowski; Christoph Dürr; Bertrand Simon 001 (IJCAI, 2024)

Overcoming Brittleness in Pareto-Optimal Learning Augmented Algorithms. - Alex Elenter; Spyros Angelopoulos 001; Christoph Dürr; Yanni Lefki (NeurIPS, 2024)

Search Games with Predictions. - Spyros Angelopoulos 001; Thomas Lidbetter; Konstantinos Panagiotou (CoRR, 2024)

Online computation with untrusted advice. - Spyros Angelopoulos 001; Christoph Dürr; Shendan Jin; Shahin Kamali; Marc P. Renault (J. Comput. Syst. Sci., 2024)

Preface to special issue on theory and applications of Graph Searching. - Spyros Angelopoulos 001; Pierre Fraigniaud; Nicolas Nisse; Dimitrios M. Thilikos (Theor. Comput. Sci., 2024)

Scenario-Based Robust Optimization of Tree Structures. - Spyros Angelopoulos 001; Christoph Dürr; Alex Elenter; Georgii Melidi (AAAI, 2025)

Cache Management for Mixture-of-Experts LLMs. - Spyros Angelopoulos 001; Loris Marchal; Adrien Obrecht; Bertrand Simon 001 (Euro-Par (3), 2025)

Decision-Theoretic Approaches in Learning-Augmented Algorithms. - Spyros Angelopoulos 001; Christoph Dürr; Georgii Melidi (CoRR, 2025)

Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search. - Ziyad Benomar; Lorenzo Croissant; Vianney Perchet; Spyros Angelopoulos 001 (CoRR, 2025)