Nitish Korula

According to our database1, Nitish Korula authored at least 26 papers between 2008 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.
ACM Trans. Economics and Comput., 2018

2016
Orienteering Problems.
Encyclopedia of Algorithms, 2016

Optimizing Display Advertising Markets: Challenges and Directions.
IEEE Internet Computing, 2016

Linking Users Across Domains with Location Data: Theory and Validation.
Proceedings of the 25th International Conference on World Wide Web, 2016

Bi-Objective Online Matching and Submodular Allocations.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Online Allocation with Traffic Spikes: Mixing Adversarial and Stochastic Models.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
A Graph Reduction Step Preserving Element-Connectivity and Packing Steiner Trees and Forests.
SIAM J. Discrete Math., 2014

An efficient reconciliation algorithm for social networks.
PVLDB, 2014

Partner tiering in display advertising.
Proceedings of the Seventh ACM International Conference on Web Search and Data Mining, 2014

Filter & follow: how social media foster content curation.
Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2014

2013
Bicriteria Online Matching: Maximizing Weight and Cardinality.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Whole-page optimization and submodular welfare maximization with online bidders.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
Solving Packing Integer Programs via Randomized Rounding with Alterations.
Theory of Computing, 2012

Overlap number of graphs.
Journal of Graph Theory, 2012

2011
Prize-collecting Steiner Problems on Planar Graphs.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Approximability of Capacitated Network Design.
Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2010
On k-Column Sparse Packing Programs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Online Stochastic Packing Applied to Display Ad Allocation.
Proceedings of the Algorithms, 2010

2009
Online Ad Assignment with Free Disposal.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Algorithms for Secretary Problems on Graphs and Hypergraphs.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

A Graph Reduction Step Preserving Element-Connectivity and Applications.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs.
Proceedings of the Approximation, 2009

2008
Improved algorithms for orienteering and related problems.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Single-Sink Network Design with Vertex Connectivity Requirements.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Pruning 2-Connected Graphs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008


  Loading...