Selected Talks

  • Directed width parameters: algorithms and structural properties
               - DIMACS Fall 2012 Mixer, DIMACS Center, Rutgers University, October 11, 2012
               - Princeton Discrete Math Seminar, Princeton University, October 18, 2012
  • Realizable Paths and the NL vs L Problem
               - Theory Group Seminar, Princeton University, Dec 9, 2011.
               - Algorithms and Computational Theory Group, University of Texas at Austin, May 12, 2011.
               - Theory Group, IBM Almaden Research Center, San Jose, California, August 11, 2010.
  • Games, Equilibrium and the complexity class PPAD
    Cowles Foundation for Research in Economics, Yale University, November 12, 2009.
  • Complexity of Scarf's Lemma and Related Problems
    ACO Student Seminar, Georgia Institute of Technology, March 4, 2009.
  • A Distributed Protocol for Fractional Stable Paths Problem
    DIMACS/DyDAnWorkshop on Secure Internet Routing, Rutgers University, March 24-26, 2008.
  • Approximating Betweenness Centrality
    5th Workshop on Algorithms and Models for the Web-Graph (WAW 2007), San Diego, CA, December 11-12, 2007.