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.
Timeline
Mendeley readers
Chapter title |
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
|
---|---|
Chapter number | 29 |
Book title |
Mathematical Foundations of Computer Science 2014
|
Published by |
Springer, Berlin, Heidelberg, August 2014
|
DOI | 10.1007/978-3-662-44465-8_29 |
Book ISBNs |
978-3-66-244464-1, 978-3-66-244465-8
|
Authors |
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard, Hansen, Kristoffer Arnsfelt, Komarath, Balagopal, Sarma, Jayalal, Skyum, Sven, Talebanfard, Navid |
Mendeley readers
The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 2 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 50% |
Unknown | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 1 | 50% |
Unknown | 1 | 50% |