You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
Chapter title |
Parameterized Complexity of Superstring Problems
|
---|---|
Chapter number | 8 |
Book title |
Combinatorial Pattern Matching
|
Published by |
Springer, Cham, June 2015
|
DOI | 10.1007/978-3-319-19929-0_8 |
Book ISBNs |
978-3-31-919928-3, 978-3-31-919929-0
|
Authors |
Ivan Bliznets, Fedor V. Fomin, Petr A. Golovach, Nikolay Karpov, Alexander S. Kulikov, Saket Saurabh, Bliznets, Ivan, Fomin, Fedor V., Golovach, Petr A., Karpov, Nikolay, Kulikov, Alexander S., Saurabh, Saket |
Mendeley readers
The data shown below were compiled from readership statistics for 3 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 3 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Researcher | 2 | 67% |
Unknown | 1 | 33% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 67% |
Unknown | 1 | 33% |