Traversing Grammar-Compressed Trees with Constant Delay. - Markus Lohrey; Sebastian Maneth; Carl Philipp Reh (DCC, 2016)

The Smallest Grammar Problem Revisited. - Danny Hucke; Markus Lohrey; Carl Philipp Reh (SPIRE, 2016)

Compression of Unordered XML Trees. - Markus Lohrey; Sebastian Maneth; Carl Philipp Reh (ICDT, 2017)

Optimal top dag compression. - Markus Lohrey; Carl Philipp Reh; Kurt Sieber (CoRR, 2017)

Constant-Time Tree Traversal and Subtree Equality Check for Grammar-Compressed Trees. - Markus Lohrey; Sebastian Maneth; Carl Philipp Reh (Algorithmica, 2018)

Size-optimal top dag compression. - Markus Lohrey; Carl Philipp Reh; Kurt Sieber (Inf. Process. Lett., 2019)

Algorithmic aspects of grammar-compressed trees. - Carl Philipp Reh (2019)

Navigating Forest Straight-Line Programs in Constant Time. - Carl Philipp Reh; Kurt Sieber (SPIRE, 2020)

Grammar-Based Compression of Unranked Trees. - Adrià Gascón; Markus Lohrey; Sebastian Maneth; Carl Philipp Reh; Kurt Sieber (Theory Comput. Syst., 2020)

Approximation Ratios of RePair, LongestMatch and Greedy on Unary Strings. - Danny Hucke; Carl Philipp Reh (Algorithms, 2021)

The Smallest Grammar Problem Revisited. - Hideo Bannai; Momoko Hirayama; Danny Hucke; Shunsuke Inenaga; Artur Jez; Markus Lohrey; Carl Philipp Reh (IEEE Trans. Inf. Theory, 2021)