Orestis Papadigenopoulos

Orcid: 0000-0003-2164-0202

According to our database1, Orestis Papadigenopoulos authored at least 20 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Contextual Pandora's Box.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Malleable scheduling beyond identical machines.
J. Sched., October, 2023

MNL-Prophet: Sequential Assortment Selection under Uncertainty.
CoRR, 2023

Last Switch Dependent Bandits with Monotone Payoff Functions.
Proceedings of the International Conference on Machine Learning, 2023

2022
Learning To Maximize Welfare with a Reusable Resource.
Proc. ACM Meas. Anal. Comput. Syst., 2022

Single-Sample Prophet Inequalities via Greedy-Ordered Selection.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds.
Proceedings of the Integer Programming and Combinatorial Optimization, 2022

Asymptotically-Optimal Gaussian Bandits with Side Observations.
Proceedings of the International Conference on Machine Learning, 2022

2021
A Constant-Factor Approximation for Generalized Malleable Scheduling under M<sup>♮</sup>-Concave Processing Speeds.
CoRR, 2021

Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds.
CoRR, 2021

Single-Sample Prophet Inequalities Revisited.
CoRR, 2021

Recurrent Submodular Welfare and Matroid Blocking Bandits.
CoRR, 2021

Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Combinatorial Blocking Bandits with Stochastic Delays.
Proceedings of the 38th International Conference on Machine Learning, 2021

Contextual Blocking Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Scheduling MapReduce Jobs on Identical and Unrelated Processors.
Theory Comput. Syst., 2020

2018
Electric Vehicle Valet.
CoRR, 2018

2016
Scheduling MapReduce Jobs Under Multi-round Precedences.
Proceedings of the Euro-Par 2016: Parallel Processing, 2016

2015
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors.
Proceedings of the Experimental Algorithms - 14th International Symposium, 2015


  Loading...