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 Theoretical Computer Science

I am a third year 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 widely interested in the field of theoretical computer science with emphasis on the design and analysis of (approximation) algorithms and the intersection of convex and combinatorial optimization. Prior of joining UT, I had the luck to be advised by Prof. Dimitris Fotakis.


  • On Low-rank (Quasi-convex) Combinatorial Optimization
    S. Gupta, E. Nikolova, O. Papadigenopoulos
    In preparation

  • 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 2017