Spyros Angelopoulos

Orcid: 0000-0001-9819-9158

Affiliations:
  • CNRS, Paris, France


According to our database1, Spyros Angelopoulos authored at least 55 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Preface to special issue on theory and applications of Graph Searching.
Theor. Comput. Sci., 2024

Online computation with untrusted advice.
J. Comput. Syst. Sci., 2024

Scenario-Based Robust Optimization of Tree Structures.
CoRR, 2024

Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms.
CoRR, 2024

Search Games with Predictions.
CoRR, 2024

Contract Scheduling with Distributional and Multiple Advice.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

2023
Weighted online search.
J. Comput. Syst. Sci., December, 2023

Online search with a hint.
Inf. Comput., December, 2023

Best-of-Both-Worlds Analysis of Online Search.
Algorithmica, December, 2023

Online Bin Packing with Predictions.
J. Artif. Intell. Res., 2023

Contract Scheduling with Predictions.
J. Artif. Intell. Res., 2023

Rényi-Ulam Games and Online Computation with Imperfect Advice.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Competitive Search in the Line and the Star with Predictions.
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022
Further connections between contract-scheduling and ray-searching problems.
J. Sched., 2022

Online Search with Best-Price and Query-Based Predictions.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Preface to the special issue on Graph Searching: Theory and Applications.
Theor. Comput. Sci., 2021

Competitive Sequencing with Noisy Advice.
CoRR, 2021

Online Search with Maximum Clearance.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Interruptible algorithms for multiproblem solving.
J. Sched., 2020

Online maximum matching with recourse.
J. Comb. Optim., 2020

Competitive search in a network.
Eur. J. Oper. Res., 2020

Stochastic Dominance and the Bijective Ratio of Online Algorithms.
Algorithmica, 2020

Computation under Uncertainty: From Online Algorithms to Search Games and Interruptible Systems.
, 2020

2019
Preface to special issue on Theory and Applications of Graph Searching.
Theor. Comput. Sci., 2019

Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems.
Theory Comput. Syst., 2019

The expanding search ratio of a graph.
Discret. Appl. Math., 2019

Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems.
Algorithmica, 2019

On the Separation and Equivalence of Paging Strategies and Other Online Algorithms.
Algorithmica, 2019

Best-Of-Two-Worlds Analysis of Online Search.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Earliest-Completion Scheduling of Contract Algorithms with End Guarantees.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018
Online Bin Packing with Advice of Small Size.
Theory Comput. Syst., 2018

2017
Infinite linear programming and online searching with turn cost.
Theor. Comput. Sci., 2017

Optimal scheduling of contract algorithms with soft deadlines.
J. Sched., 2017

Multi-processor Search and Scheduling Problems with Setup Cost.
Theory Comput. Syst., 2017

Optimal strategies for weighted ray search.
CoRR, 2017

2016
Deterministic Searching on the Line.
Encyclopedia of Algorithms, 2016

2014
Multi-target ray searching problems.
Theor. Comput. Sci., 2014

Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving.
J. Artif. Intell. Res., 2014

2013
Paging and list update under bijective analysis.
J. ACM, 2013

2010
Randomized priority algorithms.
Theor. Comput. Sci., 2010

2009
Tight Bounds for Quasirandom Rumor Spreading.
Electron. J. Comb., 2009

On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems.
Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Online Priority Steiner Tree Problems.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Interruptible Algorithms for Multi-Problem Solving.
Proceedings of the IJCAI 2009, 2009

Parameterized Analysis of Online Steiner Tree Problems.
Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

2008
List Update with Locality of Reference.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry.
Proceedings of the Algorithms, 2008

2007
On the separation and equivalence of paging strategies.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.
Proceedings of the Algorithm Theory, 2006

Optimal Scheduling of Contract Algorithms for Anytime Problems.
Proceedings of the Proceedings, 2006

2005
On-Line Algorithms for Market Equilibria.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
The Power of Priority Algorithms for Facility Location and Set Cover.
Algorithmica, 2004

Order-Preserving Transformations and Greedy-Like Algorithms.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003
Randomized Priority Algorithms: (Extended Abstract).
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003


  Loading...