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 |
Reoptimization of the Shortest Common Superstring Problem
|
---|---|
Chapter number | 8 |
Book title |
Combinatorial Pattern Matching
|
Published by |
Springer, Berlin, Heidelberg, June 2009
|
DOI | 10.1007/978-3-642-02441-2_8 |
Book ISBNs |
978-3-64-202440-5, 978-3-64-202441-2
|
Authors |
Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královič, Tobias Mömke, Sebastian Seibert, Anna Zych, Bilò, Davide, Böckenhauer, Hans-Joachim, Komm, Dennis, Královič, Richard, Mömke, Tobias, Seibert, Sebastian, Zych, Anna |
Mendeley readers
The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 1 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 100% |