Maksim S. Nikolaev

Available identifiers

zbMath Open nikolaev.maksim-sMaRDI QIDQ2146124

List of research outcomes

Publication	Date of Publication	Type
The greedy algorithm for the shortest common superstring problem is a \(\frac 12\)-approximation in terms of compression: a simple proof	2024-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q6075924	2023-09-20	Paper
Collapsing Superstring Conjecture	2023-02-03	Paper
All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent	2022-06-15	Paper

Research outcomes over time

This page was built for person: Maksim S. Nikolaev