| 2026 | CPM | Compressed Index with Construction in Compressed Space. | Dmitry Kosolobov |
| 2024 | CPM | Simplified Tight Bounds for Monotone Minimal Perfect Hashing. | Dmitry Kosolobov |
| 2024 | CPM | Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space. | Dmitry Kosolobov, Nikita Sivukhin |
| 2021 | CPM | Weighted Ancestors in Suffix Trees Revisited. | Djamal Belazzougui, Dmitry Kosolobov, Simon J. Puglisi, Rajeev Raman |
| 2020 | CSR | Optimal Skeleton Huffman Trees Revisited. | Dmitry Kosolobov, Oleg Merkurev |
| 2020 | LATIN | Ordered Strip Packing. | Kevin Buchin, Dmitry Kosolobov, Willem Sonke, Bettina Speckmann, Kevin Verbeek |
| 2019 | CPM | Compressed Multiple Pattern Matching. | Dmitry Kosolobov, Nikita Sivukhin |
| 2019 | SPIRE | Linear Time Maximum Segmentation Problems in Column Stream Model. | Bastien Cazaux, Dmitry Kosolobov, Veli Mkinen, Tuukka Norri |
| 2018 | DCC | Run Compressed Rank/Select for Large Alphabets. | Jos Fuentes-Seplveda, Juha Krkkinen, Dmitry Kosolobov, Simon J. Puglisi |
| 2018 | STACS | Relations Between Greedy and Bit-Optimal LZ77 Encodings. | Dmitry Kosolobov |
| 2018 | WABI | Minimum Segmentation for Pan-genomic Founder Reconstruction in Linear Time. | Tuukka Norri, Bastien Cazaux, Dmitry Kosolobov, Veli Mkinen |
| 2017 | CPM | Palindromic Length in Linear Time. | Kirill Borozdin, Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur |
| 2017 | DCC | LZ-End Parsing in Compressed Space. | Dominik Kempa, Dmitry Kosolobov |
| 2017 | ESA | LZ-End Parsing in Linear Time. | Dominik Kempa, Dmitry Kosolobov |
| 2017 | SPIRE | On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation. | Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi |
| 2017 | SPIRE | Detecting One-Variable Patterns. | Dmitry Kosolobov, Florin Manea, Dirk Nowotka |
| 2015 | CPM | Online Detection of Repetitions with Backtracking. | Dmitry Kosolobov |
| 2015 | MFCS | Faster Lightweight Lempel-Ziv Parsing. | Dmitry Kosolobov |
| 2015 | STACS | Lempel-Ziv Factorization May Be Harder Than Computing All Runs. | Dmitry Kosolobov |
| 2015 | SOFSEM | Pal k is Linear Recognizable Online. | Dmitry Kosolobov, Mikhail Rubinchik, Arseny M. Shur |