default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVijay Menon 0001
Person information
- affiliation: University of Waterlo, David R. Cheriton School of Computer Science, Canada
Other persons with the same name
- Vijay Menon — disambiguation page
- Vijay Menon 0002 (aka: Vijay S. Menon) — Intel Corporation, Santa Clara, CA, USA (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[b1]Vijay Menon:
Making Decisions with Incomplete and Inaccurate Information. University of Waterloo, Ontario, Canada, 2021- [c6]Hadi Hosseini, Vijay Menon, Nisarg Shah, Sujoy Sikdar:
Necessarily Optimal One-Sided Matchings. AAAI 2021: 5481-5488 - [c5]Thomas Ma, Vijay Menon, Kate Larson:
Improving Welfare in One-Sided Matchings using Simple Threshold Queries. IJCAI 2021: 321-327 - 2020
- [i8]Hadi Hosseini, Vijay Menon, Nisarg Shah, Sujoy Sikdar:
Learning Desirable Matchings From Partial Preferences. CoRR abs/2007.09079 (2020) - [i7]Vijay Menon, Kate Larson:
Algorithmic Stability in Fair Allocation of Indivisible Goods Among Two Agents. CoRR abs/2007.15203 (2020) - [i6]Thomas Ma, Vijay Menon, Kate Larson:
Improving Welfare in One-sided Matching using Simple Threshold Queries. CoRR abs/2011.13977 (2020)
2010 – 2019
- 2019
- [c4]Vijay Menon, Kate Larson
:
Mechanism Design for Locating a Facility Under Partial Information. SAGT 2019: 49-62 - [i5]Vijay Menon, Kate Larson:
Mechanism Design for Locating a Facility under Partial Information. CoRR abs/1905.09230 (2019) - 2018
- [c3]Vijay Menon, Kate Larson:
Robust and Approximately Stable Marriages Under Partial Information. WINE 2018: 341-355 - [i4]Vijay Menon, Kate Larson:
Robust and Approximately Stable Marriages under Partial Information. CoRR abs/1804.09156 (2018) - 2017
- [j1]Vijay Menon, Kate Larson:
Computational aspects of strategic behaviour in elections with top-truncated ballots. Auton. Agents Multi Agent Syst. 31(6): 1506-1547 (2017) - [c2]Vijay Menon, Kate Larson:
Deterministic, Strategyproof, and Fair Cake Cutting. IJCAI 2017: 352-358 - [i3]Vijay Menon, Kate Larson:
Deterministic, Strategyproof, and Fair Cake Cutting. CoRR abs/1705.06306 (2017) - 2016
- [c1]Vijay Menon, Kate Larson:
Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates. AAAI 2016: 565-571 - 2015
- [i2]Vijay Menon, Kate Larson:
Complexity of Manipulation in Elections with Partial Votes. CoRR abs/1505.05900 (2015) - [i1]Vijay Menon, Kate Larson:
Reinstating Combinatorial Protections for Manipulation and Bribery in Single-Peaked and Nearly Single-Peaked Electorates. CoRR abs/1511.08141 (2015)
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-10-30 21:33 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:
