Publications 2004-2024

• 2024
  • S. Angelopoulos, D. Arsenio, Sh. Kamali : “Competitive Sequencing with Query Predictions”, (2024)
  • S. Angelopoulos, Ch. Dürr, Sh. Jin, Sh. Kamali, M. Renault : “Online Computation with Untrusted Advice”, Journal of Computer and System Sciences, vol. 144, pp. 103545, (Elsevier) (2024)
  • S. Angelopoulos, Ch. Dürr, A. Elenter, G. Melidi : “Scenario-Based Robust Optimization of Tree Structures”, 39^th Annual AAAI Conference on Artificial Intelligence (AAAI-25), Philadelphia (PA), United States (2024)
  • S. Angelopoulos, Th. Lidbetter, K. Panagiotou : “Search Games with Predictions”, (2024)
  • A. Elenter, S. Angelopoulos, Ch. Dürr, Y. Lefki : “Overcoming Brittleness in Pareto-Optimal Learning-Augmented Algorithms”, 38^th Conference on Neural Information Processing Systems, (NeurIPS 2024), Vancouver, BC, Canada (2024)
  • S. Angelopoulos, M. Bienkowski, Ch. Dürr, B. Simon : “Contract Scheduling with Distributional and Multiple Advice”, Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, Jeju Island, Korea, Republic of, pp. 3652-3660, (ISBN: 978-1-956792-04-1) (2024)
• 2023
  • S. Angelopoulos, Sh. Kamali, K. Shadkami : “Online Bin Packing with Predictions *”, Journal of Artificial Intelligence Research, vol. 78, pp. 1111-1141, (Association for the Advancement of Artificial Intelligence) (2023)
  • S. Angelopoulos, K. Panagiotou : “Weighted online search”, Journal of Computer and System Sciences, vol. 138, pp. 103457, (Elsevier) (2023)
  • S. Angelopoulos : “Online Search with a Hint”, Information and Computation, vol. 295, pp. 105091, (Elsevier) (2023)
  • S. Angelopoulos, Ch. Dürr, Sh. Jin : “Best-of-both-Worlds Analysis of Online Search”, Algorithmica, (Springer Verlag) (2023)
  • S. Angelopoulos, Sh. Kamali : “Contract Scheduling with Predictions”, Journal of Artificial Intelligence Research, vol. 77, pp. 395-426, (Association for the Advancement of Artificial Intelligence) (2023)
  • S. Angelopoulos, K. Canhilal, M. Hawkins : “From Groups to Communities: A Resource Mobilization Theory Perspective on the Emergence of Communities”, Information Systems Frontiers, pp. 18 p., (Springer Verlag) (2023)
  • S. Angelopoulos : “Competitive Search in the Line and the Star with Predictions”, 48^th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), vol. 272, Leibniz International Proceedings in Informatics (LIPIcs), Bordeaux, France, pp. 12:1-12:15, (Schloss Dagstuhl - Leibniz-Zentrum für Informatik) (2023)
  • S. Angelopoulos, Sh. Kamali : “Rényi-Ulam Games and Online Computation with Imperfect Advice”, 48^th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), vol. 272, Leibniz International Proceedings in Informatics (LIPIcs), Bordeaux, France, pp. 13:1-13:15, (Schloss Dagstuhl - Leibniz-Zentrum für Informatik) (2023)
• 2022
  • S. Angelopoulos : “Calcul en ligne : améliorer ses performances en utilisant des prédictions”, Interstices, (INRIA) (2022)
  • S. Angelopoulos, Sh. Kamali, K. Shadkami : “Online Bin Packing with Predictions”, Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}, vol. 36 (9), Vienna, Austria, pp. 4574-4580, (International Joint Conferences on Artificial Intelligence Organization) (2022)
  • S. Angelopoulos, Sh. Kamali, D. Zhang : “Online Search with Best-Price and Query-Based Predictions”, Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI 2022, vol. 36 (9), Proceedings of the AAAI Conference on Artificial Intelligence, Virtual event, United States, pp. 9652-9660 (2022)
