default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonidas Tsepenekas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c12]Sanjay Kariyappa, Leonidas Tsepenekas, Freddy Lécué, Daniele Magazzeni:
SHAP@k: Efficient and Probably Approximately Correct (PAC) Identification of Top-K Features. AAAI 2024: 13068-13075- 2023
- [j1]George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
:
Deploying vaccine distribution sites for improved accessibility and equity to support pandemic response. Auton. Agents Multi Agent Syst. 37(2): 31 (2023) - [c11]Da Qi Chen, Ann Li, George Z. Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Efficient and Equitable Deployment of Mobile Vaccine Distribution Centers. IJCAI 2023: 64-72 - [c10]Leonidas Tsepenekas, Ivan Brugere, Freddy Lécué, Daniele Magazzeni:
Comparing Apples to Oranges: Learning Similarity Functions for Data Produced by Different Distributions. NeurIPS 2023 - [i11]Sanjay Kariyappa, Leonidas Tsepenekas, Freddy Lécué, Daniele Magazzeni:
SHAP@k: Efficient and Probably Approximately Correct (PAC) Identification of Top-k Features. CoRR abs/2307.04850 (2023) - 2022
- [c9]Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Fair Disaster Containment via Graph-Cut Problems. AISTATS 2022: 6321-6333 - [c8]Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas:
A New Notion of Individually Fair Clustering: α-Equitable k-Center. AISTATS 2022: 6387-6408 - [c7]Amy E. Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. AISTATS 2022: 11641-11654 - [c6]George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. AAMAS 2022: 789-797 - [i10]George Z. Li, Ann Li, Madhav V. Marathe, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Deploying Vaccine Distribution Sites for Improved Accessibility and Equity to Support Pandemic Response. CoRR abs/2202.04705 (2022) - [i9]Amy Babay, Michael Dinitz, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Controlling Epidemic Spread using Probabilistic Diffusion Models on Networks. CoRR abs/2202.08296 (2022) - [i8]Leonidas Tsepenekas, Ivan Brugere:
Comparing Apples to Oranges: Learning Similarity Functions for Data Produced by Different Distributions. CoRR abs/2208.12731 (2022) - 2021
- [c5]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas:
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. AAAI 2021: 6822-6830 - [c4]Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximating Two-Stage Stochastic Supplier Problems. APPROX-RANDOM 2021: 23:1-23:22 - [i7]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Aravind Srinivasan, Leonidas Tsepenekas:
Fairness, Semi-Supervised Learning, and More: A General Framework for Clustering with Stochastic Pairwise Constraints. CoRR abs/2103.02013 (2021) - [i6]Darshan Chakrabarti, John P. Dickerson, Seyed A. Esmaeili, Aravind Srinivasan, Leonidas Tsepenekas:
A New Notion of Individually Fair Clustering: α-Equitable k-Center. CoRR abs/2106.05423 (2021) - [i5]Amy Babay, Michael Dinitz, Prathyush Sambaturu, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Fair Disaster Containment via Graph-Cut Problems. CoRR abs/2106.05424 (2021) - 2020
- [c3]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas:
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. ICML 2020: 1178-1189 - [c2]Seyed A. Esmaeili, Brian Brubach, Leonidas Tsepenekas, John Dickerson:
Probabilistic Fair Clustering. NeurIPS 2020 - [i4]Seyed A. Esmaeili, Brian Brubach, Leonidas Tsepenekas, John P. Dickerson:
Probabilistic Fair Clustering. CoRR abs/2006.10916 (2020) - [i3]Brian Brubach, Darshan Chakrabarti, John P. Dickerson, Samir Khuller, Aravind Srinivasan, Leonidas Tsepenekas:
A Pairwise Fair and Community-preserving Approach to k-Center Clustering. CoRR abs/2007.07384 (2020) - [i2]Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti:
Approximation Algorithms for Radius-Based, Two-Stage Stochastic Clustering Problems with Budget Constraints. CoRR abs/2008.03325 (2020)
2010 – 2019
- 2019
- [c1]Pan Xu, Yexuan Shi, Hao Cheng, John P. Dickerson, Karthik Abinav Sankararaman, Aravind Srinivasan, Yongxin Tong, Leonidas Tsepenekas:
A Unified Approach to Online Matching with Conflict-Aware Constraints. AAAI 2019: 2221-2228 - 2016
- [i1]Timotheos Aslanidis, Leonidas Tsepenekas:
Message Routing in Wireless and Mobile Networks using TDMA Technology. CoRR abs/1607.00604 (2016)
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-05-08 21:43 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:
