Community Operations Research

• Identifying entitlement to share in a class action settlement, 2007 Harvey Mudd College Mathematics Conference on Public Sector Operations Research (Poster).
  [Co-author: S. E. Pav]

Combinatorial Optimization

• Maximum matchings in regular graphs of high girth, Electronic Journal of Combinatorics 14 (1) (2007) N1.
  [Co-author: S. Hoory]
• On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem, Combinatorics, Probability, and Computing 16 (2007) 713-732.
  [Co-authors: A. M. Frieze and J. Vera]
  Slides from my talk at STOC 2005
• On permutation sums, unpublished manuscript.
  [Co-authors: D. Coppersmith and C. Smythe]
• On the random 2-stage minimum spanning tree, Random Structures and Algorithms, 28 (1) (2006) 24-36.
  [Co-authors: A. Freize and M. Krivelevich]
  Slides from my post-doc 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) 878-886.
  [Co-authors: U. Feige, J. D. Hartline, R. Kleinberg]
  Slides from a one hour talk
• 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) 441-449 (see also journal version above).
  [Co-authors: A. M. Frieze and J. Vera]
  Slides from my talk at STOC 2005
• On the random 2-stage minimum spanning tree, Proc. of the 16th Symposium on Discrete Algorithms (SODA) (2005) 287-292 (see also journal version above).
  [Co-authors: A. Freize and M. Krivelevich]
  Slides from my post-doc job talk on medium density subset sum and random minimum spanning trees
  [bibtex]
• Solving medium density subset sum problems in expected polynomial time, Proc. of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS) (2005) 305-314.
  [Co-author: B. Przydatek]
  Slides from my post-doc job talk on medium density subset sum and random minimum spanning trees
  [bibtex]
• Strings with maximum numbers of distinct subsequences and substrings, Electronic Journal of Combinatorics 11 (1) (2004), R8.
  [Co-authors: A. Harrow and G. Sorkin]
  [bibtex]