default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChinmay Sonar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2023
[b1]Chinmay Sonar:
Algorithmic Problems in Committee Selection. University of California, Santa Barbara, USA, 2023
Conference and Workshop Papers
- 2024
- [c9]Úrsula Hébert-Johnson, Daniel Lokshtanov, Chinmay Sonar, Vaishali Surianarayanan:
Parameterized Complexity of Kidney Exchange Revisited. IJCAI 2024: 76-84 - 2023
- [c8]Vaishnavi Himakunthala, Andy Ouyang, Daniel Rose, Ryan He, Alex Mei, Yujie Lu, Chinmay Sonar, Michael Saxon, William Yang Wang:
Let's Think Frame by Frame with VIP: A Video Infilling and Prediction Dataset for Evaluating Video Chain-of-Thought. EMNLP 2023: 204-219 - [c7]Chinmay Sonar, Subhash Suri, Jie Xue:
Fault Tolerance in Euclidean Committee Selection. ESA 2023: 95:1-95:14 - 2022
- [c6]Chinmay Sonar, Subhash Suri, Jie Xue:
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. IJCAI 2022: 475-481 - 2021
- [c5]Úrsula Hébert-Johnson, Chinmay Sonar, Subhash Suri, Vaishali Surianarayanan
:
Anonymity-Preserving Space Partitions. ISAAC 2021: 32:1-32:16 - 2020
- [c4]Daniel Lokshtanov, Chinmay Sonar, Subhash Suri, Jie Xue:
Fair Covering of Points by Balls. CCCG 2020: 26-32 - [c3]Chinmay Sonar, Palash Dey, Neeldhara Misra:
On the Complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. IJCAI 2020: 89-95 - 2019
- [c2]Neeldhara Misra, Chinmay Sonar:
Robustness Radius for Chamberlin-Courant on Restricted Domains. SOFSEM 2019: 341-353 - 2017
- [c1]Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan:
On the Complexity of Chamberlin-Courant on Almost Structured Profiles. ADT 2017: 124-138
Informal and Other Publications
- 2023
- [i6]Daniel Rose, Vaishnavi Himakunthala, Andy Ouyang, Ryan He, Alex Mei, Yujie Lu, Michael Saxon, Chinmay Sonar, Diba Mirza, William Yang Wang:
Visual Chain of Thought: Bridging Logical Gaps with Multimodal Infillings. CoRR abs/2305.02317 (2023) - [i5]Vaishnavi Himakunthala, Andy Ouyang, Daniel Rose, Ryan He, Alex Mei, Yujie Lu, Chinmay Sonar, Michael Saxon, William Yang Wang:
Let's Think Frame by Frame: Evaluating Video Chain of Thought with Video Infilling and Prediction. CoRR abs/2305.13903 (2023) - [i4]Chinmay Sonar, Subhash Suri, Jie Xue:
Fault Tolerance in Euclidean Committee Selection. CoRR abs/2308.07268 (2023) - 2022
- [i3]Chinmay Sonar, Subhash Suri, Jie Xue:
Multiwinner Elections under Minimax Chamberlin-Courant Rule in Euclidean Space. CoRR abs/2205.13598 (2022) - 2021
- [i2]Neeldhara Misra, Chinmay Sonar, P. R. Vaidyanathan, Rohit Vaish:
Equitable Division of a Path. CoRR abs/2101.09794 (2021) - 2020
- [i1]Chinmay Sonar, Palash Dey, Neeldhara Misra:
On the complexity of Winner Verification and Candidate Winner for Multiwinner Voting Rules. CoRR abs/2004.13933 (2020)
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-10-21 21:33 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:
