Collapsing Superstring Conjecture. - Alexander Golovnev; Alexander S. Kulikov; Alexander Logunov; Ivan Mihajlin; Maksim Nikolaev (APPROX-RANDOM, 2019)

Minimum Common String Partition: Exact Algorithms. - Marek Cygan; Alexander S. Kulikov; Ivan Mihajlin; Maksim Nikolaev; Grigory Reznikov (ESA, 2021)

All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent. - Maksim S. Nikolaev (SPIRE, 2021)

All instantiations of the greedy algorithm for the shortest superstring problem are equivalent. - Maksim Nikolaev (CoRR, 2021)

The greedy algorithm for the Shortest Common Superstring problem is a ½-approximation in terms of compression: a simple proof. - Pavel E. Kalugin; Maksim S. Nikolaev (SOSA, 2024)

Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings. - Maksim S. Nikolaev (SPIRE, 2024)

BOIL: Proof-Carrying Data from Accumulation of Correlated Holographic IOPs. - Tohru Kohrita; Maksim Nikolaev; Javier Silva 005 (IACR Cryptol. ePrint Arch., 2024)