Skip to Main content
Number of documents

35

List of publications of Spyros Angelopoulos (CNRS and Sorbonne University)


Journal articles19 documents

Conference papers10 documents

  • Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Shendan Jin, Marc Renault. Online Computation with Untrusted Advice. 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), Jan 2020, Seattle, United States. pp.52:1--52:15, ⟨10.4230/LIPIcs.ITCS.2020.52⟩. ⟨hal-02500370⟩
  • Spyros Angelopoulos, Shendan Jin. Earliest-Completion Scheduling of Contract Algorithms with End Guarantees. Twenty-Eighth International Joint Conference on Artificial Intelligence , Aug 2019, Macao, Macau SAR China. pp.5493-5499, ⟨10.24963/ijcai.2019/763⟩. ⟨hal-02374471⟩
  • Spyros Angelopoulos, Christoph Dürr, Shendan Jin. Best-Of-Two-Worlds Analysis of Online Search. 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Mar 2019, Berlin, Germany. pp.7:1--7:17, ⟨10.4230/LIPIcs.STACS.2019.7⟩. ⟨hal-02163346⟩
  • Spyros Angelopoulos, Christoph Dürr, Shendan Jin. Online Maximum Matching with Recourse. 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018), Aug 2018, Liverpool, United Kingdom. pp.8:1--8:15, ⟨10.4230/LIPIcs.MFCS.2018.8⟩. ⟨hal-02986916⟩
  • Spyros Angelopoulos, Christoph Dürr, Thomas Lidbetter. The expanding search ratio of a graph. The 33rd Symposium on Theoretical Aspects of Computer Science (STACS), Nicolas Ollinger and Heribert Vollmer, Feb 2016, Orléans, France. pp.4:1--9:14, ⟨10.4230/LIPIcs.STACS.2016.9⟩. ⟨hal-01344126⟩
  • Spyros Angelopoulos, Christoph Dürr, Shahin Kamali, Marc Renault, Adi Rosén. Online Bin Packing with Advice of Small Size. Algorithms and Data Structures, Aug 2015, Victoria, Canada. pp.40-53, ⟨10.1007/978-3-319-21840-3_4⟩. ⟨hal-01196948⟩
  • Spyros Angelopoulos, Giorgio Lucarelli, Kim Thang Nguyen. Primal-Dual and Dual-Fitting analysis of online scheduling algorithms for generalized flow time problems. 23rd European Symposium on Algorithms (ESA 2015), Sep 2015, Patras, Greece. pp.35--46, ⟨10.1007/978-3-662-48350-3_4⟩. ⟨hal-01227668⟩
  • Spyros Angelopoulos. Further Connections Between Contract-Scheduling and Ray-Searching Problems. 24th International Joint Conference on Artificial Intelligence, Jul 2015, Buenos Aires, Argentina. pp.1516-1522. ⟨hal-01362953⟩
  • Spyros Angelopoulos, Alejandro López-Ortiz, Konstantinos Panagiotou. Multi-target Ray Searching Problems. Algorithms and Data Structures - 12th International Symposium, WADS, Aug 2011, New York City, United States. pp.37-48, ⟨10.1007/978-3-642-22300-6_4⟩. ⟨hal-01284810⟩
  • Spyros Angelopoulos, Alejandro Lopez-Ortiz. Interruptible algorithms for multiproblem solving. Twenty-first International Joint Conference on Artificial Intelligence (IJCAI-09), Jul 2009, Pasadena, CA, United States. pp.380-386, ⟨10.5555/1661445.1661506⟩. ⟨hal-02986819⟩

Book sections1 document

  • Spyros Angelopoulos. Deterministic Searching on the Line. Encyclopedia of Algorithms, pp.531-533, 2016. ⟨hal-01362923⟩

Preprints, Working Papers, ...3 documents

  • Spyros Angelopoulos. Online Search With a Hint. 2020. ⟨hal-02986250⟩
  • Spyros Angelopoulos, Shahin Kamali. Contract Scheduling With Predictions. 2020. ⟨hal-03094769⟩
  • Spyros Angelopoulos, Malachi Voss. Online Search with Maximum Clearance. 2020. ⟨hal-03094824⟩

Reports1 document

  • Spyros Angelopoulos, Pierre Fraigniaud, Fedor V. Fomin, Nicolas Nisse, Dimitrios M. Thilikos. Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017. [Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017. ⟨lirmm-01645614⟩

Habilitation à diriger des recherches1 document

  • Spyros Angelopoulos. Computation under Uncertainty: From Online Algorithms to Search Games and Interruptible Systems. Data Structures and Algorithms [cs.DS]. Sorbonne University, 2020. ⟨tel-03094902⟩