default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSpyros Angelopoulos 0001
Person information
- affiliation: CNRS, Paris, France
Other persons with the same name
- Spyros Angelopoulos 0002
![[0000-0002-8165-8204]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-8165-8204")
— Durham University, UK (and 2 more)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j28]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online computation with untrusted advice. J. Comput. Syst. Sci. 144: 103545 (2024)- [j27]Spyros Angelopoulos, Pierre Fraigniaud, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on theory and applications of Graph Searching. Theor. Comput. Sci. 1016: 114759 (2024) - [c32]Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr, Bertrand Simon:
Contract Scheduling with Distributional and Multiple Advice. IJCAI 2024: 3652-3660 - [i23]Spyros Angelopoulos, Thomas Lidbetter, Konstantinos Panagiotou:
Search Games with Predictions. CoRR abs/2401.01149 (2024) - [i22]Spyros Angelopoulos, Marcin Bienkowski, Christoph Dürr, Bertrand Simon:
Contract Scheduling with Distributional and Multiple Advice. CoRR abs/2404.12485 (2024) - [i21]Spyros Angelopoulos, Christoph Dürr, Alex Elenter, Yanni Lefki:
Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms. CoRR abs/2408.04122 (2024) - [i20]Spyros Angelopoulos, Christoph Dürr, Alex Elenter, Georgii Melidi:
Scenario-Based Robust Optimization of Tree Structures. CoRR abs/2408.11422 (2024) - 2023
- [j26]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Best-of-Both-Worlds Analysis of Online Search. Algorithmica 85(12): 3766-3792 (2023) - [j25]Spyros Angelopoulos:
Online search with a hint. Inf. Comput. 295(Part B): 105091 (2023) - [j24]Spyros Angelopoulos, Shahin Kamali:
Contract Scheduling with Predictions. J. Artif. Intell. Res. 77: 395-426 (2023) - [j23]Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami:
Online Bin Packing with Predictions. J. Artif. Intell. Res. 78: 1111-1141 (2023) - [j22]Spyros Angelopoulos, Konstantinos Panagiotou:
Weighted online search. J. Comput. Syst. Sci. 138: 103457 (2023) - [c31]Spyros Angelopoulos:
Competitive Search in the Line and the Star with Predictions. MFCS 2023: 12:1-12:15 - [c30]Spyros Angelopoulos, Shahin Kamali:
Rényi-Ulam Games and Online Computation with Imperfect Advice. MFCS 2023: 13:1-13:15 - [i19]Spyros Angelopoulos, Shahin Kamali:
Rényi-Ulam Games and Online Computation with Imperfect Advice. CoRR abs/2301.01631 (2023) - [i18]Spyros Angelopoulos:
Competitive Search in the Line and the Star with Predictions. CoRR abs/2312.17539 (2023) - 2022
- [j21]Spyros Angelopoulos:
Further connections between contract-scheduling and ray-searching problems. J. Sched. 25(2): 139-155 (2022) - [c29]Spyros Angelopoulos, Shahin Kamali, Dehou Zhang:
Online Search with Best-Price and Query-Based Predictions. AAAI 2022: 9652-9660 - [c28]Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami:
Online Bin Packing with Predictions. IJCAI 2022: 4574-4580 - 2021
- [j20]Spyros Angelopoulos, Nancy E. Clarke, Fedor V. Fomin, Archontia C. Giannopoulou, Roman Rabinovich:
Preface to the special issue on Graph Searching: Theory and Applications. Theor. Comput. Sci. 858: 145-146 (2021) - [c27]Spyros Angelopoulos, Malachi Voss:
Online Search with Maximum Clearance. AAAI 2021: 3642-3650 - [c26]Spyros Angelopoulos, Shahin Kamali:
Contract Scheduling With Predictions. AAAI 2021: 11726-11733 - [c25]Spyros Angelopoulos:
Online Search with a Hint. ITCS 2021: 51:1-51:16 - [i17]Spyros Angelopoulos, Shahin Kamali, Kimia Shadkami:
Online Bin Packing with Predictions. CoRR abs/2102.03311 (2021) - [i16]Spyros Angelopoulos, Diogo Arsénio, Shahin Kamali:
Competitive Sequencing with Noisy Advice. CoRR abs/2111.05281 (2021) - [i15]Spyros Angelopoulos, Shahin Kamali, Dehou Zhang:
Online Search With Best-Price and Query-Based Predictions. CoRR abs/2112.01592 (2021) - 2020
- [b1]Spyros Angelopoulos:
Computation under Uncertainty: From Online Algorithms to Search Games and Interruptible Systems. Sorbonne University, Paris, France, 2020 - [j19]Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer:
Stochastic Dominance and the Bijective Ratio of Online Algorithms. Algorithmica 82(5): 1101-1135 (2020) - [j18]Spyros Angelopoulos, Thomas Lidbetter:
Competitive search in a network. Eur. J. Oper. Res. 286(2): 781-790 (2020) - [j17]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Online maximum matching with recourse. J. Comb. Optim. 40(4): 974-1007 (2020) - [j16]Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible algorithms for multiproblem solving. J. Sched. 23(4): 451-464 (2020) - [c24]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. ITCS 2020: 52:1-52:15 - [i14]Spyros Angelopoulos:
Online Search With a Hint. CoRR abs/2008.13729 (2020) - [i13]Spyros Angelopoulos, Shahin Kamali:
Contract Scheduling With Predictions. CoRR abs/2011.12439 (2020) - [i12]Spyros Angelopoulos, Malachi Voss:
Online Search with Maximum Clearance. CoRR abs/2011.14144 (2020)
2010 – 2019
- 2019
- [j15]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
On the Separation and Equivalence of Paging Strategies and Other Online Algorithms. Algorithmica 81(3): 1152-1179 (2019) - [j14]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems. Algorithmica 81(9): 3391-3421 (2019) - [j13]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. Discret. Appl. Math. 260: 51-65 (2019) - [j12]Spyros Angelopoulos:
Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems. Theory Comput. Syst. 63(6): 1413-1447 (2019) - [j11]Spyros Angelopoulos, Nicolas Nisse, Dimitrios M. Thilikos:
Preface to special issue on Theory and Applications of Graph Searching. Theor. Comput. Sci. 794: 1-2 (2019) - [c23]Spyros Angelopoulos, Shendan Jin:
Earliest-Completion Scheduling of Contract Algorithms with End Guarantees. IJCAI 2019: 5493-5499 - [c22]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Best-Of-Two-Worlds Analysis of Online Search. STACS 2019: 7:1-7:17 - [i11]Spyros Angelopoulos, Christoph Dürr, Shendan Jin, Shahin Kamali, Marc P. Renault:
Online Computation with Untrusted Advice. CoRR abs/1905.05655 (2019) - [i10]Spyros Angelopoulos, Thomas Lidbetter:
Competitive Search in a Network. CoRR abs/1908.02132 (2019) - 2018
- [j10]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. Theory Comput. Syst. 62(8): 2006-2034 (2018) - [c21]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Online Maximum Matching with Recourse. MFCS 2018: 8:1-8:15 - [i9]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Online Maximum Matching with Recourse. CoRR abs/1801.03462 (2018) - [i8]Spyros Angelopoulos, Christoph Dürr, Shendan Jin:
Best-of-two-worlds analysis of online search. CoRR abs/1810.08109 (2018) - [i7]Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible Algorithms for Multiproblem Solving. CoRR abs/1810.11291 (2018) - 2017
- [j9]Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr, Alejandro López-Ortiz:
Multi-processor Search and Scheduling Problems with Setup Cost. Theory Comput. Syst. 60(4): 637-670 (2017) - [j8]Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel:
Optimal scheduling of contract algorithms with soft deadlines. J. Sched. 20(3): 267-277 (2017) - [j7]Spyros Angelopoulos, Diogo Arsénio, Christoph Dürr:
Infinite linear programming and online searching with turn cost. Theor. Comput. Sci. 670: 11-22 (2017) - [i6]Spyros Angelopoulos, Konstantinos Panagiotou:
Optimal strategies for weighted ray search. CoRR abs/1704.03777 (2017) - 2016
- [c20]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The Expanding Search Ratio of a Graph. STACS 2016: 9:1-9:14 - [r1]Spyros Angelopoulos:
Deterministic Searching on the Line. Encyclopedia of Algorithms 2016: 531-533 - [i5]Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter:
The expanding search ratio of a graph. CoRR abs/1602.06258 (2016) - [i4]Spyros Angelopoulos, Marc P. Renault, Pascal Schweitzer:
Stochastic dominance and the bijective ratio of online algorithms. CoRR abs/1607.06132 (2016) - 2015
- [c19]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow Time Problems. ESA 2015: 35-46 - [c18]Spyros Angelopoulos:
Further Connections Between Contract-Scheduling and Ray-Searching Problems. IJCAI 2015: 1516-1522 - [c17]Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc P. Renault, Adi Rosén:
Online Bin Packing with Advice of Small Size. WADS 2015: 40-53 - [i3]Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen:
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems. CoRR abs/1502.03946 (2015) - [i2]Spyros Angelopoulos:
Further Connections Between Contract-Scheduling and Ray-Searching Problems. CoRR abs/1504.07168 (2015) - 2014
- [j6]Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving. J. Artif. Intell. Res. 51: 533-554 (2014) - [j5]Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target ray searching problems. Theor. Comput. Sci. 540: 2-12 (2014) - 2013
- [j4]Spyros Angelopoulos, Pascal Schweitzer:
Paging and list update under bijective analysis. J. ACM 60(2): 7:1-7:18 (2013) - 2011
- [c16]Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou:
Multi-target Ray Searching Problems. WADS 2011: 37-48 - 2010
- [j3]Spyros Angelopoulos, Allan Borodin:
Randomized priority algorithms. Theor. Comput. Sci. 411(26-28): 2542-2558 (2010)
2000 – 2009
- 2009
- [j2]Spyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou:
Tight Bounds for Quasirandom Rumor Spreading. Electron. J. Comb. 16(1) (2009) - [c15]Spyros Angelopoulos, Alejandro López-Ortiz:
Interruptible Algorithms for Multi-Problem Solving. IJCAI 2009: 380-386 - [c14]Spyros Angelopoulos, Pascal Schweitzer:
Paging and list update under bijective analysis. SODA 2009: 1136-1145 - [c13]Spyros Angelopoulos:
Online Priority Steiner Tree Problems. WADS 2009: 37-48 - [c12]Spyros Angelopoulos:
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems. WAOA 2009: 1-12 - [i1]Spyros Angelopoulos:
Parameterized Analysis of Online Steiner Tree Problems. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - 2008
- [c11]Spyros Angelopoulos, Alejandro López-Ortiz, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms with Soft Deadlines. AAAI 2008: 868-873 - [c10]Spyros Angelopoulos:
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry. ESA 2008: 76-87 - [c9]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
List Update with Locality of Reference. LATIN 2008: 399-410 - 2007
- [c8]Spyros Angelopoulos, Reza Dorrigiv, Alejandro López-Ortiz:
On the separation and equivalence of paging strategies. SODA 2007: 229-237 - [c7]Spyros Angelopoulos:
Improved bounds for the online steiner tree problem in graphs of bounded edge-asymmetry. SODA 2007: 248-257 - 2006
- [c6]Alejandro López-Ortiz, Spyros Angelopoulos, Angèle M. Hamel:
Optimal Scheduling of Contract Algorithms for Anytime Problems. AAAI 2006: 874-879 - [c5]Spyros Angelopoulos:
The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights. SWAT 2006: 208-219 - 2005
- [c4]Spyros Angelopoulos, Atish Das Sarma, Avner Magen, Anastasios Viglas:
On-Line Algorithms for Market Equilibria. COCOON 2005: 596-607 - 2004
- [j1]Spyros Angelopoulos, Allan Borodin:
The Power of Priority Algorithms for Facility Location and Set Cover. Algorithmica 40(4): 271-291 (2004) - [c3]Spyros Angelopoulos:
Order-Preserving Transformations and Greedy-Like Algorithms. WAOA 2004: 197-210 - 2003
- [c2]Spyros Angelopoulos:
Randomized Priority Algorithms: (Extended Abstract). WAOA 2003: 27-40 - 2002
- [c1]Spyros Angelopoulos, Allan Borodin:
On the Power of Priority Algorithms for Facility Location and Set Cover. APPROX 2002: 26-39
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
