Updated on 2026/03/19

写真a

 
Koeppl Dominik
 
Organization
Graduate Faculty of Interdisciplinary Research Faculty of Engineering Electrical and Electronic Information Engineering (Computer Science and Engineering) Associate Professor
Title
Associate Professor
Homepage
https://dkppl.de/cowasp/
External link

Research History

  • University of Yamanashi

    2023.9

    　 More details

    Job classification：Professor

    researchmap

  • Tokyo Medical and Dental University   M&D Data Center   part-time lecturer

    2023.4

    　 More details

    Country：Japan

    Job classification：Lecturer (part-time)

    researchmap

  • Tokyo Medical and Dental University   M&D Data Center   Assistant Professor

    2020.9 - 2023.3

    　 More details

    Country：Japan

    researchmap

Research Areas

  • Informatics / High performance computing

  • Informatics / Intelligent informatics

  • Informatics / Theory of informatics

Research Interests

  • Algorithms

  • Combinatorics on words

  • string processing

  • information retrieval

  • compressed data structures

  • data structure

  • data compression

Research Projects

  • 文字列組合せ論を加速する列挙技術と制約プログラミング

    Grant number：252M-23667  2025.7 - 2026.3

    National Institute of Informatics  University of Yamanashi  Research Planning Meeting Public Call

    　 More details

    Authorship：Principal investigator  Grant type：Competitive 

    researchmap

  • Algorithm-Engineered Compressed Indexes

    Grant number：25K21150  2025.4 - 2028.3

    Japan Society for the Promotion of Science  University of Yamanashi  Grants-in-Aid for Scientific Research  Grant-in-Aid for Early-Career Scientists

    　 More details

    Authorship：Principal investigator  Grant type：Competitive 

    researchmap

  • 一次元データの効率的な処理手法の開発

    Grant number：2291  2024.8 - 2025.3

    Yamanashi Prefecture Science Promotion Section  University of Yamanashi  Research Grant for Young Scholars Funded by Yamanashi Prefecture

    　 More details

    Authorship：Principal investigator  Grant type：Competitive 

    researchmap

  • Constructing Compressed Indexes for Biological Sequences

    Grant number：23H04378  2023.4 - 2025.3

    Japan Society for the Promotion of Science  Tokyo Medical and Dental University  Grants-in-Aid for Scientific Research  Grant-in-Aid for Transformative Research Areas (A)

    　 More details

    Authorship：Principal investigator  Grant type：Competitive 

    researchmap

  • 広義文字列のアルゴリズムと組合せ論

    Grant number：22H03551  2022.4 - 2026.3

    Japan Society for the Promotion of Science  Kyushu University  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)

    Shunsuke Inenaga, Hideo Bannai, Yuto Nakashima

    　 More details

    Authorship：Coinvestigator(s)  Grant type：Competitive 

    researchmap

  • Indexing Massive Datasets with Algorithmic Engineered Compression Techniques on Modern Computer Architectures

    Grant number：21K17701  2021.4 - 2024.3

    Japan Society for the Promotion of Science  Tokyo Medical and Dental University  Grants-in-Aid for Scientific Research  Grant-in-Aid for Early-Career Scientists

    　 More details

    Authorship：Principal investigator  Grant type：Competitive 

    researchmap

▼display all

