RTED: A Robust Algorithm for the Tree Edit Distance. - Mateusz Pawlik 001; Nikolaus Augsten (Proc. VLDB Endow., 2011)

A Memory-Efficient Tree Edit Distance Algorithm. - Mateusz Pawlik 001; Nikolaus Augsten (DEXA (1), 2014)

Efficient Computation of the Tree Edit Distance. - Mateusz Pawlik 001; Nikolaus Augsten (ACM Trans. Database Syst., 2015)

Tree edit distance: Robust and memory-efficient. - Mateusz Pawlik 001; Nikolaus Augsten (Inf. Syst., 2016)

A New Perspective on the Tree Edit Distance. - Stefan Schwarz; Mateusz Pawlik 001; Nikolaus Augsten (SISAP, 2017)

Effective Filters and Linear Time Verification for Tree Similarity Joins. - Thomas Hütter; Mateusz Pawlik 001; Robert Loschinger; Nikolaus Augsten (ICDE, 2019)

A Link is not Enough - Reproducibility of Data. - Mateusz Pawlik 001; Thomas Hütter; Daniel Kocher; Willi Mann; Nikolaus Augsten (Datenbank-Spektrum, 2019)

An Efficient Index for Reachability Queries in Public Transport Networks. - Bezaye Tesfaye; Nikolaus Augsten; Mateusz Pawlik 001; Michael H. Böhlen; Christian S. Jensen (ADBIS, 2020)

Minimal Edit-Based Diffs for Large Trees. - Mateusz Pawlik 001; Nikolaus Augsten (CIKM, 2020)

Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning. - Bezaye Tesfaye; Nikolaus Augsten; Mateusz Pawlik 001; Michael H. Böhlen; Christian S. Jensen (Inf. Syst. Frontiers, 2022)

Effective queries for mega-analysis in cognitive neuroscience. - Anna Ravenschlag; Monique Denissen; Bianca Löhnert; Mateusz Pawlik 001; Nicole Alexandra Himmelstoß; Florian Hutzler (EDBT/ICDT Workshops, 2023)

SWOOP: top-k similarity joins over set streams. - Willi Mann; Nikolaus Augsten; Christian S. Jensen; Mateusz Pawlik 001 (VLDB J., 2025)