Breaking skyline computation down to the metal: the skyline breaker algorithm. - Dominik Köppl (IDEAS, 2013)

Interactive Toolbox for Spatial-Textual Preference Queries. - Florian Wenzel; Dominik Köppl; Werner Kießling (SSTD, 2013)

Computational Aspects of Ordered Integer Partition with Upper Bounds. - Roland Glück; Dominik Köppl; Günther Wirsching (SEA, 2013)

Structured Document Algebra in Action. - Don S. Batory; Peter Höfner; Dominik Köppl; Bernhard Möller; Andreas Zelend (Software, Services, and Systems, 2015)

Lempel Ziv Computation in Small Space (LZ-CISS). - Johannes Fischer 001; Tomohiro I; Dominik Köppl (CPM, 2015)

Arithmetics on Suffix Arrays of Fibonacci Words. - Dominik Köppl; Tomohiro I (WORDS, 2015)

Efficiently Finding All Maximal $α$-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (CoRR, 2015)

On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. - Johannes Fischer 001; Dominik Köppl; Florian Kurpicz (CPM, 2016)

Lempel-Ziv Computation in Compressed Space (LZ-CICS). - Dominik Köppl; Kunihiko Sadakane (DCC, 2016)

Deterministic Sparse Suffix Sorting on Rewritable Texts. - Johannes Fischer 001; Tomohiro I; Dominik Köppl (LATIN, 2016)

Efficiently Finding All Maximal alpha-gapped Repeats. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (STACS, 2016)

Computing All Distinct Squares in Linear Time for Integer Alphabets. - Hideo Bannai; Shunsuke Inenaga; Dominik Köppl (CPM, 2017)

Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. - Johannes Fischer 001; Dominik Köppl (SPIRE, 2017)

Compression with the tudocomp Framework. - Patrick Dinklage; Johannes Fischer 001; Dominik Köppl; Marvin Löbel; Kunihiko Sadakane (SEA, 2017)

Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. - Johannes Fischer 001; Tomohiro I; Dominik Köppl; Kunihiko Sadakane (Algorithmica, 2018)

Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes. - Tomohiro I; Dominik Köppl (CoRR, 2018)

Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. - Pawel Gawrychowski; Tomohiro I; Shunsuke Inenaga; Dominik Köppl; Florin Manea (Theory Comput. Syst., 2018)

Exploring regular structures in strings - Dominik Köppl (2018)

Indexing the Bijective BWT. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CPM, 2019)

Bidirectional Text Compression in External Memory. - Patrick Dinklage; Jonas Ellert; Johannes Fischer 001; Dominik Köppl; Manuel Penschuck (ESA, 2019)

Compact Data Structures for Shortest Unique Substring Queries. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2019)

Dynamic Packed Compact Tries Revisited. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2019)

Separate Chaining Meets Compact Hashing. - Dominik Köppl (CoRR, 2019)

Re-Pair In-Place. - Dominik Köppl; Tomohiro I; Isamu Furuya; Yoshimasa Takabatake; Kensuke Sakai; Keisuke Goto 001 (CoRR, 2019)

Constructing the Bijective BWT. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CoRR, 2019)

Improved upper bounds on all maximal α-gapped repeats and palindromes. - Tomohiro I; Dominik Köppl (Theor. Comput. Sci., 2019)

In-Place Bijective Burrows-Wheeler Transforms. - Dominik Köppl; Daiki Hashimoto; Diptarama Hendrian; Ayumi Shinohara (CPM, 2020)

On Arithmetically Progressed Suffix Arrays. - Jacqueline W. Daykin; Dominik Köppl; David Kübel; Florian Stober (Stringology, 2020)

Computational Aspects of Ordered Integer Partitions with Bounds. - Roland Glück; Dominik Köppl (Algorithmica, 2020)

Grammar-compressed Self-index with Lyndon Words. - Kazuya Tsuruta; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (CoRR, 2020)

Dynamic Path-decomposed Tries. - Shunsuke Kanda; Dominik Köppl; Yasuo Tabei; Kazuhiro Morita; Masao Fuketa (ACM J. Exp. Algorithmics, 2020)

Deterministic Sparse Suffix Sorting in the Restore Model. - Johannes Fischer 001; Tomohiro I; Dominik Köppl (ACM Trans. Algorithms, 2020)

Space-efficient algorithms for computing minimal/shortest unique substrings. - Takuya Mieno; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Theor. Comput. Sci., 2020)

Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CPM, 2021)

