Maksim Nikolaev

According to our database, Maksim Nikolaev authored at least 6 papers between 2019 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Greedy Conjecture for the Shortest Common Superstring Problem and Its Strengthenings.

Maksim S. Nikolaev

Proceedings of the String Processing and Information Retrieval, 2024

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

Proceedings of the 2024 Symposium on Simplicity in Algorithms, 2024

2021

All instantiations of the greedy algorithm for the shortest superstring problem are equivalent.

Maksim Nikolaev

CoRR, 2021

All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent.

Maksim S. Nikolaev

Proceedings of the String Processing and Information Retrieval, 2021

Minimum Common String Partition: Exact Algorithms.

Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov

Proceedings of the 29th Annual European Symposium on Algorithms, 2021

2019

Collapsing Superstring Conjecture.

Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev

Proceedings of the Approximation, 2019