Spyros Angelopoulos

Thomas Lidbetter

CoRR, 2024

2023

Weighted online search.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., December, 2023

Online search with a hint.

[BibT_eX]

[DOI]

Inf. Comput., December, 2023

Best-of-Both-Worlds Analysis of Online Search.

[BibT_eX]

[DOI]

Algorithmica, December, 2023

Online Bin Packing with Predictions.

[BibT_eX]

[DOI]

Kimia Shadkami

J. Artif. Intell. Res., 2023

Contract Scheduling with Predictions.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2023

Rényi-Ulam Games and Online Computation with Imperfect Advice.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

Competitive Search in the Line and the Star with Predictions.

[BibT_eX]

[DOI]

Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023

2022

Further connections between contract-scheduling and ray-searching problems.

[BibT_eX]

[DOI]

J. Sched., 2022

Online Search with Best-Price and Query-Based Predictions.

[BibT_eX]

[DOI]

Dehou Zhang

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Preface to the special issue on Graph Searching: Theory and Applications.

[BibT_eX]

[DOI]

Archontia C. Giannopoulou

Nancy E. Clarke

Fedor V. Fomin

Roman Rabinovich

Theor. Comput. Sci., 2021

Competitive Sequencing with Noisy Advice.

[BibT_eX]

[DOI]

Diogo Arsénio

CoRR, 2021

Online Search with Maximum Clearance.

[BibT_eX]

[DOI]

Malachi Voss

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Interruptible algorithms for multiproblem solving.

[BibT_eX]

[DOI]

J. Sched., 2020

Online maximum matching with recourse.

[BibT_eX]

[DOI]

J. Comb. Optim., 2020

Competitive search in a network.

[BibT_eX]

[DOI]

Thomas Lidbetter

Eur. J. Oper. Res., 2020

Stochastic Dominance and the Bijective Ratio of Online Algorithms.

[BibT_eX]

[DOI]

Marc P. Renault

Pascal Schweitzer

Algorithmica, 2020

Online Computation with Untrusted Advice.

[BibT_eX]

[DOI]

Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

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

[BibT_eX]

[DOI]

, 2020

2019

Preface to special issue on Theory and Applications of Graph Searching.

[BibT_eX]

[DOI]

Nicolas Nisse

Dimitrios M. Thilikos

Theor. Comput. Sci., 2019

Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2019

The expanding search ratio of a graph.

[BibT_eX]

[DOI]

Thomas Lidbetter

Discret. Appl. Math., 2019

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

[BibT_eX]

[DOI]

Giorgio Lucarelli

Kim Thang Nguyen

Algorithmica, 2019

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

[BibT_eX]

[DOI]

Reza Dorrigiv

Algorithmica, 2019

Best-Of-Two-Worlds Analysis of Online Search.

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Earliest-Completion Scheduling of Contract Algorithms with End Guarantees.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

2018

Online Bin Packing with Advice of Small Size.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2018

2017

Infinite linear programming and online searching with turn cost.

[BibT_eX]

[DOI]

Diogo Arsénio

Theor. Comput. Sci., 2017

Optimal scheduling of contract algorithms with soft deadlines.

[BibT_eX]

[DOI]

Angèle M. Hamel

J. Sched., 2017

Multi-processor Search and Scheduling Problems with Setup Cost.

[BibT_eX]

[DOI]

Diogo Arsénio

Theory Comput. Syst., 2017

Optimal strategies for weighted ray search.

[BibT_eX]

[DOI]

CoRR, 2017

2016

Deterministic Searching on the Line.

[BibT_eX]

[DOI]

Encyclopedia of Algorithms, 2016

2014

Multi-target ray searching problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving.

[BibT_eX]

[DOI]

Angèle M. Hamel

J. Artif. Intell. Res., 2014

2013

Paging and list update under bijective analysis.

[BibT_eX]

[DOI]

Pascal Schweitzer

J. ACM, 2013

2010

Randomized priority algorithms.

[BibT_eX]

[DOI]

Allan Borodin

Theor. Comput. Sci., 2010

2009

Tight Bounds for Quasirandom Rumor Spreading.

[BibT_eX]

[DOI]

Benjamin Doerr

Anna Huber

Electron. J. Comb., 2009

On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, 7th International Workshop, 2009

Online Priority Steiner Tree Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Interruptible Algorithms for Multi-Problem Solving.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2009, 2009

Parameterized Analysis of Online Steiner Tree Problems.

[BibT_eX]

[DOI]

Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

2008

List Update with Locality of Reference.

[BibT_eX]

[DOI]

Reza Dorrigiv

Proceedings of the LATIN 2008: Theoretical Informatics, 2008

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

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

On the separation and equivalence of paging strategies.

[BibT_eX]

[DOI]

Reza Dorrigiv

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.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006

The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Theory, 2006

Optimal Scheduling of Contract Algorithms for Anytime Problems.

[BibT_eX]

[DOI]

Angèle M. Hamel

Proceedings of the Proceedings, 2006

2005

On-Line Algorithms for Market Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

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

[BibT_eX]

[DOI]

Allan Borodin

Algorithmica, 2004

Order-Preserving Transformations and Greedy-Like Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

2003

Randomized Priority Algorithms: (Extended Abstract).

[BibT_eX]

[DOI]