• 2021
  • S. Angelopoulos, D. Arsenio, Sh. Kamali : “Competitive Sequencing with Noisy Advice”, (2021)
  • S. Angelopoulos, Sh. Kamali, K. Shadkami : “Online Bin Packing with Predictions”, (2021)
  • S. Angelopoulos : “Further connections between contract-scheduling and ray-searching problems”, Journal of Scheduling, vol. 25, pp. 139-155, (Springer Verlag) (2021)
  • S. Angelopoulos, Sh. Kamali : “Contract Scheduling With Predictions”, Proceedings of the 35^th AAAI Conference on Artificial Intelligence (AAAI), vol. 35 (13), Proceedings of the AAAI Conference on Artificial Intelligence, Online Conference, United States, pp. 11726-11733, (AAAI Press) (2021)
  • S. Angelopoulos, M. Voss : “Online Search with Maximum Clearance”, 35^th AAAI Conference on Artificial Intelligence (AAAI), vol. 35 (5), Online Conference, United States, pp. 3642-3650, (AAAI Press) (2021)
  • S. Angelopoulos, N. Clarke, F. Fomin, A. Giannopoulou, R. Rabinovich : “Preface to the special issue on Graph Searching: Theory and Applications”, Theoretical Computer Science, vol. 858, pp. 145-146, (Elsevier) (2021)
  • S. Angelopoulos : “Online Search With a Hint”, 12^th Innovations in Theoretical Computer Science Conference (ITCS 2021), vol. 185, Leibniz International Proceedings in Informatics (LIPIcs), Online Event, United States, pp. 51:1-51:16, (Schloss Dagstuhl--Leibniz-Zentrum für Informatik) (2021)
• 2020
  • S. Angelopoulos, M. Voss : “Online Search with Maximum Clearance”, (2020)
  • S. Angelopoulos, Ch. Dürr, Sh. Jin : “Online maximum matching with recourse”, Journal of Combinatorial Optimization, vol. 40 (4), pp. 974-1007, (Springer Verlag) (2020)
  • S. Angelopoulos, Th. Lidbetter : “Competitive search in a network”, European Journal of Operational Research, vol. 286 (2), pp. 781-790, (Elsevier) (2020)
  • S. Angelopoulos, A. López‑Ortiz : “Interruptible algorithms for multiproblem solving”, Journal of Scheduling, vol. 23 (4), pp. 451-464, (Springer Verlag) (2020)
  • S. Angelopoulos, M. Renault, P. Schweitzer : “Stochastic Dominance and the Bijective Ratio of Online Algorithms”, Algorithmica, vol. 82, pp. 1101–1135, (Springer Verlag) (2020)
  • S. Angelopoulos, Ch. Dürr, Sh. Kamali, Sh. Jin, M. Renault : “Online Computation with Untrusted Advice”, 11^th Innovations in Theoretical Computer Science Conference (ITCS 2020), vol. 151, Leibniz International Proceedings in Informatics (LIPIcs), Seattle, United States, pp. 52:1-52:15, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2020)
• 2019
  • S. Angelopoulos, N. Nisse, Dimitrios M. Thilikos : “Preface to special issue on Theory and Applications of Graph Searching”, Theoretical Computer Science, vol. 749, (Elsevier) (2019)
  • S. Angelopoulos, G. Lucarelli, K. Nguyen : “Primal–Dual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems”, Algorithmica, vol. 81 (9), pp. 3391-3421, (Springer Verlag) (2019)
  • S. Angelopoulos : “Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems”, Theory of Computing Systems, vol. 63 (6), pp. 1413-1447, (Springer Verlag) (2019)
  • S. Angelopoulos, Sh. Jin : “Earliest-Completion Scheduling of Contract Algorithms with End Guarantees”, Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}, Macao, Macao, pp. 5493-5499, (International Joint Conferences on Artificial Intelligence Organization) (2019)
  • S. Angelopoulos, Ch. Dürr, Th. Lidbetter : “The expanding search ratio of a graph”, Discrete Applied Mathematics, vol. 260, pp. 51-65, (Elsevier) (2019)
  • S. Angelopoulos, Ch. Dürr, Sh. Jin : “Best-Of-Two-Worlds Analysis of Online Search”, 36^th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), vol. 126, Leibniz International Proceedings in Informatics (LIPIcs), Berlin, Germany, pp. 7:1-7:17, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2019)
  • S. Angelopoulos, R. Dorrigiv, A. López‑Ortiz : “On the Separation and Equivalence of Paging Strategies and Other Online Algorithms”, Algorithmica, vol. 81 (3), pp. 1152-1179, (Springer Verlag) (2019)
• 2018
  • S. Angelopoulos, Ch. Dürr, Sh. Kamali, M. Renault, A. Rosén : “Online Bin Packing with Advice of Small Size”, Theory of Computing Systems, vol. 62 (8), pp. 2006-2034, (Springer Verlag) (2018)
  • S. Angelopoulos, Ch. Dürr, Sh. Jin : “Online Maximum Matching with Recourse”, 43^rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), vol. 117, Leibniz International Proceedings in Informatics (LIPIcs), Liverpool, United Kingdom, pp. 8:1-8:15 (2018)
