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 |
On the Parameterized Complexity of Layered Graph Drawing
|
---|---|
Chapter number | 41 |
Book title |
Algorithms — ESA 2001
|
Published in |
Lecture notes in computer science, August 2001
|
DOI | 10.1007/3-540-44676-1_41 |
Book ISBNs |
978-3-54-042493-2, 978-3-54-044676-7
|
Authors |
Dujmović, V., Fellows, M., Hallett, M., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F., Suderman, M., Whitesides, S., Wood, D. R., V. Dujmović, M. Fellows, M. Hallett, M. Kitching, G. Liotta, C. McCartin, N. Nishimura, P. Ragde, F. Rosamond, M. Suderman, S. Whitesides, D. R. Wood |
Editors |
Heide, Friedhelm Meyer |
Mendeley readers
The data shown below were compiled from readership statistics for 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 8 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor > Associate Professor | 2 | 25% |
Student > Ph. D. Student | 1 | 13% |
Researcher | 1 | 13% |
Lecturer | 1 | 13% |
Unknown | 3 | 38% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 38% |
Mathematics | 1 | 13% |
Agricultural and Biological Sciences | 1 | 13% |
Unknown | 3 | 38% |