On the Computation of Longest Previous Non-overlapping Factors. - Enno Ohlebusch; Pascal Weber 001 (SPIRE, 2019)

Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers. - Thomas Büchler; Caroline Räther; Pascal Weber 001; Enno Ohlebusch (BIOINFORMATICS, 2021)

Deep Clustering With Consensus Representations. - Lukas Miklautz; Martin Teuffenbach; Pascal Weber 001; Rona Perjuci; Walid Durani; Christian Böhm 001; Claudia Plant (ICDM, 2022)

Edge minimization in de Bruijn graphs. - Uwe Baier; Thomas Büchler; Enno Ohlebusch; Pascal Weber 001 (Inf. Comput., 2022)

CaFe DBSCAN: A Density-based Clustering Algorithm for Causal Feature Learning. - Pascal Weber 001; Lukas Miklautz; Akshey Kumar; Moritz Grosse-Wentrup; Claudia Plant (DSAA, 2023)

SHADE: Deep Density-based Clustering. - Anna Beer 001; Pascal Weber 001; Lukas Miklautz; Collin Leiber; Walid Durani; Christian Böhm 001; Claudia Plant (ICDM, 2024)

I Want 'Em All (At Once) - Ultrametric Cluster Hierarchies. - Andrew Draganov; Pascal Weber 001; Rasmus Skibdahl Melanchton Jørgensen; Anna Beer 001; Claudia Plant; Ira Assent (CoRR, 2025)

DISCO: Internal Evaluation of Density-Based Clustering. - Anna Beer 001; Lena Krieger 001; Pascal Weber 001; Martin Ritzert; Ira Assent; Claudia Plant (CoRR, 2025)