Papers

  • Enabling FM-Index for Elastic-Degenerate Strings via a new Min/Max Wavelet Tree (Poster) Reviewed International coauthorship

    Simone Faro, Dominik Köppl, Francesco Pio Marino

    Proc. DCC   2026.3

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Attractor Matching: A New Paradigm for Structural String Comparison Reviewed International coauthorship

    Simone Faro, Dominik Köppl, Francesco Pio Marino

    Proc. DCC   2026.3

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Enumeration of Unbordered Words in Compressed Representation Reviewed International coauthorship

    Che-Wei Tsao, Yi-Hua Lin, Wing-Kai Hon, Dominik Köppl

    Proc. DCC   2026.3

    　More details

    Authorship：Last author   Language：English   Publishing type：Research paper (international conference proceedings)  

  • τλ-Index: A framework for locating rare patterns in repetitive corpora Reviewed International coauthorship

    Che-Wei Tsao, Jin-Jie Deng, Long-Qi Chen, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane

    Information Systems   139   2026.2( ISSN：0306-4379 )

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.is.2026.102702

  • On Solving the Sparse Matrix Compression Problem

    Dominik Köppl

    Shonan Meeting No.240, New Era of Data Structures: From Strings to Graphs, and more   2026.2

    　More details

    Authorship：Lead author,　Last author,　Corresponding author   Language：English   Publishing type：(MISC) Institution technical report and pre-print, etc.  

  • Efficient Solutions to Variants of Inversion Problems of Range Minimum Queries Reviewed

    Souta Kobayashi, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara

    Proc. SOFSEM   16448   16 - 30   2026.2

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

  • Extended parameterized Burrows–Wheeler transform Reviewed

    Eric M. Osterkamp, Dominik Köppl

    Information Systems   136 ( 102611 )   1 - 19   2026.2( ISSN：0306-4379 )

    　More details

    Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1016/j.is.2025.102611

  • LZW の圧縮感度

    三神 摩周, クップル ドミニク

    Local Proceedings of the LA Symposium Winter 2025   ( 6S )   2026.1

    　More details

    Authorship：Last author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

  • 疎行列圧縮による二重対数行列幅の実現 International coauthorship

    Dominik Köppl, Vincent Limouzy, Andrea Marino, Jannik Olbrich, Giulia Punzi, Takeaki Uno

    Local Proceedings of the LA Symposium Winter 2025   ( 28 )   2026.1

    　More details

    Authorship：Lead author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

  • 準リアルタイム接尾辞木構築に関する応用について International coauthorship

    Dominik Köppl, Gregory Kucherov

    Local Proceedings of the 206th アルゴリズム研究会   206   1 - 4   2026.1

    　More details

    Authorship：Lead author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

  • LZ78 Substring Compression in Compressed Space Reviewed

    Hiroki Shibata, Dominik Köppl

    Theory of Computing Systems   70 ( 1 )   1 - 22   2025.12( ISSN：1433-0490 )

    　More details

    Authorship：Last author   Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s00224-025-10245-8

  • Computing NP-hard Repetitiveness Measures via MAX-SAT Reviewed International coauthorship

    Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto, Bernardo Subercaseaux

    ACM Trans. Algorithms   22 ( 2 )   15:1 - 15:25   2025.11( ISSN：1549-6325 )

    　More details

    Authorship：Corresponding author   Language：English   Publishing type：Research paper (scientific journal)   Publisher：Association for Computing Machinery  

    DOI： 10.1145/3777895

  • Counting Distinct (Non-)crossing Substrings Reviewed

    Haruki Umezaki, Hiroki Shibata, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai

    Proc. SPIRE   16073   281 - 290   2025.9

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.1007/978-3-032-05228-5_22

  • Space-Efficient B Trees via Load-Balancing Reviewed

    Tomohiro I, Dominik Köppl, Hiroshi Sakamoto, Sohei Yamaguchi

    Theory of Computing Systems   69 ( 32 )   1 - 26   2025.9( ISSN：1433-0490 )

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    DOI： 10.1007/s00224-025-10238-7

  • 複数文学列に対するデカルト木円形パターン照合の索引

    Eric Osterkamp, Dominik Köppl

    Local Proceedings of the LA Symposium Summer 2025   ( 18 )   2025.7

    　More details

    Authorship：Last author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

  • Enumeration of Ordered Trees with Leaf Restrictions Reviewed

    Yasuaki Kobayashi, Dominik Köppl, Yasuko Matsui, Hirotaka Ono, Toshiki Saitoh, Yushi Uno

    From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday   132   8:1 - 8:19   2025.7( ISSN：2190-6807  ISBN：978-3-95977-391-1 )

    　More details

    Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Schloss Dagstuhl – Leibniz-Zentrum für Informatik  

    DOI： 10.4230/OASIcs.Grossi.8

  • A Survey of the Bijective Burrows-Wheeler Transform Reviewed

    Hideo Bannai, Dominik Köppl, Zsuzsanna Lipták

    The Expanding World of Compressed Data: A Festschrift for Giovanni Manzini's 60th Birthday   131   2:1 - 2:26   2025.7( ISSN：2190-6807  ISBN：978-3-95977-390-4 )

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Schloss Dagstuhl – Leibniz-Zentrum für Informatik  

    DOI： 10.4230/OASIcs.Manzini.2

  • Extending the Burrows–Wheeler Transform for Cartesian Tree Matching and Constructing It Reviewed

    Eric M. Osterkamp, Dominik Köppl

    Proc. CPM   331   26:1 - 26:17   2025.7( ISSN：1868-8969  ISBN：978-3-95977-369-0 )

    　More details

    Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

    DOI： 10.4230/LIPIcs.CPM.2025.26

  • 全単射 Burrows–Wheeler 変換の圧縮感度について

    Hyodam Jeon, Dominik Köppl

    Local Proceedings of the 202th アルゴリズム研究会   202 ( 5 )   1 - 3   2025.3

    　More details

    Authorship：Last author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

  • Substring Compression Variations and LZ78-Derivates Reviewed

    Dominik Köppl

    Information Systems   2025.3( ISSN：0306-4379 )

    　More details

    Authorship：Lead author,　Last author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

  • Compression Sensitivity of the Burrows–Wheeler transform and its Bijective Variant Reviewed International coauthorship

    Hyodam Jeon, Dominik Köppl

    Mathematics   2025.3

    　More details

    Authorship：Last author,　Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

  • 未決定文字列における一意単語の検索の困難さ

    Dominik Köppl, Jannik Olbrich

    Local Proceedings of the 201th アルゴリズム研究会   201 ( 4 )   1 - 5   2025.1

    　More details

    Authorship：Lead author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    We prove that computing a minimal unique substring in indeterminate strings is NP-complete.

  • On Solving the Sparse Matrix Compression Problem Greedily

    Dominik Köppl, Vincent Limouzy, Andrea Marino, Giulia Punzi, Takeaki Uno

    Local Proceedings of the LA Symposium Winter 2024   ( 24 )   2025.1

    　More details

    Authorship：Lead author,　Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

  • 未決定文字列における欠如単語の検索の困難さ

    Dominik Köppl; Jannik Olbrich

    Local Proceedings of the 200th アルゴリズム研究会   200 ( 7 )   1 - 5   2024.11

    　More details

    Authorship：Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    researchmap

  • Bijective BWT based Compression Schemes Reviewed

    Golnaz Badkobeh; Hideo Bannai; Dominik Köppl

    Proc. SPIRE   14899   16 - 25   2024.9

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    We put the bijective Burrows-Wheeler transform into the landscape of compressivitiy measures by drawing connections to bidirectional macro schemes, study the number of runs with respect to the classic Burrows-Wheeler transform, give a linear-time algortihm for computing the Lyndon factorization of all cyclic rotations of a text, and conjecture that strings with the same Parikh-vector can be bijectively mapped by a sequence of cyclic rotatations and bijective Burrows-Wheeler transform applications.

    DOI： 10.1007/978-3-031-72200-4_2

    researchmap

  • LZ78 Substring Compression with CDAWGs Reviewed

    Hiroki Shibata; Dominik Köppl

    Proc. SPIRE   14899   289 - 305   2024.9

    　More details

    Authorship：Corresponding author   Language：English   Publishing type：Research paper (international conference proceedings)  

    We study the substring compression in the LZ78 scheme introduced in \cite{koppl21nonoverlapping} with a compressed text index. The presented solution has superlinear running time with respcet to the number of factors to compute, but can use space asymptotically smaller than the text size.

    DOI： 10.1007/978-3-031-72200-4_22

    researchmap

  • Edit and Alphabet-Ordering Sensitivity of Lex-Parse Reviewed

    Yuto Nakashima; Dominik Köppl; Mitsuru Funakoshi; Shunsuke Inenaga; Hideo Bannai

    Proc. MFCS   306   75:1 - 75:15   2024.8

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    We give tight logarithmic bounds on the change of the number of factors produced by the lex-parse compression scheme when we change a single character of the input or change the order of the alphabet.

    DOI： 10.4230/LIPIcs.MFCS.2024.75

    researchmap

  • 対数的な幅を持つ疎行列圧縮のNP完全性

    坂内 英夫; 後藤 啓介; 田 峻介; クップル ドミニク

    Local Proceedings of the LA Symposium Summer 2024   ( 15 )   2024.7

    　More details

    Authorship：Corresponding author   Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    researchmap

  • Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching Reviewed

    Kento Iseri; Tomohiro I; Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara

    Proc. ICALP   297   89:1 - 89:19   2024.7

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Schloss Dagstuhl - Leibniz-Zentrum für Informatik  

    We adapt the online Burrows-Wheeler transform construction on the reversed text for constructing the parameterized Burrows-Wheeler transform like in \cite{hashimoto22computing}. By binary searching the interval for the insertion position, we obtain the first construction algorithm of pamaterized indexes whose time only logarithmically depend on the parameterized alphabet size. Up to that point, only linear-dependence has been known.

    DOI： 10.4230/LIPICS.ICALP.2024.89

    researchmap

  • CDAWG による LZ78 部分文字列圧縮

    柴田 紘希; クップル ドミニク

    Local Proceedings of the LA Symposium Summer 2024   ( 13 )   2024.7

    　More details

    Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    researchmap

  • Algorithms for Galois Words: Detection, Factorization, and Rotation Reviewed

    Diptarama Hendrian; Dominik Köppl; Ryo Yoshinaka; Ayumi Shinohara

    Proc. CPM   296   18:1 - 18:16   2024.6

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)   Publisher：Schloss Dagstuhl - Leibniz-Zentrum für Informatik  

    Galois words are conceptually Lyndon words based on the alternating order, for which we give algorithms to determine whether a word is Galois, to factorize a non-Galoid word into Galois words in a unique manner like the Lyndon factorization, and to find the rotation of a word that is Galois. All algorithms work in linear time.

    DOI： 10.4230/LIPICS.CPM.2024.18

    researchmap

  • On arithmetically progressed suffix arrays and related Burrows–Wheeler transforms Reviewed

    Jacqueline W. Daykin; Dominik Köppl; David Kübel; Florian Stober

    Discrete Applied Mathematics   355   2024.4( ISSN：0166-218X )

    　More details

    Authorship：Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

    Compared to the conference version~\cite{daykin20arithmetically}, we here additionally analyze the shapes of Burrows-Wheeler transforms of strings whose suffix arrays are arithmetically progressed. Additionally, we give applications for Christoffel words, balanced words, and meta strings. Finally, we extend our study on binary and ternary alphabets to general alphabets.

    DOI： 10.1016/j.dam.2024.04.009

    researchmap

  • Pfp-fm: an accelerated FM-index Reviewed International coauthorship

    Aaron Hong; Marco Oliva; Dominik Köppl; Hideo Bannai; Christina Boucher; Travis Gagie

    Algorithms for Molecular Biology   19 ( 15 )   1 - 14   2024.4( ISSN：1748-7188 )

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Journal version of \cite{hong23acceleration}. We improved the space bounds by run-length encoding both FM-indexes. We called this solution PFP-FM-CSA in the article. Compared to the conference version, this implementation has higher memory consumption during the construction, but significantly smaller index sizes.

    DOI： 10.1186/s13015-024-00260-8

    researchmap

  • Computing LZ78-Derivates with Suffix Trees Reviewed

    Dominik Köppl

    Proc. DCC   133 - 142   2024.3

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    We extend the LZ78 substring compression introduced in \cite{koppl21nonoverlapping} to the LZ78 derivates LZMW and LZ double. As a byproduct, we obtain the first linear-time algorithm for integer alphabets independent on the text compressibility.

    researchmap

  • Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences Reviewed

    Hideo Bannai, Tomohiro I., Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi

    Algorithmica   2024.3( ISSN：1432-0541 )

    　More details

    Authorship：Corresponding author   Language：English   Publishing type：Research paper (scientific journal)  

    We improve on \cite{bannai22computing}, we could improve the time and space complexity of our online algorithm, where we shaved off a factor linear in the alphabet size

    DOI： 10.1007/s00453-023-01125-z

    Scopus

    researchmap

  • On the Hardness of Smallest RLSLPs and Collage Systems Reviewed

    Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai

    Proc. DCC   243 - 252   2024.3

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    We show that finding a smallest run-length compressed straight line programs (RLSLPs) is NP-hard for unbounded alphabet size. The same proof can be adapted for finding a smallest collage system. Additionally, we give a MAX-SAT encoding for computing a smallest RLSLP.

    researchmap

  • Extending the Parameterized Burrows–Wheeler Transform Reviewed

    Eric M. Osterkamp, Dominik Köppl

    Proc. DCC   143 - 152   2024.3

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    We propose a generalized pattern matching combining parameterized with circular pattern matching. As an indexing data structure for such a matching, we enhance the parameterized Burrows--Wheeler transform (pBWT) of Kim and Cho with techniques derived from the extended Burrows--Wheeler transform of Mantaci et al., obtaining time and space complexities similar to the pBWT.

    researchmap

  • Answer Set Programming を用いた圧縮指標の計算

    クップル ドミニク, 番原 睦則

    2024.2

    　More details

    Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    researchmap

  • Constructing and Indexing the Bijective and Extended Burrows–Wheeler Transform Reviewed

    Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piątkowski

    Inf. Comput.   ( 105153 )   2024.1

    　More details

    Language：English   Publishing type：Research paper (scientific journal)  

    Journal version of \cite{bannai19bbwt} and \cite{bannai21constructing} with more examples, higher detail in the explanations and an experimental evaluation of the presented construction algorithm with known algorithms constructing the BBWT.

    DOI： 10.1016/j.ic.2024.105153

    researchmap

  • パラメタ化 Burrows–Wheeler 変換の拡張

    Eric M. Osterkamp, Dominik Köppl

    Local Proceedings of コンピュテーション研究会   123 ( 325 )   20 - 20   2023.12

    　More details

    Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    researchmap

  • LZD と LZMW 分解の部分文字列圧縮について

    クップル ドミニク

    Local Proceedings of the 195th アルゴリズム研究会   195 ( 1 )   1 - 3   2023.11

    　More details

    Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    researchmap

  • lex-parse の圧縮感度

    中島 祐人, クップル ドミニク, 舩越 満, 稲永 俊介

    Local Proceedings of the 195th アルゴリズム研究会   195 ( 2 )   1 - 3   2023.11

    　More details

    Language：Japanese   Publishing type：(MISC) Institution technical report and pre-print, etc.  

    researchmap

  • Acceleration of FM-Index Queries Through Prefix-Free Parsing Reviewed International coauthorship

    Aaron Hong; Marco Oliva; Dominik Köppl; Hideo Bannai; Christina Boucher; Travis Gagie

    Proc. WABI   273   13:1 - 13:16   2023.9

    　More details

    Language：English   Publishing type：Research paper (international conference proceedings)  

    By storing additionally to the FM-index the index of \cite{deng22fm}, we can make use of both to accelerate counting queries for all pattern lengths and the expense of more space compared to the FM-index.

    DOI： 10.4230/LIPIcs.WABI.2023.13

    researchmap

