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 Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
|
---|---|
Chapter number | 32 |
Book title |
Algorithms — ESA 2001
|
Published by |
Springer, Berlin, Heidelberg, August 2001
|
DOI | 10.1007/3-540-44676-1_32 |
Book ISBNs |
978-3-54-042493-2, 978-3-54-044676-7
|
Authors |
Dimitrios M. Thilikos, Maria J. Serna, Hans L. Bodlaender, Thilikos, Dimitrios M., Serna, Maria J., Bodlaender, Hans L. |
Mendeley readers
The data shown below were compiled from readership statistics for 6 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 6 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Professor | 2 | 33% |
Student > Doctoral Student | 1 | 17% |
Lecturer | 1 | 17% |
Student > Ph. D. Student | 1 | 17% |
Professor > Associate Professor | 1 | 17% |
Other | 0 | 0% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 33% |
Mathematics | 1 | 17% |
Agricultural and Biological Sciences | 1 | 17% |
Unknown | 2 | 33% |