default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnand Bhalgat
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[c15]Anand Bhalgat, Sanjeev Khanna:
A Utility Equivalence Theorem for Concave Functions. IPCO 2014: 126-137- [c14]Anand Bhalgat, Nitish Korula, Hennadiy Leontyev, Max Lin, Vahab S. Mirrokni:
Partner tiering in display advertising. WSDM 2014: 133-142 - 2013
- [c13]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala
:
Optimal auctions via the multiplicative weight method. EC 2013: 73-90 - 2012
- [c12]Anand Bhalgat, Jon Feldman, Vahab S. Mirrokni:
Online allocation of display ads with smooth delivery. KDD 2012: 1213-1221 - [c11]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala:
Mechanisms and allocations with positive network externalities. EC 2012: 179-196 - [c10]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Mechanism Design for a Risk Averse Seller. WINE 2012: 198-211 - [c9]Anand Bhalgat, Sreenivas Gollapudi:
Ad Allocation for Browse Sessions. WINE 2012: 475-481 - [i4]Anand Bhalgat, Sreenivas Gollapudi, Kamesh Munagala:
Optimal Auctions via the Multiplicative Weight Method. CoRR abs/1211.1699 (2012) - 2011
- [c8]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs. APPROX-RANDOM 2011: 75-86 - [c7]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Social Welfare in One-Sided Matching Markets without Money. APPROX-RANDOM 2011: 87-98 - [c6]Anand Bhalgat, Ashish Goel, Sanjeev Khanna:
Improved Approximation Results for Stochastic Knapsack Problems. SODA 2011: 1647-1665 - [i3]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Social Welfare in One-sided Matching Markets without Money. CoRR abs/1104.2964 (2011) - [i2]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Mechanism Design with Risk Aversion. CoRR abs/1107.4722 (2011) - 2010
- [c5]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games. EC 2010: 73-82 - [i1]Anand Bhalgat, Deeparnab Chakrabarty, Sanjeev Khanna:
Optimal Lower Bounds for Universal and Differentially Private Steiner Tree and TSP. CoRR abs/1011.3770 (2010)
2000 – 2009
- 2009
- [c4]Anand Bhalgat, Ramesh Hariharan:
Fast edge orientation for unweighted graphs. SODA 2009: 265-272 - [c3]Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna:
Nash Dynamics in Congestion Games with Similar Resources. WINE 2009: 362-373 - 2008
- [c2]Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi:
Fast edge splitting and Edmonds' arborescence construction for unweighted graphs. SODA 2008: 455-464 - 2007
- [c1]Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi, Anand Bhalgat:
An Õ(mn) Gomory-Hu tree construction algorithm for unweighted graphs. STOC 2007: 605-614
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 12:50 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:
