default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEklavya Sharma
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Hannaneh Akrami
, Jugal Garg, Eklavya Sharma, Setareh Taki:
Improving Approximation Guarantees for Maximin Share. EC 2024: 198- [i11]Jugal Garg, Eklavya Sharma:
Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm. CoRR abs/2410.08986 (2024) - [i10]Jugal Garg, Eklavya Sharma:
EF1 for Mixed Manna with Unequal Entitlements. CoRR abs/2410.12966 (2024) - 2023
- [j1]Arindam Khan, Eklavya Sharma:
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. Algorithmica 85(9): 2735-2778 (2023) - [c7]Aniket Murhekar, Eklavya Sharma:
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. FSTTCS 2023: 18:1-18:17 - [c6]Hannaneh Akrami, Jugal Garg, Eklavya Sharma, Setareh Taki:
Simplification and Improvement of MMS Approximation. IJCAI 2023: 2485-2493 - [c5]Ioannis Caragiannis, Jugal Garg, Nidhi Rathi, Eklavya Sharma, Giovanna Varricchio:
New Fairness Concepts for Allocating Indivisible Items. IJCAI 2023: 2554-2562 - [i9]Hannaneh Akrami, Jugal Garg, Eklavya Sharma, Setareh Taki:
Simplification and Improvement of MMS Approximation. CoRR abs/2303.16788 (2023) - [i8]Aniket Murhekar, Eklavya Sharma:
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. CoRR abs/2309.15870 (2023) - 2022
- [c4]Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. FSTTCS 2022: 23:1-23:22 - [i7]Jugal Garg, Eklavya Sharma:
Existence and Computation of Epistemic EFX. CoRR abs/2206.01710 (2022) - 2021
- [c3]Arindam Khan, Eklavya Sharma:
Tight Approximation Algorithms For Geometric Bin Packing with Skewed Items. APPROX-RANDOM 2021: 22:1-22:23 - [c2]Eklavya Sharma:
Harmonic Algorithms for Packing d-Dimensional Cuboids into Bins. FSTTCS 2021: 32:1-32:22 - [i6]Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Approximation Algorithms for Generalized Multidimensional Knapsack. CoRR abs/2102.05854 (2021) - [i5]Arindam Khan, Eklavya Sharma:
Tight Approximation Algorithms for Geometric Bin Packing with Skewed Items. CoRR abs/2105.02827 (2021) - [i4]Arindam Khan, Eklavya Sharma, K. V. N. Sreenivas:
Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing. CoRR abs/2106.13951 (2021) - 2020
- [i3]Eklavya Sharma:
Harmonic algorithms for packing d-dimensional cuboids into bins. CoRR abs/2011.10963 (2020) - [i2]Eklavya Sharma:
An Approximation Algorithm for Covering Linear Programs and its Application to Bin-Packing. CoRR abs/2011.11268 (2020) - [i1]Eklavya Sharma:
Analysis of the Harmonic Function Used in Bin-Packing. CoRR abs/2011.11618 (2020)
2010 – 2019
- 2018
- [c1]Vishal Gupta, Eklavya Sharma:
Mitigating DNS Amplification Attacks Using a Set of Geographically Distributed SDN Routers. ICACCI 2018: 392-400
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 2025-01-09 13:26 CET 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:
