Robbie Weber

Contact: rtweber2 [at] cs [dot] washington [dot] edu

I'm a fourth-year graduate student in the Theory Group at the Paul G. Allen School of Computer Science & Engineering at the University of Washington. I'm interested broadly in algorithm design for graph problems and combinatorial questions. I'm advised by Shayan Oveis Gharan and Anna Karlin.

My CV is available here.

Publications and Pre-prints

A Simply Exponential Upper Bound on the Number of the Maximum Number of Stable Matchings
With Anna Karlin and Shayan Oveis Gharan
STOC 2018
Arxiv version STOC version STOC talk video STOC slides (pdf)

Embedded-width: A variant of treewidth for plane graphs
With Glencora Borradaile, Jeff Erickson, and Hung Le
Arxiv version

Talk Notes

Every week the theory group has a talk where a group member describes a (hopefully) cute and interesting result over lunch. Notes from some of my talks are below. Trying to fit the contents of these notes into the 30 minute time slot is still an open problem.
Designing Better (Sports) Tournaments
Stable Matchings With Couples
Perfect Graphs Part 1: The Weak Perfect Graph Theorem


In Summer 2018, I was the instructor for CSE 332 (Data Structures and Parallelism).

I've been a TA for the following courses:

at Washington
CSE 373 (Non-major) Data Structures, Spring 2018 and Autumn 2018
CSE 421 (Undergraduate) Algorithms, Winter 2018
CSE 521 (Graduate) Algorithms, Winter 2017
CSE 417 (Non Major) Algorithms, Winter 2016
CSE 311 Foundations of Computing I, Autumn 2015

At Illinois
CS 374 Algorithms and Models of Computation, Spring 2015
CS 173 Discrete Mathematics, Spring 2013-Fall 2014 (4 semesters)
CS 125 Intro to Computer Science, Spring 2012-Fall 2012 (2 semesters)


When I'm not teaching computer science or staring at a whiteboard, I love to watch college sports. Particularly when Dubs is at the game.