Spyros Angelopoulos

From MaRDI portal
Revision as of 02:52, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:515542

Available identifiers

zbMath Open angelopoulos.spyrosDBLP00/4199-2WikidataQ58491961 ScholiaQ58491961MaRDI QIDQ515542

List of research outcomes

PublicationDate of PublicationType
Online search with a hint2024-02-02Paper
Best-of-both-worlds analysis of online search2023-12-13Paper
Contract scheduling with predictions2023-10-23Paper
Weighted online search2023-08-21Paper
https://portal.mardi4nfdi.de/entity/Q58757542023-02-03Paper
https://portal.mardi4nfdi.de/entity/Q50904532022-07-18Paper
Further connections between contract-scheduling and ray-searching problems2022-05-27Paper
Online Maximum Matching with Recourse2021-08-04Paper
Online maximum matching with recourse2021-05-10Paper
Interruptible algorithms for multiproblem solving2020-08-31Paper
Competitive search in a network2020-05-27Paper
Stochastic dominance and the bijective ratio of online algorithms2020-04-01Paper
Online bin packing with advice of small size2019-09-05Paper
Parameterized analysis of the online priority and node-weighted Steiner tree problems2019-09-05Paper
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems2019-08-20Paper
https://portal.mardi4nfdi.de/entity/Q46339282019-05-06Paper
The expanding search ratio of a graph2019-05-03Paper
On the separation and equivalence of paging strategies and other online algorithms2019-03-11Paper
The expanding search ratio of a graph2018-01-24Paper
Optimal scheduling of contract algorithms with soft deadlines2017-09-01Paper
Multi-processor search and scheduling problems with setup cost2017-08-15Paper
Infinite linear programming and online searching with turn cost2017-03-16Paper
Primal-dual and dual-fitting analysis of online scheduling algorithms for generalized flow-time problems2015-11-19Paper
Online Bin Packing with Advice of Small Size2015-10-30Paper
https://portal.mardi4nfdi.de/entity/Q29346012014-12-18Paper
https://portal.mardi4nfdi.de/entity/Q29346032014-12-18Paper
Multi-target ray searching problems2014-06-06Paper
Paging and list update under bijective analysis2014-02-17Paper
Multi-target Ray Searching Problems2011-08-12Paper
Randomized priority algorithms2010-06-07Paper
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems2010-05-11Paper
Tight bounds for quasirandom rumor spreading2010-03-26Paper
Online Priority Steiner Tree Problems2009-10-20Paper
Approximation and Online Algorithms2009-08-11Paper
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry2008-11-25Paper
List Update with Locality of Reference2008-04-15Paper
The Node-Weighted Steiner Problem in Graphs of Restricted Node Weights2007-09-07Paper
Computing and Combinatorics2006-01-11Paper
Approximation and Online Algorithms2005-12-14Paper
The power of priority algorithms for facility location and set cover2004-11-05Paper
https://portal.mardi4nfdi.de/entity/Q44112752003-07-07Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Spyros Angelopoulos