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 |
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth
|
---|---|
Chapter number | 57 |
Book title |
Graph Drawing
|
Published by |
Springer, Berlin, Heidelberg, September 2004
|
DOI | 10.1007/978-3-540-31843-9_57 |
Book ISBNs |
978-3-54-024528-5, 978-3-54-031843-9
|
Authors |
Erik D. Demaine, MohammadTaghi Hajiaghayi, Demaine, Erik D., Hajiaghayi, MohammadTaghi |
Mendeley readers
The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Canada | 1 | 8% |
Unknown | 12 | 92% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 3 | 23% |
Lecturer | 2 | 15% |
Lecturer > Senior Lecturer | 1 | 8% |
Student > Bachelor | 1 | 8% |
Other | 1 | 8% |
Other | 2 | 15% |
Unknown | 3 | 23% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 6 | 46% |
Mathematics | 2 | 15% |
Agricultural and Biological Sciences | 1 | 8% |
Unknown | 4 | 31% |