Community Operations Research
Combinatorial Optimization

Tracking the random surfer: Empirically measured teleportation parameters in PageRank, Proceedings of the 19th international conference on World wide web (WWW) (2010), 381390.
[Coauthors: P. Constantine, D. Gleich, A. Gunawardana]

Clustering with shallow trees, Journal of Statistical Mechanics: Theory and Experiment (JSTAT) P12010.
[Coauthors: M. BaillyBechet, S. Bradde, A. Braunstein, L. Foini, R. Zecchina]

Maximum matchings in regular graphs of high girth, Electronic Journal of Combinatorics 14 (1) (2007) N1.
[Coauthor: S. Hoory]

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem, Combinatorics, Probability, and Computing 16 (2007) 713732.
[Coauthors: A. M. Frieze and J. Vera]
Slides from my talk at STOC 2005

On permutation sums, unpublished manuscript.
[Coauthors: D. Coppersmith and C. Smythe]

On the random 2stage minimum spanning tree, Random Structures and Algorithms, 28 (1) (2006) 2436.
[Coauthors: A. Freize and M. Krivelevich]
Slides from my postdoc job talk on medium density subset sum and random minimum spanning trees
[bibtex]

On the competitive ratio of the random sampling auction, Proc. of the 1st International Workshop on Internet and Network Economics (WINE) (2005) 878886.
[Coauthors: U. Feige, J. D. Hartline, R. Kleinberg]
Slides from a one hour talk

Solving medium density subset sum problems in expected polynomial time, Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (2005) 305314.
[Coauthor: B. Przydatek]
Slides from my postdoc job talk on medium density subset sum and random minimum spanning trees
[bibtex]

On the random 2stage minimum spanning tree, Proc. of the 16th Symposium on Discrete Algorithms (SODA) (2005) 287292 (see also journal version above).
[Coauthors: A. Freize and M. Krivelevich]
Slides from my postdoc job talk on medium density subset sum and random minimum spanning trees
[bibtex]

On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem, Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC) (2005) 441449 (see also journal version above).
[Coauthors: A. M. Frieze and J. Vera]
Slides from my talk at STOC 2005

Strings with maximum numbers of distinct subsequences and substrings, Electronic Journal of Combinatorics 11 (1) (2004), R8.
[Coauthors: A. Harrow and G. Sorkin]
[bibtex]