Average Complexity of Matrix Reduction for Clique Filtrations. - Barbara Giunti; Guillaume Houry; Michael Kerber (ISSAC, 2022)

Keeping it sparse: Computing Persistent Homology revised. - Ulrich Bauer; Talha Bin Masood; Barbara Giunti; Guillaume Houry; Michael Kerber; Abhishek Rathod (CoRR, 2022)

An Empirical Study of Simplicial Representation Learning with Wasserstein Distance. - Makoto Yamada; Yuki Takezawa; Guillaume Houry; Kira Michaela Dusterwald; Déborah Sulem; Han Zhao 002; Yao-Hung Hubert Tsai (CoRR, 2023)

Fast 1-Wasserstein distance approximations using greedy strategies. - Guillaume Houry; Han Bao 002; Han Zhao 002; Makoto Yamada (AISTATS, 2024)