PHONI: Streamed Matching Statistics with Multi-Genome References. - Christina Boucher 001; Travis Gagie; Tomohiro I; Dominik Köppl; Ben Langmead; Giovanni Manzini; Gonzalo Navarro 001; Alejandro Pacheco; Massimiliano Rossi 001 (DCC, 2021)

Grammar Index by Induced Suffix Sorting. - Tooru Akagi; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (SPIRE, 2021)

A Separation of γ and b via Thue-Morse Words. - Hideo Bannai; Mitsuru Funakoshi; Tomohiro I; Dominik Köppl; Takuya Mieno; Takaaki Nishimoto (SPIRE, 2021)

Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. - Tomohiro I; Robert W. Irving; Dominik Köppl; Lorna Love (SPIRE, 2021)

Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees. - Dominik Köppl (Algorithms, 2021)

Reversed Lempel-Ziv Factorization with Suffix Trees. - Dominik Köppl (Algorithms, 2021)

Re-Pair in Small Space. - Dominik Köppl; Tomohiro I; Isamu Furuya; Yoshimasa Takabatake; Kensuke Sakai; Keisuke Goto 001 (Algorithms, 2021)

Load-Balancing Succinct B Trees. - Tomohiro I; Dominik Köppl (CoRR, 2021)

Engineering Practical Lempel-Ziv Tries. - Diego Arroyuelo; Rodrigo Cánovas; Johannes Fischer 001; Dominik Köppl; Marvin Löbel; Gonzalo Navarro 001; Rajeev Raman (ACM J. Exp. Algorithmics, 2021)

FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. - Jin Jie Deng; Wing-Kai Hon; Dominik Köppl; Kunihiko Sadakane (DCC, 2022)

Computing Lexicographic Parsings. - Dominik Köppl (DCC, 2022)

HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. - Dominik Köppl; Gonzalo Navarro 001; Nicola Prezza (DCC, 2022)

Computing NP-Hard Repetitiveness Measures via MAX-SAT. - Hideo Bannai; Keisuke Goto 001; Masakazu Ishihata; Shunsuke Kanda; Dominik Köppl; Takaaki Nishimoto (ESA, 2022)

Computing Longest (Common) Lyndon Subsequences. - Hideo Bannai; Tomohiro I; Tomasz Kociumaka; Dominik Köppl; Simon J. Puglisi (IWOCA, 2022)

Space-Efficient B Trees via Load-Balancing. - Tomohiro I; Dominik Köppl (IWOCA, 2022)

Accessing the Suffix Array via φ -1-Forest. - Christina Boucher 001; Dominik Köppl; Herman Perera; Massimiliano Rossi 001 (SPIRE, 2022)

Computing the Parameterized Burrows-Wheeler Transform Online. - Daiki Hashimoto; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (SPIRE, 2022)

Fast and Simple Compact Hashing via Bucketing. - Dominik Köppl; Simon J. Puglisi; Rajeev Raman (Algorithmica, 2022)

Linking Off-Road Points to Routing Networks. - Dominik Köppl (Algorithms, 2022)

Longest (Sub-)Periodic Subsequence. - Hideo Bannai; Tomohiro I; Dominik Köppl (CoRR, 2022)

c-trie++: A dynamic trie tailored for fast prefix searches. - Kazuya Tsuruta; Dominik Köppl; Shunsuke Kanda; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda (Inf. Comput., 2022)

Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks. - Dominik Köppl (Inf., 2022)

Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. - Paolo Ferragina; Giovanni Manzini; Travis Gagie; Dominik Köppl; Gonzalo Navarro 001; Manuel Striani; Francesco Tosoni 001 (Proc. VLDB Endow., 2022)

Graph Compression for Adjacency-Matrix Multiplication. - Alexandre P. Francisco; Travis Gagie; Dominik Köppl; Susana Ladra; Gonzalo Navarro 001 (SN Comput. Sci., 2022)

Correction to: Graph Compression for Adjacency-Matrix Multiplication. - Alexandre P. Francisco; Travis Gagie; Dominik Köppl; Susana Ladra; Gonzalo Navarro 001 (SN Comput. Sci., 2022)

Encoding Hard String Problems with Answer Set Programming. - Dominik Köppl (CPM, 2023)

Augmented Thresholds for MONI. - César Martínez-Guardiola; Nathaniel K. Brown; Fernando Silva-Coira; Dominik Köppl; Travis Gagie; Susana Ladra (DCC, 2023)