▼display all

Books and Other Publications

  • Acta Informatica - Topical Collection on Advances in String Processing Algorithms and String Data Structures Reviewed International journal

    Dominik Köppl, Golnaz Badkobeh（ Role： Joint EditorLeading Guest Editors）

    Springer  2024 

    　More details

    Language：English  

    researchmap

Presentations

  • 準リアルタイム接尾辞木構築に関する応用について International coauthorship

    Dominik Köppl, Gregory Kucherov

    Local Proceedings of the 206th アルゴリズム研究会  2026.1 

    　More details

    Language：Japanese   Presentation type：Oral presentation(general)  

    We apply Breslauer-Italiano's near-real-time suffix tree construction to solve various string problems such as the LZ77 factorization and the computation of all minimal unique substrings in near real-time.

    Other Link： https://dkppl.de/index.html#bibbasename_algoken26realtime

  • LZW の圧縮感度

    三神 摩周, クップル ドミニク

    Local Proceedings of the LA Symposium Winter 2025  2026.1 

    　More details

    Language：Japanese   Presentation type：Oral presentation(general)  

    We translate the proofs of Akagi et al. of the compression sensitivity for LZ78 to LZW, obtaining the same stated complexities for the additive and multiplicative sensitivity by slightly changing the used lower bound string families.

    Other Link： https://dkppl.de/index.html#bibbasename_la26lzw

  • 疎行列圧縮による二重対数行列幅の実現 International coauthorship

    Dominik Köppl, Vincent Limouzy, Andrea Marino, Jannik Olbrich, Giulia Punzi, Takeaki Uno

    Local Proceedings of the LA Symposium Winter 2025  2026.1 

    　More details

    Language：Japanese   Presentation type：Oral presentation(general)  

    We devise a dynamic programming approach that solves the matrix compression problem. Given the rows of the matrix is our input size parameter, it works in polynomial time for logarithmic matrix widths if there are at most logarithmically many different rows, or otherwise for double-logarithmic matrix widths.

    Other Link： https://dkppl.de/index.html#bibbasename_la26matrix

  • 一次元データの効率的な処理手法の開発

    Dominik Köppl

    山梨県大村智人材育成基金 若手研究者奨励事業 第７回研究成果報告会  2025.12 

    　More details

    Language：Japanese   Presentation type：Oral presentation(general)  

    Presentation of the result of \cite{koppl24maw}.

    Other Link： https://dkppl.de/index.html#bibbasename_yamanashi25absent

  • Substring Compression Variants

    Dominik Köppl

    Invited talk at University of Ulm and the Bézout Labex colloquium  2025.8 

    　More details

    Language：English   Presentation type：Oral presentation(general)  

    The talk combines the results of the journal papers \cite{koppl21nonoverlapping}, \cite{koppl25substring}, and \cite{shibata24cdawg} for the substring compression problem of LZ78 and some of its derivates.

    Other Link： https://dkppl.de/index.html#bibbasename_talk25substring

  • 複数文学列に対するデカルト木円形パターン照合の索引

    Eric Osterkamp, Dominik Köppl

    Local Proceedings of the LA Symposium Summer 2025  2025.7 

    　More details

    Language：Japanese   Presentation type：Oral presentation(general)  

    Presentation of the paper \cite{osterkamp25extending} in Japanese.

    Other Link： https://dkppl.de/index.html#bibbasename_la25cbwt

  • Compression Sensitivity of the Bijective Burrows-Wheeler transform

    Hyodam Jeon and Dominik Köppl

    International Workshop on Discrete Mathematics and Algorithms  2025.3 

    　More details

    Language：English   Presentation type：Oral presentation(general)  

  • Overcoming boundaries of AI: future prospects

    Dominik Köppl

    EU-Japan AI Bridge – Connecting International Researchers and the Japanese AI Start-up Scene  2024.10 

    　More details

    Language：English   Presentation type：Oral presentation(general)  

    researchmap

  • Enumerating full binary trees in polynomial delay International conference

    Yasuko Matsui; Hirotaka Ono; Dominik Koeppl

    25th International Symposium on Mathematical Programming (ISMP)  2024.7 

    　More details

    Language：English   Presentation type：Oral presentation(general)  

    researchmap

  • ZDDを用いた最小文字列アトラクタの列挙

    藤岡 祐太; 斎藤 寿樹; クップル ドミニク

    日本オペレーションズ・リサーチ学会 九州支部 九州地区におけるOR若手研究交流会  2023.10 

    　More details

    Language：Japanese   Presentation type：Oral presentation(general)  

    researchmap

