# Talks

**Partitioning even-hole-free graphs into two chordal graphs**

Barbados Graph Theory Workshop, December 2022.

**Induced subgraphs and tree decompositions**

Dagstuhl Seminar, Vertex Partitioning in Graphs: From Structure to Algorithms

Schloss Dagstuhl, Germany, November 2022.

**Induced subgraphs and tree decompositions**

Stanford Combinatorics Seminar, Stanford, California, October 2022.

**Directly sampling connected graph partitions**

Graph theory and social choice seminar, October 2022.

**Bipartite Ramanujan Graphs**

Princeton Combinatorics Learning Seminar, October 2022.

**Induced subgraphs and tree decompositions**

British Combinatorial Conference, Lancaster U.K.,

Induced subgraphs minisymposium, July 2022.

**Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws**

Seymour is 70+x, Lyon, France, June 2022.

**Induced subgraphs and treewidth**

Princeton PACM Graduate Student Seminar, February 2022.

**Induced subgraph obstructions to bounded treewidth**

TU Ilmenau Combinatorics Seminar, April 2021.

**Proof methods in structural graph theory**

Princeton PACM Graduate Student Seminar, February 2021.

**Induced subgraphs of bounded treewidth and the container method**

SIAM Symposium on Discrete Algorithms (SODA), January 2021.

**Even-hole-free graphs with bounded degree have bounded treewidth**

GRAA online seminar, September 2020

(recording)

**Maximum weight induced subgraphs and the container method**

Young Researchers in Combinatorics online primer, July 2020

**Eigenvalues of Cographs**

Joint Mathematics Meetings, January 2019