Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors. - Dimitris Fotakis 001; Ioannis Milis; Orestis Papadigenopoulos; Emmanouil Zampetakis; Georgios Zois (SEA, 2015)

Scheduling MapReduce Jobs Under Multi-round Precedences. - Dimitris Fotakis 001; Ioannis Milis; Orestis Papadigenopoulos; Vasilis Vassalos; Georgios Zois (Euro-Par, 2016)

Electric Vehicle Valet. - Ali Khodabakhsh 002; Orestis Papadigenopoulos; Jannik Matuschke; Jimmy Horn; Evdokia Nikolova; Emmanouil Pountourakis (CoRR, 2018)

Scheduling MapReduce Jobs on Identical and Unrelated Processors. - Dimitris Fotakis 001; Ioannis Milis; Orestis Papadigenopoulos; Vasilis Vassalos; Georgios Zois (Theory Comput. Syst., 2020)

Contextual Blocking Bandits. - Soumya Basu 001; Orestis Papadigenopoulos; Constantine Caramanis; Sanjay Shakkottai (AISTATS, 2021)

Combinatorial Blocking Bandits with Stochastic Delays. - Alexia Atsidakou; Orestis Papadigenopoulos; Soumya Basu 001; Constantine Caramanis; Sanjay Shakkottai (ICML, 2021)

Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits. - Orestis Papadigenopoulos; Constantine Caramanis (NeurIPS, 2021)

Recurrent Submodular Welfare and Matroid Blocking Bandits. - Orestis Papadigenopoulos; Constantine Caramanis (CoRR, 2021)

Single-Sample Prophet Inequalities Revisited. - Constantine Caramanis; Matthew Faw; Orestis Papadigenopoulos; Emmanouil Pountourakis (CoRR, 2021)

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (CoRR, 2021)

A Constant-Factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (CoRR, 2021)

Asymptotically-Optimal Gaussian Bandits with Side Observations. - Alexia Atsidakou; Orestis Papadigenopoulos; Constantine Caramanis; Sujay Sanghavi; Sanjay Shakkottai (ICML, 2022)

Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret. - Orestis Papadigenopoulos; Constantine Caramanis; Sanjay Shakkottai (NeurIPS, 2022)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection. - Constantine Caramanis; Paul Dütting; Matthew Faw; Federico Fusco; Philip Lazos; Stefano Leonardi 001; Orestis Papadigenopoulos; Emmanouil Pountourakis; Rebecca Reiffenhäuser (SODA, 2022)

Learning To Maximize Welfare with a Reusable Resource. - Matthew Faw; Orestis Papadigenopoulos; Constantine Caramanis; Sanjay Shakkottai (Proc. ACM Meas. Anal. Comput. Syst., 2022)

Last Switch Dependent Bandits with Monotone Payoff Functions. - Ayoub Foussoul; Vineet Goyal; Orestis Papadigenopoulos; Assaf Zeevi (ICML, 2023)

MNL-Prophet: Sequential Assortment Selection under Uncertainty. - Vineet Goyal; Salal Humair; Orestis Papadigenopoulos; Assaf Zeevi (CoRR, 2023)

Malleable scheduling beyond identical machines. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (J. Sched., 2023)

Contextual Pandora's Box. - Alexia Atsidakou; Constantine Caramanis; Evangelia Gergatsouli; Orestis Papadigenopoulos; Christos Tzamos (AAAI, 2024)

A constant-factor approximation for generalized malleable scheduling under $M ^{ atural }$-concave processing speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (Math. Program., 2024)

Assigning and Scheduling Generalized Malleable Jobs Under Subadditive or Submodular Processing Speeds. - Dimitris Fotakis 001; Jannik Matuschke; Orestis Papadigenopoulos (Oper. Res., 2025)