Finding Distinct Subpalindromes Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (Stringology, 2013)

Online Square Detection. - Dmitry Kosolobov (CoRR, 2014)

Online Repetition Detection With Backtracking. - Dmitry Kosolobov (CoRR, 2014)

$ mathrm{Pal}^k$ Is Linear Recognizable Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (CoRR, 2014)

Online Detection of Repetitions with Backtracking. - Dmitry Kosolobov (CPM, 2015)

Faster Lightweight Lempel-Ziv Parsing. - Dmitry Kosolobov (MFCS (2), 2015)

Pal k is Linear Recognizable Online. - Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (SOFSEM, 2015)

Lempel-Ziv Factorization May Be Harder Than Computing All Runs. - Dmitry Kosolobov (STACS, 2015)

Detecting Unary Patterns. - Dmitry Kosolobov; Florin Manea; Dirk Nowotka (CoRR, 2016)

Computing runs on a general alphabet. - Dmitry Kosolobov (Inf. Process. Lett., 2016)

Finding the leftmost critical factorization on unordered alphabet. - Dmitry Kosolobov (Theor. Comput. Sci., 2016)

Palindromic Length in Linear Time. - Kirill Borozdin; Dmitry Kosolobov; Mikhail Rubinchik; Arseny M. Shur (CPM, 2017)

LZ-End Parsing in Compressed Space. - Dominik Kempa; Dmitry Kosolobov (DCC, 2017)

LZ-End Parsing in Linear Time. - Dominik Kempa; Dmitry Kosolobov (ESA, 2017)

On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. - Golnaz Badkobeh; Travis Gagie; Shunsuke Inenaga; Tomasz Kociumaka; Dmitry Kosolobov; Simon J. Puglisi (SPIRE, 2017)

Detecting One-Variable Patterns. - Dmitry Kosolobov; Florin Manea; Dirk Nowotka (SPIRE, 2017)

Tight lower bounds for the longest common extension problem. - Dmitry Kosolobov (Inf. Process. Lett., 2017)

Run Compressed Rank/Select for Large Alphabets. - José Fuentes-Sepúlveda; Juha Kärkkäinen; Dmitry Kosolobov; Simon J. Puglisi (DCC, 2018)

Relations Between Greedy and Bit-Optimal LZ77 Encodings. - Dmitry Kosolobov (STACS, 2018)

Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. - Tuukka Norri; Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen (WABI, 2018)

Minimum Segmentation for Pan-genomic Founder Reconstruction in Optimal Time. - Tuukka Norri; Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen (CoRR, 2018)

Compressed Multiple Pattern Matching. - Dmitry Kosolobov; Nikita Sivukhin (CPM, 2019)

Linear Time Maximum Segmentation Problems in Column Stream Model. - Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen; Tuukka Norri (SPIRE, 2019)

Linear time minimum segmentation enables scalable founder reconstruction. - Tuukka Norri; Bastien Cazaux; Dmitry Kosolobov; Veli Mäkinen (Algorithms Mol. Biol., 2019)

Comparison of LZ77-type parsings. - Dmitry Kosolobov; Arseny M. Shur (Inf. Process. Lett., 2019)

Optimal Skeleton Huffman Trees Revisited. - Dmitry Kosolobov; Oleg Merkurev (CSR, 2020)

Ordered Strip Packing. - Kevin Buchin; Dmitry Kosolobov; Willem Sonke; Bettina Speckmann; Kevin Verbeek (LATIN, 2020)

Lempel-Ziv-Like Parsing in Small Space. - Dmitry Kosolobov; Daniel Valenzuela 001; Gonzalo Navarro 001; Simon J. Puglisi (Algorithmica, 2020)

Weighted Ancestors in Suffix Trees Revisited. - Djamal Belazzougui; Dmitry Kosolobov; Simon J. Puglisi; Rajeev Raman (CPM, 2021)

Lempel-Ziv Parsing for Sequences of Blocks. - Dmitry Kosolobov; Daniel Valenzuela 001 (Algorithms, 2021)

The Efficiency of the ANS Entropy Encoding. - Dmitry Kosolobov (CoRR, 2022)

Internal shortest absent word queries in constant time and linear space. - Golnaz Badkobeh; Panagiotis Charalampopoulos; Dmitry Kosolobov; Solon P. Pissis (Theor. Comput. Sci., 2022)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing. - Dmitry Kosolobov (CPM, 2024)

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. - Dmitry Kosolobov; Nikita Sivukhin (CPM, 2024)

Closed Repeats. - Dmitry Kosolobov (CoRR, 2024)

Relating Left and Right Extensions of Maximal Repeats. - Shunsuke Inenaga; Dmitry Kosolobov (CoRR, 2024)