default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOrestis Papadigenopoulos
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Dimitris Fotakis, Jannik Matuschke
, Orestis Papadigenopoulos:
A constant-factor approximation for generalized malleable scheduling under $M ^{\natural }$-concave processing speeds. Math. Program. 206(1): 515-539 (2024)- [c13]Alexia Atsidakou, Constantine Caramanis, Evangelia Gergatsouli, Orestis Papadigenopoulos, Christos Tzamos:
Contextual Pandora's Box. AAAI 2024: 10944-10952 - 2023
- [j3]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable scheduling beyond identical machines. J. Sched. 26(5): 425-442 (2023) - [c12]Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi:
Last Switch Dependent Bandits with Monotone Payoff Functions. ICML 2023: 10265-10284 - [i14]Ayoub Foussoul, Vineet Goyal, Orestis Papadigenopoulos, Assaf Zeevi:
Last Switch Dependent Bandits with Monotone Payoff Functions. CoRR abs/2306.00338 (2023) - [i13]Vineet Goyal, Salal Humair, Orestis Papadigenopoulos, Assaf Zeevi:
MNL-Prophet: Sequential Assortment Selection under Uncertainty. CoRR abs/2308.05207 (2023) - 2022
- [j2]Matthew Faw, Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Learning To Maximize Welfare with a Reusable Resource. Proc. ACM Meas. Anal. Comput. Syst. 6(2): 27:1-27:30 (2022) - [c11]Alexia Atsidakou, Orestis Papadigenopoulos, Constantine Caramanis, Sujay Sanghavi, Sanjay Shakkottai:
Asymptotically-Optimal Gaussian Bandits with Side Observations. ICML 2022: 1057-1077 - [c10]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A Constant-Factor Approximation for Generalized Malleable Scheduling Under $M^\natural $-Concave Processing Speeds. IPCO 2022: 237-250 - [c9]Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret. NeurIPS 2022 - [c8]Matthew Faw, Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Learning To Maximize Welfare with a Reusable Resource. SIGMETRICS (Abstracts) 2022: 111-112 - [c7]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. SODA 2022: 1298-1325 - [i12]Alexia Atsidakou, Constantine Caramanis, Evangelia Gergatsouli, Orestis Papadigenopoulos, Christos Tzamos:
Contextual Pandora's Box. CoRR abs/2205.13114 (2022) - [i11]Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Non-Stationary Bandits under Recharging Payoffs: Improved Planning with Sublinear Regret. CoRR abs/2205.14790 (2022) - 2021
- [c6]Soumya Basu, Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Contextual Blocking Bandits. AISTATS 2021: 271-279 - [c5]Alexia Atsidakou, Orestis Papadigenopoulos, Soumya Basu, Constantine Caramanis, Sanjay Shakkottai:
Combinatorial Blocking Bandits with Stochastic Delays. ICML 2021: 404-413 - [c4]Orestis Papadigenopoulos, Constantine Caramanis:
Recurrent Submodular Welfare and Matroid Blocking Semi-Bandits. NeurIPS 2021: 23334-23346 - [i10]Orestis Papadigenopoulos, Constantine Caramanis:
Recurrent Submodular Welfare and Matroid Blocking Bandits. CoRR abs/2102.00321 (2021) - [i9]Constantine Caramanis, Matthew Faw, Orestis Papadigenopoulos, Emmanouil Pountourakis:
Single-Sample Prophet Inequalities Revisited. CoRR abs/2103.13089 (2021) - [i8]Alexia Atsidakou, Orestis Papadigenopoulos, Soumya Basu, Constantine Caramanis, Sanjay Shakkottai:
Combinatorial Blocking Bandits with Stochastic Delays. CoRR abs/2105.10625 (2021) - [i7]Constantine Caramanis, Paul Dütting, Matthew Faw, Federico Fusco, Philip Lazos, Stefano Leonardi, Orestis Papadigenopoulos, Emmanouil Pountourakis, Rebecca Reiffenhäuser:
Single-Sample Prophet Inequalities via Greedy-Ordered Selection. CoRR abs/2111.03174 (2021) - [i6]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Assigning and Scheduling Generalized Malleable Jobs under Submodular Processing Speeds. CoRR abs/2111.06225 (2021) - [i5]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
A Constant-Factor Approximation for Generalized Malleable Scheduling under M♮-Concave Processing Speeds. CoRR abs/2111.06733 (2021) - 2020
- [j1]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois:
Scheduling MapReduce Jobs on Identical and Unrelated Processors. Theory Comput. Syst. 64(5): 754-782 (2020) - [i4]Soumya Basu, Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai:
Contextual Blocking Bandits. CoRR abs/2003.03426 (2020)
2010 – 2019
- 2019
- [c3]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable Scheduling Beyond Identical Machines. APPROX-RANDOM 2019: 17:1-17:14 - [i3]Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos:
Malleable scheduling beyond identical machines. CoRR abs/1903.11016 (2019) - 2018
- [i2]Ali Khodabakhsh, Orestis Papadigenopoulos, Jannik Matuschke, Jimmy Horn, Evdokia Nikolova, Emmanouil Pountourakis:
Electric Vehicle Valet. CoRR abs/1811.06184 (2018) - 2016
- [c2]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois:
Scheduling MapReduce Jobs Under Multi-round Precedences. Euro-Par 2016: 209-222 - [i1]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Vasilis Vassalos, Georgios Zois:
Scheduling MapReduce Jobs under Multi-Round Precedences. CoRR abs/1602.05263 (2016) - 2015
- [c1]Dimitris Fotakis, Ioannis Milis, Orestis Papadigenopoulos, Emmanouil Zampetakis, Georgios Zois:
Scheduling MapReduce Jobs and Data Shuffle on Unrelated Processors. SEA 2015: 137-150
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-03 21:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
