Dominik Kppl
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
54
Venues
13
Active years
2013–2026
Best venue rank
A*
Where they publish
Papers
54 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | CPM | The Smallest String Attractors of Fibonacci and Period-Doubling Words. | Mutsunori Banbara, Hideo Bannai, Peaker Guo, Dominik Kppl, Takuya Mieno, Yoshio Okamoto |
| 2026 | CPM | Efficient Index for Square Pattern Matching. | Po-Chun Chen, Che-Wei Tsao, Wing-Kai Hon, Dominik Kppl |
| 2026 | CPM | A Bitwise Approach to SCER Matching in Indeterminate Strings. | Simone Faro, Dominik Kppl, Thierry Lecroq, Francesco Pio Marino |
| 2026 | CPM | Near-Real-Time Solutions for Online String Problems. | Dominik Kppl, Gregory Kucherov |
| 2026 | CPM | Hardness Results on Characteristics for Elastic-Degenerate Strings. | Dominik Kppl, Jannik Olbrich |
| 2026 | DCC | Enabling FM-Index for Elastic-Degenerate Strings via a New Min/Max Wavelet Tree. | Simone Faro, Dominik Kppl, Thierry Lecroq, Francesco Pio Marino |
| 2026 | DCC | Attractor Matching: A New Paradigm for Structural String Comparison. | Simone Faro, Dominik Kppl, Francesco Pio Marino |
| 2026 | DCC | Enumeration of Unbordered Words in Compressed Representation. | Che-Wei Tsao, Yi-Hua Lin, Wing-Kai Hon, Dominik Kppl |
| 2026 | KR | Optimal Dictionary-Based Compression with Answer Set Programming: Encodings and Empirical Analysis. | Mutsunori Banbara, Hideo Bannai, Takashi Horiyama, Dominik Kppl, Takuya Mieno, Hidetomo Nabeshima |
| 2026 | MFCS | Smallest Suffixient Set Maintenance in Near-Real-Time. | Dominik Kppl, Gregory Kucherov |
| 2026 | SOFSEM | Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries. | Souta Kobayashi, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2025 | CPM | Extending the Burrows-Wheeler Transform for Cartesian Tree Matching and Constructing It. | Eric M. Osterkamp, Dominik Kppl |
| 2025 | SPIRE | Counting Distinct (Non-)crossing Substrings. | Haruki Umezaki, Hiroki Shibata, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai |
| 2024 | CPM | Algorithms for Galois Words: Detection, Factorization, and Rotation. | Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | DCC | On the Hardness of Smallest RLSLPs and Collage Systems. | Akiyoshi Kawamoto, Tomohiro I, Dominik Kppl, Hideo Bannai |
| 2024 | DCC | Computing LZ78-Derivates with Suffix Trees. | Dominik Kppl |
| 2024 | DCC | Extending the Parameterized Burrows-Wheeler Transform. | Eric M. Osterkamp, Dominik Kppl |
| 2024 | ICALP | Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. | Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2024 | MFCS | Edit and Alphabet-Ordering Sensitivity of Lex-Parse. | Yuto Nakashima, Dominik Kppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai |
| 2024 | SPIRE | Bijective BWT Based Compression Schemes. | Golnaz Badkobeh, Hideo Bannai, Dominik Kppl |
| 2024 | SPIRE | LZ78 Substring Compression with CDAWGs. | Hiroki Shibata, Dominik Kppl |
| 2023 | CPM | Encoding Hard String Problems with Answer Set Programming. | Dominik Kppl |
| 2023 | DCC | Augmented Thresholds for MONI. | Csar Martnez-Guardiola, Nathaniel K. Brown, Fernando Silva-Coira, Dominik Kppl, Travis Gagie, Susana Ladra |
| 2023 | ESA | Faster Block Tree Construction. | Dominik Kppl, Florian Kurpicz, Daniel Meyer |
| 2023 | SPIRE | Data Structures for SMEM-Finding in the PBWT. | Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Kppl, Massimiliano Rossi |
| 2023 | SPIRE | Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. | Nicola Cotumaccio, Travis Gagie, Dominik Kppl, Nicola Prezza |
| 2023 | WABI | Acceleration of FM-Index Queries Through Prefix-Free Parsing. | Aaron Hong, Marco Oliva, Dominik Kppl, Hideo Bannai, Christina Boucher, Travis Gagie |
| 2022 | DCC | FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. | Jin Jie Deng, Wing-Kai Hon, Dominik Kppl, Kunihiko Sadakane |
| 2022 | DCC | Computing Lexicographic Parsings. | Dominik Kppl |
| 2022 | DCC | HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. | Dominik Kppl, Gonzalo Navarro, Nicola Prezza |
| 2022 | ESA | Computing NP-Hard Repetitiveness Measures via MAX-SAT. | Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Kppl, Takaaki Nishimoto |
| 2022 | IWOCA | Computing Longest (Common) Lyndon Subsequences. | Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Kppl, Simon J. Puglisi |
| 2022 | IWOCA | Space-Efficient B Trees via Load-Balancing. | Tomohiro I, Dominik Kppl |
| 2022 | SPIRE | Accessing the Suffix Array via φ | Christina Boucher, Dominik Kppl, Herman Perera, Massimiliano Rossi |
| 2022 | SPIRE | Computing the Parameterized Burrows-Wheeler Transform Online. | Daiki Hashimoto, Diptarama Hendrian, Dominik Kppl, Ryo Yoshinaka, Ayumi Shinohara |
| 2021 | CPM | Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. | Hideo Bannai, Juha Krkkinen, Dominik Kppl, Marcin Piatkowski |
| 2021 | DCC | PHONI: Streamed Matching Statistics with Multi-Genome References. | Christina Boucher, Travis Gagie, Tomohiro I, Dominik Kppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi |
| 2021 | SPIRE | Grammar Index by Induced Suffix Sorting. | Tooru Akagi, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2021 | SPIRE | A Separation of γ and b via Thue-Morse Words. | Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Kppl, Takuya Mieno, Takaaki Nishimoto |
| 2021 | SPIRE | Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. | Tomohiro I, Robert W. Irving, Dominik Kppl, Lorna Love |
| 2020 | CPM | In-Place Bijective Burrows-Wheeler Transforms. | Dominik Kppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara |
| 2020 | DCC | Re-Pair in Small Space. | Dominik Kppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto |
| 2020 | DCC | c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. | Kazuya Tsuruta, Dominik Kppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | CPM | Indexing the Bijective BWT. | Hideo Bannai, Juha Krkkinen, Dominik Kppl, Marcin Piatkowski |
| 2019 | ESA | Bidirectional Text Compression in External Memory. | Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Kppl, Manuel Penschuck |
| 2019 | SPIRE | Compact Data Structures for Shortest Unique Substring Queries. | Takuya Mieno, Dominik Kppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2017 | CPM | Computing All Distinct Squares in Linear Time for Integer Alphabets. | Hideo Bannai, Shunsuke Inenaga, Dominik Kppl |
| 2017 | SPIRE | Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. | Johannes Fischer, Dominik Kppl |
| 2016 | CPM | On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. | Johannes Fischer, Dominik Kppl, Florian Kurpicz |
| 2016 | DCC | Lempel-Ziv Computation in Compressed Space (LZ-CICS). | Dominik Kppl, Kunihiko Sadakane |
| 2016 | LATIN | Deterministic Sparse Suffix Sorting on Rewritable Texts. | Johannes Fischer, Tomohiro I, Dominik Kppl |
| 2016 | STACS | Efficiently Finding All Maximal alpha-gapped Repeats. | Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Kppl, Florin Manea |
| 2015 | CPM | Lempel Ziv Computation in Small Space (LZ-CISS). | Johannes Fischer, Tomohiro I, Dominik Kppl |
| 2013 | IDEAS | Breaking skyline computation down to the metal: the skyline breaker algorithm. | Dominik Kppl |