Weeks 9 and 10. Visiting Charles University in Prague.

Prague. The conclusion of the program. During the first week in Prague, I attended the 8th Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications at Charles University while also exploring the city. During the second week, I gave a seminar talk in the Combinatorial Structures and Processes student workshop.

Simultaneously, I worked on preparing my paper for conference submission and thought more about proving that simplices are the optimal structures in Euclidean Steiner trees from graphs.

This has been a truly wonderful program. Thanks to DIMACS for hosting me, Karthik and Surya for their mentorship, and to my numerous newfound friends for tolerating me along the way!