Mateusz Pawlik

13 papers A* 1A 1B 1C 1Journal 7Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
SWOOP: top-k similarity joins over set streams.
VLDB J.
Willi Mann, Nikolaus Augsten, Christian S. Jensen, Mateusz Pawlik
2023 — conf
Effective queries for mega-analysis in cognitive neuroscience.
EDBT/ICDT Workshops
Anna Ravenschlag, Monique Denissen, Bianca Löhnert, Mateusz Pawlik, Nicole Alexandra Himmelstoß, Florian Hutzler
2022 J jnl
Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning.
Inf. Syst. Frontiers
Bezaye Tesfaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, Christian S. Jensen
2020 C conf
An Efficient Index for Reachability Queries in Public Transport Networks.
ADBIS
Bezaye Tesfaye, Nikolaus Augsten, Mateusz Pawlik, Michael H. Böhlen, Christian S. Jensen
2020 A conf
Minimal Edit-Based Diffs for Large Trees.
CIKM
Mateusz Pawlik, Nikolaus Augsten
2019 J jnl
A Link is not Enough - Reproducibility of Data.
Datenbank-Spektrum
Mateusz Pawlik, Thomas Hütter, Daniel Kocher, Willi Mann, Nikolaus Augsten
2019 A* conf
Effective Filters and Linear Time Verification for Tree Similarity Joins.
ICDE
Thomas Hütter, Mateusz Pawlik, Robert Loschinger, Nikolaus Augsten
2017 B conf
A New Perspective on the Tree Edit Distance.
SISAP
Stefan Schwarz, Mateusz Pawlik, Nikolaus Augsten
2016 J jnl
Tree edit distance: Robust and memory-efficient.
Inf. Syst.
Mateusz Pawlik, Nikolaus Augsten
2015 J jnl
Efficient Computation of the Tree Edit Distance.
ACM Trans. Database Syst.
Mateusz Pawlik, Nikolaus Augsten
2014 — conf
A Memory-Efficient Tree Edit Distance Algorithm.
DEXA (1)
Mateusz Pawlik, Nikolaus Augsten
2012 J jnl
RTED: A Robust Algorithm for the Tree Edit Distance
CoRR
Mateusz Pawlik, Nikolaus Augsten
2011 J jnl
RTED: A Robust Algorithm for the Tree Edit Distance.
Proc. VLDB Endow.
Mateusz Pawlik, Nikolaus Augsten