Drexel Computer Science Theory Reading Group

The Drexel Computer Science Theory Reading Group is a group of graduate, undergraduate, and high school students led by Prof. Vasilis Gkatzelis. The topics covered during the reading group's weekly meetings focus on advanced material in algorithm design and analysis, and they range from textbook material to current research questions and open problems in theoretical computer science. We thank Kira Goldner for sharing the template for this homepage.


Date Topic
October 18, 2019Maximum Weight Matching in Bipartite Graphs and the König-Egeváry theorem
October 11, 2019Maximum Cardinality Matching in Bipartite Graphs
June 7, 2019Peter Gagliardi on "An Exploration of Fractals and Tilings"
May 31, 2019Curtis Bechtel on "Lower Bounds for Running Time of Certain Problems"
May 24, 2019Dan Schoepflin on "The Performance of Ascending and Descending Clock Auctions"
May 17, 2019Marius Garbea on "Algorithms for Easy and Hard Variants of Interval Scheduling"
May 10, 2019Pranav Garimidi on "Fair Allocation of Indivisible Goods"
May 3, 2019The Dinitz Problem continued
April 26, 2019The Dinitz Problem and Graph Coloring
April 19, 2019Bailey Flanigan on "Budget-Feasible Mechanisms"
April 12, 2019Set Cover and Uncapacitated Facility Location (upper and lower bounds)
April 5, 2019Set Cover and Uncapacitated Facility Location (greedy algorithm and reduction)
March 22, 2019Dan Schoepflin on "Money-Free Truthful Scheduling Mechanisms" continued
March 15, 2019Dan Schoepflin on "Money-Free Truthful Scheduling Mechanisms"
March 8, 2019Guest Presentation: Emmanouil Pountourakis on "Algorithmic Delegation"
March 1, 2019Combinatorial Arguments and Metric Steiner Tree
February 22, 2019Spanning Trees and Cayley's Formula
December 7, 2018Traveling Salesperson II and Steiner Tree
November 30, 2018Traveling Salesperson I
November 16, 2018Scheduling Algorithms
November 9, 2018 Makespan Minimization
November 2, 2018 K-center Problem II and reductions
October 26, 2018 K-center Problem I
October 19, 2018 Vertex Cover - Linear Programming
October 12, 2018 Vertex Cover - Greedy
October 5, 2018 Vertex Cover - Optimal algorithms for classes of graphs
September 28, 2018 Overview of topics
September 14, 2018 Introduction to linear programming II
September 7, 2018 Introduction to linear programming I
August 31, 2018 Introduction to dynamic programming III
August 24, 2018 Introduction to dynamic programming II
August 17, 2018 Knapsack and introduction to dynamic programming I
August 10, 2018 Introduction to optimization problems and knapsack