ACO Student Seminar

The Georgia Tech ACO Student Seminar is run by students in the Algorithms, Combinatorics, & Optimization program at Georgia Tech.

The purpose of this seminar is to keep students updated with current research, and to give students a venue to present their work. Any topic related (but not restricted) to algorithms, combinatorics, and optimization is very welcome. You can present research results, demo a work in progress, or just share something of general interest. There will also be occasional talks by ACO faculty and visitors. (Post-docs are welcome too!)

In Spring 2025, the seminar will meet on Fridays in Skiles 006 from 1-2pm. For more information please refer to the announcement sent by the organizers (or contact them directly). Subscribe to the mailing list aco-announce (or send an email to sympa@lists.gatech.edu with the subject line "subscribe aco-announce") to receive the announcements regularly.

Contact

If you are interested in giving a talk, you can contact any of the organizers: Max Dabagia, Aiya Kuchukova, Jade Lintott, and Sam van der Poel. (Thanks to Abhishek Dhawan, Jad Salem, and Reuben Tate for organizing the seminar previously.)

Spring 2025 Talks

February 14: Caleb McFarland (Georgia Tech)


The Independence Ratio of 4-Cycle-Free Planar Graphs

We prove that every n-vertex planar graph G with no triangle sharing an edge with a 4-cycle has independence ratio n/α(G) ≤ 4 − ε for ε = 1/30. This result implies that the same bound holds for 4-cycle-free planar graphs and planar graphs with no adjacent triangles and no triangle sharing an edge with a 5-cycle. For the latter case we strengthen the bound to ε = 2/9. Joint work with Tom Kelly, Sid Kolichala, and Jatong Su.

March 14: Neelkamal Bhuyan (CS, Georgia Tech)


Title TBA

Abstract TBA