Faster Block Tree Construction. - Dominik Köppl; Florian Kurpicz; Daniel Meyer (ESA, 2023)

Data Structures for SMEM-Finding in the PBWT. - Paola Bonizzoni; Christina Boucher 001; Davide Cozzi; Travis Gagie; Dominik Köppl; Massimiliano Rossi 001 (SPIRE, 2023)

Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. - Nicola Cotumaccio; Travis Gagie; Dominik Köppl; Nicola Prezza (SPIRE, 2023)

Acceleration of FM-Index Queries Through Prefix-Free Parsing. - Aaron Hong; Marco Oliva; Dominik Köppl; Hideo Bannai; Christina Boucher 001; Travis Gagie (WABI, 2023)

Space-efficient Huffman codes revisited. - Szymon Grabowski; Dominik Köppl (Inf. Process. Lett., 2023)

Longest bordered and periodic subsequences. - Hideo Bannai; Tomohiro I; Dominik Köppl (Inf. Process. Lett., 2023)

μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data. - Davide Cozzi; Massimiliano Rossi 001; Simone Rubinacci; Travis Gagie; Dominik Köppl; Christina Boucher 001; Paola Bonizzoni (Bioinform., 2023)

Algorithms for Galois Words: Detection, Factorization, and Rotation. - Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (CPM, 2024)

On the Hardness of Smallest RLSLPs and Collage Systems. - Akiyoshi Kawamoto; Tomohiro I; Dominik Köppl; Hideo Bannai (DCC, 2024)

Computing LZ78-Derivates with Suffix Trees. - Dominik Köppl (DCC, 2024)

Extending the Parameterized Burrows-Wheeler Transform. - Eric M. Osterkamp; Dominik Köppl (DCC, 2024)

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. - Kento Iseri; Tomohiro I; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara (ICALP, 2024)

Edit and Alphabet-Ordering Sensitivity of Lex-Parse. - Yuto Nakashima 001; Dominik Köppl; Mitsuru Funakoshi; Shunsuke Inenaga; Hideo Bannai (MFCS, 2024)

Bijective BWT Based Compression Schemes. - Golnaz Badkobeh; Hideo Bannai; Dominik Köppl (SPIRE, 2024)

LZ78 Substring Compression with CDAWGs. - Hiroki Shibata 001; Dominik Köppl (SPIRE, 2024)

NP-Completeness for the Space-Optimality of Double-Array Tries. - Hideo Bannai; Keisuke Goto 001; Shunsuke Kanda; Dominik Köppl (CoRR, 2024)

Hardness Results on Characteristics for Elastic-Degenerated Strings. - Dominik Köppl; Jannik Olbrich (CoRR, 2024)

On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms. - Jacqueline W. Daykin; Dominik Köppl; David Kübel; Florian Stober (Discret. Appl. Math., 2024)

Constructing and indexing the bijective and extended Burrows-Wheeler transform. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (Inf. Comput., 2024)

Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. - Hideo Bannai; Tomohiro I; Tomasz Kociumaka; Dominik Köppl; Simon J. Puglisi (Algorithmica, 2024)

Pfp-fm: an accelerated FM-index. - Aaron Hong; Marco Oliva; Dominik Köppl; Hideo Bannai; Christina Boucher 001; Travis Gagie (Algorithms Mol. Biol., 2024)

A Survey of the Bijective Burrows-Wheeler Transform. - Hideo Bannai; Dominik Köppl; Zsuzsanna Lipták (The Expanding World of Compressed Data, 2025)

Enumeration of Ordered Trees with Leaf Restrictions. - Yasuaki Kobayashi; Dominik Köppl; Yasuko Matsui; Hirotaka Ono 001; Toshiki Saitoh; Yushi Uno (From Strings to Graphs, and Back Again, 2025)

Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It. - Eric M. Osterkamp; Dominik Köppl (CPM, 2025)

Substring compression variations and LZ78-Derivates. - Dominik Köppl (Inf. Syst., 2025)

LZD-style Compression Scheme with Truncation and Repetitions. - Linus Götz; Dominik Köppl (CoRR, 2025)

Counting distinct (non-)crossing substrings. - Haruki Umezaki; Hiroki Shibata 001; Dominik Köppl; Yuto Nakashima 001; Shunsuke Inenaga; Hideo Bannai (CoRR, 2025)