default search action
Vishnu V. Narayan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Yakov Babichenko
, Michal Feldman
Fair Division via Quantile Shares. STOC 2024: 1235-1246 - 2023
- [j5]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye
The speed and threshold of the biased perfect matching and Hamilton cycle games. Discret. Appl. Math. 332: 23-40 (2023) - [c8]Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. AAMAS 2023: 2863-2865 - [i10]Siddharth Barman, Vishnu V. Narayan, Paritosh Verma:
Fair Chore Division under Binary Supermodular Costs. CoRR abs/2302.11530 (2023) - [i9]Michal Feldman, Simon Mauras, Vishnu V. Narayan, Tomasz Ponitka:
Breaking the Envy Cycle: Best-of-Both-Worlds Guarantees for Subadditive Valuations. CoRR abs/2304.03706 (2023) - [i8]Yakov Babichenko, Michal Feldman, Ron Holzman, Vishnu V. Narayan:
Fair Division via Quantile Shares. CoRR abs/2312.01874 (2023) - 2022
- [j4]Yaqiao Li
Online Coloring and a New Type of Adversary for Online Graph Problems. Algorithmica 84(5): 1232-1251 (2022) - [j3]Vishnu V. Narayan, Enguerrand Prebet
The Declining Price Anomaly Is Not Universal in Multi-Buyer Sequential Auctions (but almost is). Theory Comput. Syst. 66(3): 546-580 (2022) - [j2]Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. Theory Comput. Syst. 66(3): 581-615 (2022) - 2021
- [c7]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Perfect Matching Game. LAGOS 2021: 190-199 - [c6]Noah Brüstle, Sarah Clusiau, Vishnu V. Narayan, Ndiamé Ndiaye, Bruce A. Reed, Ben Seamone:
The Speed and Threshold of the Biased Hamilton Cycle Game. LAGOS 2021: 200-211 - [c5]Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta:
Two Birds with One Stone: Fairness and Welfare via Transfers. SAGT 2021: 376-390 - [i7]Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta:
Two Birds With One Stone: Fairness and Welfare via Transfers. CoRR abs/2106.00841 (2021) - [i6]Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. CoRR abs/2111.14654 (2021) - 2020
- [j1]Joe Cheriyan
The matching augmentation problem: a $\frac{7}{4}$-approximation algorithm. Math. Program. 182(1): 315-354 (2020) - [c4]Johannes Brustle, Jack Dippel
One Dollar Each Eliminates Envy. EC 2020: 23-39 - [c3]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. WAOA 2020: 47-62 - [i5]Yaqiao Li, Vishnu V. Narayan, Denis Pankratov:
Online Coloring and a New Type of Adversary for Online Graph Problems. CoRR abs/2005.10852 (2020)
2010 – 2019
- 2019
- [c2]Vishnu V. Narayan, Enguerrand Prebet
The Declining Price Anomaly Is Not Universal in Multi-buyer Sequential Auctions (But Almost Is). SAGT 2019: 109-122 - [c1]Vishnu V. Narayan, Gautam Rayaprolu, Adrian Vetta:
Risk-Free Bidding in Complement-Free Combinatorial Auctions. SAGT 2019: 123-136 - [i4]Vishnu V. Narayan, Enguerrand Prebet, Adrian Vetta:
The Declining Price Anomaly is not Universal in Multi-Buyer Sequential Auctions (but almost is). CoRR abs/1905.00853 (2019) - [i3]Johannes Brustle, Jack Dippel, Vishnu V. Narayan, Mashbat Suzuki, Adrian Vetta:
One Dollar Each Eliminates Envy. CoRR abs/1912.02797 (2019) - 2018
- [i2]Joe Cheriyan, Jack Dippel, Fabrizio Grandoni, Arindam Khan, Vishnu V. Narayan:
The Matching Augmentation Problem: A 7/4-Approximation Algorithm. CoRR abs/1810.07816 (2018) - 2016
- [i1]Vishnu V. Narayan:
A 17/12-approximation algorithm for 2-vertex-connected spanning subgraphs on graphs with minimum degree at least 3. CoRR abs/1612.04790 (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-06-19 21:03 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: