default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNitish Korula
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Maxime C. Cohen
, Antoine Désir, Nitish Korula, Balasubramanian Sivan:
Best of Both Worlds Ad Contracts: Guaranteed Allocation and Price with Programmatic Efficiency. Manag. Sci. 69(7): 4027-4050 (2023)
2010 – 2019
- 2018
- [j11]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. SIAM J. Comput. 47(3): 1056-1086 (2018) - [j10]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. ACM Trans. Economics and Comput. 6(3-4): 14:1-14:23 (2018) - 2017
- [i12]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. CoRR abs/1711.05764 (2017) - [i11]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. CoRR abs/1712.05450 (2017) - 2016
- [j9]Nitish Korula, Vahab S. Mirrokni, Hamid Nazerzadeh:
Optimizing Display Advertising Markets: Challenges and Directions. IEEE Internet Comput. 20(1): 28-35 (2016) - [j8]Nikhil R. Devanur, Zhiyi Huang, Nitish Korula, Vahab S. Mirrokni, Qiqi Yan:
Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders. ACM Trans. Economics and Comput. 4(3): 14:1-14:20 (2016) - [c19]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Bi-Objective Online Matching and Submodular Allocations. NIPS 2016: 2739-2747 - [c18]Christopher J. Riederer, Yunsung Kim, Augustin Chaintreau, Nitish Korula, Silvio Lattanzi:
Linking Users Across Domains with Location Data: Theory and Validation. WWW 2016: 707-719 - [r1]Nitish Korula:
Orienteering Problems. Encyclopedia of Algorithms 2016: 1481-1484 - 2015
- [j7]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. Algorithmica 72(2): 493-514 (2015) - [c17]Hossein Esfandiari, Nitish Korula, Vahab S. Mirrokni:
Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models. EC 2015: 169-186 - [c16]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. STOC 2015: 889-898 - 2014
- [j6]Nitish Korula, Silvio Lattanzi:
An efficient reconciliation algorithm for social networks. Proc. VLDB Endow. 7(5): 377-388 (2014) - [j5]Chandra Chekuri, Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests. SIAM J. Discret. Math. 28(2): 577-597 (2014) - [c15]Avner May, Augustin Chaintreau, Nitish Korula, Silvio Lattanzi:
Filter & follow: how social media foster content curation. SIGMETRICS 2014: 43-55 - [c14]Anand Bhalgat, Nitish Korula, Hennadiy Leontyev, Max Lin, Vahab S. Mirrokni:
Partner tiering in display advertising. WSDM 2014: 133-142 - 2013
- [c13]Nikhil R. Devanur, Zhiyi Huang, Nitish Korula, Vahab S. Mirrokni, Qiqi Yan:
Whole-page optimization and submodular welfare maximization with online bidders. EC 2013: 305-322 - [c12]Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam:
Bicriteria Online Matching: Maximizing Weight and Cardinality. WINE 2013: 305-318 - [i10]Alina Ene, Nitish Korula, Ali Vakilian:
Improved Approximation Algorithms for Connected Domatic Partitions and Related Problems. CoRR abs/1305.4308 (2013) - [i9]Nitish Korula, Silvio Lattanzi:
An efficient reconciliation algorithm for social networks. CoRR abs/1307.1690 (2013) - 2012
- [j4]Chandra Chekuri, Nitish Korula:
Pruning 2-Connected Graphs. Algorithmica 62(1-2): 436-463 (2012) - [j3]Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher J. Stocker, Jennifer Vandenbussche, Douglas B. West:
Overlap number of graphs. J. Graph Theory 70(1): 10-28 (2012) - [j2]Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. ACM Trans. Algorithms 8(3): 23:1-23:27 (2012) - [j1]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan:
Solving Packing Integer Programs via Randomized Rounding with Alterations. Theory Comput. 8(1): 533-565 (2012) - 2011
- [c11]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. IPCO 2011: 78-91 - [c10]MohammadHossein Bateni, Chandra Chekuri, Alina Ene, Mohammad Taghi Hajiaghayi, Nitish Korula, Dániel Marx:
Prize-collecting Steiner Problems on Planar Graphs. SODA 2011: 1028-1049 - 2010
- [b1]Nitish Korula:
Approximation Algorithms for Network Design and Orienteering. University of Illinois Urbana-Champaign, USA, 2010 - [c9]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Packing Applied to Display Ad Allocation. ESA (1) 2010: 182-194 - [c8]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan:
On k-Column Sparse Packing Programs. IPCO 2010: 369-382 - [i8]Jon Feldman, Monika Henzinger, Nitish Korula, Vahab S. Mirrokni, Clifford Stein:
Online Stochastic Ad Allocation: Efficiency and Fairness. CoRR abs/1001.5076 (2010) - [i7]Chandra Chekuri, Alina Ene, Nitish Korula:
Prize-Collecting Steiner Tree and Forest in Planar Graphs. CoRR abs/1006.4357 (2010) - [i6]Deeparnab Chakrabarty, Chandra Chekuri, Sanjeev Khanna, Nitish Korula:
Approximability of Capacitated Network Design. CoRR abs/1009.5734 (2010)
2000 – 2009
- 2009
- [c7]Chandra Chekuri, Alina Ene, Nitish Korula:
Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs. APPROX-RANDOM 2009: 42-55 - [c6]Chandra Chekuri, Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Applications. ICALP (1) 2009: 254-265 - [c5]Nitish Korula, Martin Pál:
Algorithms for Secretary Problems on Graphs and Hypergraphs. ICALP (2) 2009: 508-520 - [c4]Jon Feldman, Nitish Korula, Vahab S. Mirrokni, S. Muthukrishnan, Martin Pál:
Online Ad Assignment with Free Disposal. WINE 2009: 374-385 - [i5]Chandra Chekuri, Nitish Korula:
A Graph Reduction Step Preserving Element-Connectivity and Applications. CoRR abs/0902.2795 (2009) - [i4]Nikhil Bansal, Nitish Korula, Viswanath Nagarajan:
On k-Column Sparse Packing Programs. CoRR abs/0908.2256 (2009) - 2008
- [c3]Chandra Chekuri, Nitish Korula:
Pruning 2-Connected Graphs. FSTTCS 2008: 119-130 - [c2]Chandra Chekuri, Nitish Korula:
Single-Sink Network Design with Vertex Connectivity Requirements. FSTTCS 2008: 131-142 - [c1]Chandra Chekuri, Nitish Korula, Martin Pál:
Improved algorithms for orienteering and related problems. SODA 2008: 661-670 - [i3]Chandra Chekuri, Nitish Korula:
Min-Cost 2-Connected Subgraphs With k Terminals. CoRR abs/0802.2528 (2008) - [i2]Nitish Korula, Martin Pal:
Algorithms for Secretary Problems on Graphs and Hypergraphs. CoRR abs/0807.1139 (2008) - 2007
- [i1]Chandra Chekuri, Nitish Korula:
Approximation Algorithms for Orienteering with Time Windows. CoRR abs/0711.4825 (2007)
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-21 00:16 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:
