Spyros Angelopoulos

93 papers A* 16A 6B 10Misc 1Journal 54Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
Cache Management for Mixture-of-Experts LLMs - extended version.
CoRR
Spyros Angelopoulos, Loris Marchal, Adrien Obrecht, Bertrand Simon
2025 — conf
Cache Management for Mixture-of-Experts LLMs.
Euro-Par (3)
Spyros Angelopoulos, Loris Marchal, Adrien Obrecht, Bertrand Simon
2025 J jnl
Decision-Theoretic Approaches in Learning-Augmented Algorithms.
CoRR
Spyros Angelopoulos, Christoph Dürr, Georgii Melidi
2025 J jnl
Learning-Augmented Online Bidding in Stochastic Settings.
CoRR
Spyros Angelopoulos, Bertrand Simon
2025 A* conf
Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search.
ICML
Ziyad Benomar, Lorenzo Croissant, Vianney Perchet, Spyros Angelopoulos
2025 J jnl
Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search.
CoRR
Ziyad Benomar, Lorenzo Croissant, Vianney Perchet, Spyros Angelopoulos
2025 A* conf
Scenario-Based Robust Optimization of Tree Structures.
AAAI
Spyros Angelopoulos, Christoph Dürr, Alex Elenter, Georgii Melidi
2024 A* conf
Contract Scheduling with Distributional and Multiple Advice.
IJCAI
Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr, Bertrand Simon
2024 J jnl
Contract Scheduling with Distributional and Multiple Advice.
CoRR
Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr, Bertrand Simon
2024 J jnl
Online computation with untrusted advice.
J. Comput. Syst. Sci.
Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault
2024 A* conf
Overcoming Brittleness in Pareto-Optimal Learning Augmented Algorithms.
NeurIPS
Alex Elenter, Spyros Angelopoulos, Christoph Dürr, Yanni Lefki
2024 J jnl
Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms.
CoRR
Spyros Angelopoulos, Christoph Dürr, Alex Elenter, Yanni Lefki
2024 J jnl
Preface to special issue on theory and applications of Graph Searching.
Theor. Comput. Sci.
Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos
2024 J jnl
Scenario-Based Robust Optimization of Tree Structures.
CoRR
Spyros Angelopoulos, Christoph Dürr, Alex Elenter, Georgii Melidi
2024 J jnl
Search Games with Predictions.
CoRR
Spyros Angelopoulos, Thomas Lidbetter, Konstantinos Panagiotou
2023 J jnl
Best-of-Both-Worlds Analysis of Online Search.
Algorithmica
Spyros Angelopoulos, Christoph Dürr, Shendan Jin
2023 B conf
Competitive Search in the Line and the Star with Predictions.
MFCS
Spyros Angelopoulos
2023 J jnl
Competitive Search in the Line and the Star with Predictions.
CoRR
Spyros Angelopoulos
2023 J jnl
Contract Scheduling with Predictions.
J. Artif. Intell. Res.
Spyros Angelopoulos, Shahin Kamali
2023 J jnl
Online Bin Packing with Predictions.
J. Artif. Intell. Res.
Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami
2023 J jnl
Online search with a hint.
Inf. Comput.
Spyros Angelopoulos
2023 B conf
Rényi-Ulam Games and Online Computation with Imperfect Advice.
MFCS
Spyros Angelopoulos, Shahin Kamali
2023 J jnl
Rényi-Ulam Games and Online Computation with Imperfect Advice.
CoRR
Spyros Angelopoulos, Shahin Kamali
2023 J jnl
Weighted online search.
J. Comput. Syst. Sci.
Spyros Angelopoulos, Konstantinos Panagiotou
2022 J jnl
Further connections between contract-scheduling and ray-searching problems.
J. Sched.
Spyros Angelopoulos
2022 A* conf
Online Bin Packing with Predictions.
IJCAI
Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami
2022 A* conf
Online Search with Best-Price and Query-Based Predictions.
AAAI
Spyros Angelopoulos, Shahin Kamali, Dehou Zhang
2021 J jnl
Competitive Sequencing with Noisy Advice.
CoRR
Spyros Angelopoulos, Diogo Arsénio, Shahin Kamali
2021 A* conf
Contract Scheduling With Predictions.
AAAI
Spyros Angelopoulos, Shahin Kamali
2021 J jnl
Online Bin Packing with Predictions.
CoRR
Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami
2021 J jnl
Online Search With Best-Price and Query-Based Predictions.
CoRR
Spyros Angelopoulos, Shahin Kamali, Dehou Zhang
2021 A* conf
Online Search with Maximum Clearance.
AAAI
Spyros Angelopoulos, Malachi Voss
2021 A conf
Online Search with a Hint.
ITCS
Spyros Angelopoulos
2021 J jnl
Preface to the special issue on Graph Searching: Theory and Applications.
Theor. Comput. Sci.
Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich
2020 J jnl
Competitive search in a network.
Eur. J. Oper. Res.
Spyros Angelopoulos, Thomas Lidbetter
2020 — book
Computation under Uncertainty: From Online Algorithms to Search Games and Interruptible Systems.
Spyros Angelopoulos
2020 J jnl
Contract Scheduling With Predictions.
CoRR
Spyros Angelopoulos, Shahin Kamali
2020 J jnl
Interruptible algorithms for multiproblem solving.
J. Sched.
Spyros Angelopoulos, Alejandro López-Ortiz
2020 A conf
Online Computation with Untrusted Advice.
ITCS
Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault
2020 J jnl
Online Search With a Hint.
CoRR
Spyros Angelopoulos
2020 J jnl
Online Search with Maximum Clearance.
CoRR
Spyros Angelopoulos, Malachi Voss
2020 J jnl
Online maximum matching with recourse.
J. Comb. Optim.
Spyros Angelopoulos, Christoph Dürr, Shendan Jin
2020 J jnl
Stochastic Dominance and the Bijective Ratio of Online Algorithms.
Algorithmica
Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer
2019 A conf
Best-Of-Two-Worlds Analysis of Online Search.
STACS
Spyros Angelopoulos, Christoph Dürr, Shendan Jin
2019 J jnl
Competitive Search in a Network.
CoRR
Spyros Angelopoulos, Thomas Lidbetter
2019 A* conf
Earliest-Completion Scheduling of Contract Algorithms with End Guarantees.
IJCAI
Spyros Angelopoulos, Shendan Jin
2019 J jnl
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms.
Algorithmica
Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz
2019 J jnl
Online Computation with Untrusted Advice.
CoRR
Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault
2019 J jnl
Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems.
Theory Comput. Syst.
Spyros Angelopoulos
2019 J jnl
Preface to special issue on Theory and Applications of Graph Searching.
Theor. Comput. Sci.
Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos
2019 J jnl
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems.
Algorithmica
Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen
2019 J jnl
The expanding search ratio of a graph.
Discret. Appl. Math.
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
2018 J jnl
Best-of-two-worlds analysis of online search.
CoRR
Spyros Angelopoulos, Christoph Dürr, Shendan Jin
2018 J jnl
Interruptible Algorithms for Multiproblem Solving.
CoRR
Spyros Angelopoulos, Alejandro López-Ortiz
2018 J jnl
Online Bin Packing with Advice of Small Size.
Theory Comput. Syst.
Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén
2018 B conf
Online Maximum Matching with Recourse.
MFCS
Spyros Angelopoulos, Christoph Dürr, Shendan Jin
2018 J jnl
Online Maximum Matching with Recourse.
CoRR
Spyros Angelopoulos, Christoph Dürr, Shendan Jin
2017 J jnl
Infinite linear programming and online searching with turn cost.
Theor. Comput. Sci.
Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr
2017 J jnl
Multi-processor Search and Scheduling Problems with Setup Cost.
Theory Comput. Syst.
Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz
2017 J jnl
Optimal scheduling of contract algorithms with soft deadlines.
J. Sched.
Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel
2017 J jnl
Optimal strategies for weighted ray search.
CoRR
Spyros Angelopoulos, Konstantinos Panagiotou
2016 — ch.
Deterministic Searching on the Line.
Encyclopedia of Algorithms
Spyros Angelopoulos
2016 J jnl
Stochastic dominance and the bijective ratio of online algorithms.
CoRR
Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer
2016 A conf
The Expanding Search Ratio of a Graph.
STACS
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
2016 J jnl
The expanding search ratio of a graph.
CoRR
Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter
2015 A* conf
Further Connections Between Contract-Scheduling and Ray-Searching Problems.
IJCAI
Spyros Angelopoulos
2015 J jnl
Further Connections Between Contract-Scheduling and Ray-Searching Problems.
CoRR
Spyros Angelopoulos
2015 B conf
Online Bin Packing with Advice of Small Size.
WADS
Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén
2015 A conf
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems.
ESA
Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen
2015 J jnl
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems.
CoRR
Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen
2014 J jnl
Multi-target ray searching problems.
Theor. Comput. Sci.
Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou
2014 J jnl
Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving.
J. Artif. Intell. Res.
Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel
2013 J jnl
Paging and list update under bijective analysis.
J. ACM
Spyros Angelopoulos, Pascal Schweitzer
2011 B conf
Multi-target Ray Searching Problems.
WADS
Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou
2010 J jnl
Randomized priority algorithms.
Theor. Comput. Sci.
Spyros Angelopoulos, Allan Borodin
2009 A* conf
Interruptible Algorithms for Multi-Problem Solving.
IJCAI
Spyros Angelopoulos, Alejandro López-Ortiz
2009 B conf
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems.
WAOA
Spyros Angelopoulos
2009 B conf
Online Priority Steiner Tree Problems.
WADS
Spyros Angelopoulos
2009 A* conf
Paging and list update under bijective analysis.
SODA
Spyros Angelopoulos, Pascal Schweitzer
2009 — conf
Parameterized Analysis of Online Steiner Tree Problems.
Adaptive, Output Sensitive, Online and Parameterized Algorithms
Spyros Angelopoulos
2009 J jnl
Tight Bounds for Quasirandom Rumor Spreading.
Electron. J. Comb.
Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou
2008 A conf
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.
ESA
Spyros Angelopoulos
2008 B conf
List Update with Locality of Reference.
LATIN
Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz
2008 A* conf
Optimal Scheduling of Contract Algorithms with Soft Deadlines.
AAAI
Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel
2007 A* conf
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry.
SODA
Spyros Angelopoulos
2007 A* conf
On the separation and equivalence of paging strategies.
SODA
Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz
2006 A* conf
Optimal Scheduling of Contract Algorithms for Anytime Problems.
AAAI
Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel
2006 — conf
The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.
SWAT
Spyros Angelopoulos
2005 Misc conf
On-Line Algorithms for Market Equilibria.
COCOON
Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas
2004 B conf
Order-Preserving Transformations and Greedy-Like Algorithms.
WAOA
Spyros Angelopoulos
2004 J jnl
The Power of Priority Algorithms for Facility Location and Set Cover.
Algorithmica
Spyros Angelopoulos, Allan Borodin
2003 B conf
Randomized Priority Algorithms: (Extended Abstract).
WAOA
Spyros Angelopoulos
2002 — conf
On the Power of Priority Algorithms for Facility Location and Set Cover.
APPROX
Spyros Angelopoulos, Allan Borodin