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 |
Computing a Minimum-Depth Planar Graph Embedding in O(n
4) Time
|
---|---|
Chapter number | 26 |
Book title |
Algorithms and Data Structures
|
Published by |
Springer Berlin Heidelberg, August 2007
|
DOI | 10.1007/978-3-540-73951-7_26 |
Book ISBNs |
978-3-54-073948-7, 978-3-54-073951-7
|
Authors |
Patrizio Angelini, Giuseppe Di Battista, Maurizio Patrignani |
Editors |
Frank Dehne, Jörg-Rüdiger Sack, Norbert Zeh |
Mendeley readers
The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 7 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 2 | 29% |
Student > Doctoral Student | 1 | 14% |
Lecturer | 1 | 14% |
Researcher | 1 | 14% |
Professor > Associate Professor | 1 | 14% |
Other | 0 | 0% |
Unknown | 1 | 14% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 3 | 43% |
Mathematics | 2 | 29% |
Agricultural and Biological Sciences | 1 | 14% |
Unknown | 1 | 14% |