default search action
Chinmay Karande
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [c8]Chinmay Karande, Aranyak Mehta, Ramakrishnan Srikant:
Optimizing budget constrained spend in search advertising. WSDM 2013: 697-706 - 2011
- [c7]Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta:
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. SODA 2011: 1253-1264 - [c6]Chinmay Karande, Aranyak Mehta, Pushkar Tripathi:
Online bipartite matching with unknown distributions. STOC 2011: 587-596 - 2010
- [b1]Chinmay Karande:
Algorithms and mechanism design for multi-agent systems. Georgia Institute of Technology, Atlanta, GA, USA, 2010 - [j4]Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang:
Approximability of combinatorial problems with multi-agent submodular cost functions. SIGecom Exch. 9(1): 8 (2010) - [c5]Gagan Goel, Chinmay Karande, Lei Wang:
Single-Parameter Combinatorial Auctions with Partially Public Valuations. SAGT 2010: 234-245 - [c4]Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande:
Market Equilibrium with Transaction Costs. WINE 2010: 496-504 - [i5]Sourav Chakraborty, Nikhil R. Devanur, Chinmay Karande:
Market Equilibrium with Transaction Costs. CoRR abs/1001.0393 (2010) - [i4]Gagan Aggarwal, Gagan Goel, Chinmay Karande, Aranyak Mehta:
Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations. CoRR abs/1007.1271 (2010) - [i3]Gagan Goel, Chinmay Karande, Lei Wang:
Single Parameter Combinatorial Auctions with Partially Public Valuations. CoRR abs/1007.3539 (2010)
2000 – 2009
- 2009
- [j3]Chinmay Karande, Kumar Chellapilla, Reid Andersen:
Speeding Up Algorithms on Compressed Web Graphs. Internet Math. 6(3): 373-398 (2009) - [c3]Gagan Goel, Chinmay Karande, Pushkar Tripathi, Lei Wang:
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions. FOCS 2009: 755-764 - [c2]Chinmay Karande, Kumar Chellapilla, Reid Andersen:
Speeding up algorithms on compressed web graphs. WSDM 2009: 272-281 - [i2]Chinmay Karande:
Polynomially Correlated Knapsack is NP-complete. CoRR abs/0910.2649 (2009) - [i1]Deeparnab Chakrabarty, Chinmay Karande, Ashish Sangwan:
The Effect of Malice on the Social Optimum in Linear Load Balancing Games. CoRR abs/0910.2655 (2009) - 2008
- [j2]Frédéric Cazals
, Chinmay Karande:
A note on the problem of reporting maximal cliques. Theor. Comput. Sci. 407(1-3): 564-568 (2008) - 2007
- [c1]Chinmay Karande, Nikhil R. Devanur:
Computing Market Equilibrium: Beyond Weak Gross Substitutes. WINE 2007: 368-373 - 2005
- [j1]Frédéric Cazals
An algorithm for reporting maximal c-cliques. Theor. Comput. Sci. 349(3): 484-490 (2005)
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-04-30 20:49 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: