Department of Computer Science
The University of Texas at Austin
2317 Speedway, Stop D9500
Austin, TX 78712
Email: papadig (at)

V. Orestis Papadigenopoulos

PhD Student in Computer Science

I am a PhD student at the Department of Computer Science at The Univeristy of Texas at Austin, supported by the Provost's Graduate Excellence Fellowship. I am fortunate to be advised by Prof. Constantine Caramanis . I am broadly interested in the field of theoretical computer science with emphasis on the design and analysis of (approximation and online) algorithms, online learning/ multi-armed bandits and combinatorial optimization. Prior to joining UT, I had the luck to be advised by Prof. Dimitris Fotakis.


  • Single-Sample Prophet Inequalities Revisited arXiv
    C. Caramanis, M. Faw, O. Papadigenopoulos, E. Pountourakis

  • Recurrent Submodular Welfare and Matroid Blocking Bandits arXiv
    O. Papadigenopoulos, C. Caramanis

  • Contextual Blocking Bandits arXiv
    S. Basu, O. Papadigenopoulos, C. Caramanis, S. Shakkottai
    24th International Conference on Artificial Intelligence and Statistics AISTATS 2021

  • Malleable Scheduling Beyond Identical Machines arXiv
    D. Fotakis, J. Matuschke, O. Papadigenopoulos
    22nd International Conference on Approximation Algorithms for Combinatorial Optimization Problems APPROX 2019

  • Scheduling MapReduce Jobs under Multi-Round Precedences Link arXiv
    D. Fotakis, I. Milis, O. Papadigenopoulos, V. Vassalos and G. Zois
    22nd International European Conference on Parallel and Distributed Computing EUROPAR 2016

  • Scheduling MapReduce jobs and Data Shuffle on Unrelated Processors Link
    D. Fotakis, I. Milis, O. Papadigenopoulos, E. Zampetakis and G. Zois
    14th International Symposium on Experimental Algorithms, SEA 2015

© V. Orestis Papadigenopoulos 2020