| Name | Affiliation | Title |
|---|
| Amin Bahmanian | Auburn University | Connected Baranyai's Theorem |
| Afshin Behmaram | University of Illinois, Chicago | Matching and Small Paths in Fullerene Graphs |
| Karthekeyan Chandrasekaran | Georgia Tech | The Cutting Plane Method is Polynomial for Perfect Matchings |
| Martin Derka | Masaryk University | Recent Advances in Finite Planar Emulators |
| James Fairbanks | Georgia Institute of Technology | A Ramsey Theorem for Indecomposable Matchings |
| Dennis Hall | Louisiana State University | Unavoidable Minors for Connected 2-Polymatroids |
| Cesar Hernandez Velez | Universidad Autonoma de San Luis Potosi, Mexico | Nested Cycles in Large Triangulations and Crossing-Critical Graphs |
| Hao-Hsiang Hung | Georgia Tech | Finding Light Spanners in Bounded Pathwidth Graphs |
| Nana Li | Georgia State University | Reed-Frost Transition on Dense Graphs |
| Sarah Miracle | Georgia Tech | Sampling 3-Orientations of Triangulations |
| Songling Shan | Georgia State University | Homeomorphically Irreducible Spanning Trees |
| Vaidyanathan Sivaraman | Ohio State University | Frustration in Signed Graphs |
| Jesse Taylor | Louisiana State University | On a Class of Nearly Binary Matroids |
| Ying Xiao | Georgia Tech | Statistical Algorithms and a Lower Bound for Planted Clique |
