Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Projects in Topological Data Analysis Fall 2025

Enrique Alvarado, Iowa State University, enrique3 "at" iastate.edu
Robin Belton, Vassar College, rbelton "at" vassar.edu
Tao Hou, University of Oregon taohou "at" uoregon.edu
Tim Ophelders, TU Eindhoven, t.a.e.ophelders "at" uu.nl
Bastian Grossenbacher Rieck, University of Fribourg, bastian "at" rieck.me
Anna Schenfisch, TU Eindhoven, a.k.schenfisch "at" tue.nl
Patrick Schnider, ETH Zürich, patrick.schnider "at" inf.ethz.ch
Dev Sinha, University of Oregon, dps "at" uoregon.edu

General Information

The main idea of the course is that students from different universities collaborate on projects in topological data analysis. These projects can be of theoretical nature, e.g., the development or analysis of some algorithm or applied, e.g., using topological data analysis on concrete data sets.

The course will start with an official kick-off meeting, in which the problems will be introduced. Before this meeting, the students are encouraged to watch the introductory lectures from previous instances of the course.

Dates

All meetings will be held via zoom at 17:00 (Zürich/Eindhoven/Fribourg), 11:00am (Poughkeepsie) and 8:00am (Eugene), respectively, and should take at most 90 minutes.

Projects

The proposed projects can be found in this booklet. The booklet also contains information about the final reports and presentations.

Resources

General

Paper databases

Software packages

GUDHI notebooks

The following notebooks introduce the libraries GUDHI for persistent homology and Giotto for Mapper.


Last modified: Fri Aug 22 11:28:16 CET 2025 by Patrick Schnider. Valid HTML5