default search action

combined dblp search
author search
venue search
publication search

ask others

Maksim Nikolaev

Maksim S. Nikolaev

> Home > Persons

Person information

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

2020 – today

see FAQ

What is the meaning of the colors in the publication lists?

2024
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/sosa/KaluginN24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/sosa/KaluginN24
Pavel E. Kalugin, Maksim S. Nikolaev:
The greedy algorithm for the Shortest Common Superstring problem is a ½-approximation in terms of compression: a simple proof. SOSA 2024: 97-99
[i2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2407-20422
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2407-20422
Maksim Nikolaev:
Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings. CoRR abs/2407.20422 (2024)
2021
[c3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/esa/CyganKMNR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/esa/CyganKMNR21
Marek Cygan, Alexander S. Kulikov, Ivan Mihajlin, Maksim Nikolaev, Grigory Reznikov:
Minimum Common String Partition: Exact Algorithms. ESA 2021: 35:1-35:16
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/spire/Nikolaev21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/spire/Nikolaev21
Maksim S. Nikolaev:
All Instantiations of the Greedy Algorithm for the Shortest Common Superstring Problem are Equivalent. SPIRE 2021: 61-67
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2102-05579
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2102-05579
Maksim Nikolaev:
All instantiations of the greedy algorithm for the shortest superstring problem are equivalent. CoRR abs/2102.05579 (2021)

2010 – 2019

see FAQ

What is the meaning of the colors in the publication lists?

2019
[c1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/approx/GolovnevKLMN19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/GolovnevKLMN19
Alexander Golovnev, Alexander S. Kulikov, Alexander Logunov, Ivan Mihajlin, Maksim Nikolaev:
Collapsing Superstring Conjecture. APPROX-RANDOM 2019: 26:1-26:23

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.