• 2017
  • S. Angelopoulos, P. Fraigniaud, Fedor V. Fomin, N. Nisse, Dimitrios M. Thilikos : “Report on GRASTA 2017, 6^th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017”, (2017)
  • S. Angelopoulos, D. Arsenio, Ch. Dürr : “Infinite linear programming and online searching with turn cost”, Theoretical Computer Science, (Elsevier) (2017)
• 2016
  • S. Angelopoulos, Ch. Dürr, Th. Lidbetter : “The expanding search ratio of a graph”, Proc. of the 33^rd Symposium on Theoretical Aspects of Computer Science (STACS), vol. 47, Leibniz International Proceedings in Informatics (LIPIcs), Orléans, France, pp. 4:1-9:14, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2016)
  • S. Angelopoulos : “Deterministic Searching on the Line”, chapter in Encyclopedia of Algorithms, pp. 531-533 (2016)
  • S. Angelopoulos, D. Arsenio, Ch. Dürr, A. López‑Ortiz : “Multi-processor Search and Scheduling Problems with Setup Cost”, Theory of Computing Systems, (Springer Verlag) (2016)
  • S. Angelopoulos, A. López‑Ortiz, A. Hamel : “Optimal scheduling of contract algorithms with soft deadlines”, Journal of Scheduling, (Springer Verlag) (2016)
• 2015
  • S. Angelopoulos, G. Lucarelli, K. Nguyen : “Primal-Dual and Dual-Fitting analysis of online scheduling algorithms for generalized flow time problems”, Algorithms - ESA 2015, vol. 9294, Lecture Notes in Computer Science, Patras, Greece, pp. 35-46, (Springer) (2015)
  • S. Angelopoulos, Ch. Dürr, Sh. Kamali, M. Renault, A. Rosén : “Online Bin Packing with Advice of Small Size”, Algorithms and Data Structures, vol. 9214, Lecture Notes in Computer Science, Victoria, Canada, pp. 40-53, (Springer) (2015)
  • S. Angelopoulos : “Further Connections Between Contract-Scheduling and Ray-Searching Problems”, 24^th International Joint Conference on Artificial Intelligence, Buenos Aires, Argentina, pp. 1516-1522 (2015)
• 2014
  • S. Angelopoulos, A. López‑Ortiz, K. Panagiotou : “Multi-target ray searching problems”, Theoretical Computer Science, vol. 540-541, pp. 2-12, (Elsevier) (2014)
  • A. López‑Ortiz, S. Angelopoulos, A. Hamel : “Optimal Scheduling of Contract Algorithms for Anytime Problem-Solving”, Journal of Artificial Intelligence Research, vol. 51, pp. 533-554, (Association for the Advancement of Artificial Intelligence) (2014)
• 2013
  • S. Angelopoulos, P. Schweitzer : “Paging and list update under bijective analysis”, Journal of the ACM (JACM), vol. 60 (2), pp. 7, (Association for Computing Machinery) (2013)
• 2011
  • S. Angelopoulos, A. López‑Ortiz, K. Panagiotou : “Multi-target Ray Searching Problems”, Algorithms and Data Structures - 12^th International Symposium, WADS, vol. 6844, Lecture Notes in Computer Science, New York City, United States, pp. 37-48, (Springer) (2011)
• 2010
  • S. Angelopoulos, A. Borodin : “Randomized priority algorithms”, Theoretical Computer Science, vol. 411 (26-28), pp. 2542-2558, (Elsevier) (2010)
• 2009
  • S. Angelopoulos, B. Doerr, A. Huber, K. Panagiotou : “Tight Bounds for Quasirandom Rumor Spreading”, The Electronic Journal of Combinatorics, vol. 16 (1), pp. r102, (Open Journal Systems) (2009)
  • S. Angelopoulos, A. López‑Ortiz : “Interruptible algorithms for multiproblem solving”, IJCAI'09: Proceedings of the 21^st international joint conference on Artifical intelligence, Pasadena, CA, United States, pp. 380–386, (ACM) (2009)
• 2004
  • S. Angelopoulos, A. Borodin : “The Power of Priority Algorithms for Facility Location and Set Cover”, Algorithmica, vol. 40, pp. 271-291, (Springer Verlag) (2004)