Julia Chuzhoy's Talks

• A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs.
  A video of an informal talk at Research at TTIC seminar, 2022.
  
  
• Almost Polynomial Hardness for Node-Disjoint Paths in Grids.
  Talk at TCS+, Dec. 2018.
  slides, video.



• Some Graph Minor Theory and its Uses in Algorithms.
  Tutorial at Theory Fest / STOC,
  Montreal, June 2017.
  slides



• Graph Routing Problems: Approximation, Hardness, and Graph-Theoretic Insights.
  Tutte's 100th Distinguished Lecture Series,
  University of Waterloo, May 2017.
  slides; video
  
  
• New Hardness Results for Routing on Disjoint Paths.
  Simons Symposium on Approximation Algorithms, Apr 2017.
  slides
  
  
• Polynomial Bounds for the Grid-Minor Theorem.
  • A detailed presentation of the proof with my voiceover: Part 1, Part 2, Part 3.1, Part 3.2, Part 4, Part 5.
  • A less detailed presentation: slides and video (interactive; static) of the talk at the Workshop on Flexible Network Design,
    Fields Institute, Toronto, July 2013.
  
  
• Approximation Algorithms for Graph Routing Problems.
  Approx and Random 2012 invited talk, Aug. 2012.
  slides
  
  
• Routing in Undirected Graphs with Constant Congestion.
  BIRS workshop on approximation algorithms and hardness of approximation, Nov 2011.
  slides; video
  
  
• On Allocating Goods to Maximize Fairness, 2009.
  
  
  

back to my homepage