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 |
Tight Bounds for Linkages in Planar Graphs
|
---|---|
Chapter number | 10 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 2011
|
DOI | 10.1007/978-3-642-22006-7_10 |
Book ISBNs |
978-3-64-222005-0, 978-3-64-222006-7
|
Authors |
Isolde Adler, Stavros G. Kolliopoulos, Philipp Klaus Krause, Daniel Lokshtanov, Saket Saurabh, Dimitrios Thilikos, Adler, Isolde, Kolliopoulos, Stavros G., Krause, Philipp Klaus, Lokshtanov, Daniel, Saurabh, Saket, Thilikos, Dimitrios |
Mendeley readers
The data shown below were compiled from readership statistics for 22 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 22 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 7 | 32% |
Student > Master | 5 | 23% |
Professor | 2 | 9% |
Lecturer | 2 | 9% |
Researcher | 2 | 9% |
Other | 2 | 9% |
Unknown | 2 | 9% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 16 | 73% |
Mathematics | 1 | 5% |
Agricultural and Biological Sciences | 1 | 5% |
Physics and Astronomy | 1 | 5% |
Unknown | 3 | 14% |