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 |
Faster Algorithms for Computing Longest Common Increasing Subsequences
|
---|---|
Chapter number | 30 |
Book title |
Combinatorial Pattern Matching
|
Published by |
Springer, Berlin, Heidelberg, July 2006
|
DOI | 10.1007/11780441_30 |
Book ISBNs |
978-3-54-035455-0, 978-3-54-035461-1
|
Authors |
Gerth Stølting Brodal, Kanela Kaligosi, Irit Katriel, Martin Kutz, Brodal, Gerth Stølting, Kaligosi, Kanela, Katriel, Irit, Kutz, Martin |
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 % |
---|---|---|
Professor > Associate Professor | 1 | 100% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 100% |
Medicine and Dentistry | 1 | 100% |