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 |
A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves
|
---|---|
Chapter number | 20 |
Book title |
Mathematical Foundations of Computer Science 2003
|
Published by |
Springer, Berlin, Heidelberg, August 2003
|
DOI | 10.1007/978-3-540-45138-9_20 |
Book ISBNs |
978-3-54-040671-6, 978-3-54-045138-9
|
Authors |
Paul S. Bonsma, Tobias Brueggemann, Gerhard J. Woeginger, Bonsma, Paul S., Brueggemann, Tobias, Woeginger, Gerhard J. |
Mendeley readers
The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United Kingdom | 1 | 11% |
Unknown | 8 | 89% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Lecturer | 2 | 22% |
Student > Master | 2 | 22% |
Professor | 1 | 11% |
Lecturer > Senior Lecturer | 1 | 11% |
Researcher | 1 | 11% |
Other | 1 | 11% |
Unknown | 1 | 11% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 5 | 56% |
Mathematics | 1 | 11% |
Agricultural and Biological Sciences | 1 | 11% |
Unknown | 2 | 22% |