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 Computing Graph Bisections
|
---|---|
Chapter number | 8 |
Book title |
Graph-Theoretic Concepts in Computer Science
|
Published by |
Springer, Berlin, Heidelberg, June 2013
|
DOI | 10.1007/978-3-642-45043-3_8 |
Book ISBNs |
978-3-64-245042-6, 978-3-64-245043-3
|
Authors |
René van Bevern, Andreas Emil Feldmann, Manuel Sorge, Ondřej Suchý, Bevern, René van, Feldmann, Andreas Emil, Sorge, Manuel, Suchý, Ondřej, van Bevern, René |
Mendeley readers
The data shown below were compiled from readership statistics for 5 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Unknown | 5 | 100% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 2 | 40% |
Professor > Associate Professor | 1 | 20% |
Researcher | 1 | 20% |
Lecturer | 1 | 20% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 2 | 40% |
Mathematics | 1 | 20% |
Agricultural and Biological Sciences | 1 | 20% |
Chemistry | 1 | 20% |