▼display all

Teaching Experience (On-campus)

▼display all

Teaching Experience

Guidance results

  • 2025

    Type：Undergraduate （Major A course）graduation thesis guidance

    Number of people receiving guidance ：2people 

Professional Memberships

Committee Memberships

  • 36th Data Compression Conference   program committee  

    2026   

    　 More details

    Committee type：Society

    DCC, link: https://datacompressionconference.org/

    researchmap

  • Symposium on Experimental Algorithms   program committee  

    2025   

    　 More details

    Committee type：Society

    SEA, link: https://regindex.github.io/sea2025.github.io/

    researchmap

  • 36th International Workshop on Combinatorial Algorithms   program committee  

    2025   

    　 More details

    Committee type：Society

    IWOCA, link: https://www.cs.montana.edu/bhz/iwoca2025

    researchmap

  • 36th International Symposium on Algorithms and Computation   program committee  

    2025   

    　 More details

    Committee type：Society

    ISAAC, link: https://isaac2025.csie.ncku.edu.tw/

    researchmap

  • 32nd International Symposium on String Processing and Information Retrieval   program committee  

    2025   

    　 More details

    Committee type：Society

    SPIRE, link: https://sites.google.com/view/spire-2025

    researchmap

  • 23rd Symposium on Experimental Algorithms   program committee  

    2025   

    　 More details

    Committee type：Society

    SEA, link: https://regindex.github.io/sea2025.github.io/

    researchmap

  • 28th Prague Stringology Conference   program committee  

    2025   

    　 More details

    Committee type：Society

    PSC, link: http://www.stringology.org/event/2025/

    researchmap

  • 27th Prague Stringology Conference   co-chair of the program committee  

    2024   

    　 More details

    Committee type：Society

    PSC, link: http://www.stringology.org/event/2024/

    researchmap

  • 31st International Symposium on String Processing and Information Retrieval   program committee  

    2024   

    　 More details

    Committee type：Society

    SPIRE, link: http://computo.fismat.umich.mx/spire2024/committees.html

    researchmap

  • 35th Annual Symposium on Combinatorial Pattern Matching   program committee  

    2024   

    　 More details

    Committee type：Society

    CPM, link: https://cpm2024.github.io/

    researchmap

  • StringMasters   local organizing committee  

    2024   

    　 More details

    Committee type：Society

    StringMasters, link: https://cpm2024.github.io/stringmasters.html

    researchmap

  • 35th Annual Symposium on Combinatorial Pattern Matching   local organizing committee  

    2024   

    　 More details

    Committee type：Society

    CPM, link: https://cpm2024.github.io/

    researchmap

  • 24th International Workshop on Algorithms in Bioinformatics   program committee  

    2024   

    　 More details

    Committee type：Society

    WABI, link: https://algo-conference.org/2024/wabi/

    researchmap

  • 32nd European Symposium on Algorithms   program committee  

    2024   

    　 More details

    Committee type：Society

    ESA, link: https://algo-conference.org/2024/esa/

    researchmap

  • Workshop on Emerging Results in Data Science and Engineering   program committee  

    2024   

    　 More details

    Committee type：Society

    ERDSE, link: https://erdse2024.github.io/

    researchmap

  • 49th International Conference on Current Trends in Theory and Practice of Computer Science   program committee  

    2024   

    　 More details

    Committee type：Society

    SOFSEM, link: https://www.uni-trier.de/en/universitaet/fachbereiche-faecher/fachbereich-iv/faecher/informatikwissenschaften/professuren/theoretische-informatik/research/conferences-and-workshops/sofsem-2024

    researchmap

  • 30th International Computing and Combinatorics Conference   program committee  

    2024   

    　 More details

    Committee type：Society

    COCOON, link: https://anl.sjtu.edu.cn/cocoon2024/

    researchmap

▼display all

Academic Activities

▼display all