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 |
The approximation of maximum subgraph problems
|
---|---|
Chapter number | 60 |
Book title |
Automata, Languages and Programming
|
Published by |
Springer, Berlin, Heidelberg, July 1993
|
DOI | 10.1007/3-540-56939-1_60 |
Book ISBNs |
978-3-54-056939-8, 978-3-54-047826-3
|
Authors |
Carsten Lund, Mihalis Yannakakis, Lund, Carsten, Yannakakis, Mihalis |
Mendeley readers
The data shown below were compiled from readership statistics for 20 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
Israel | 1 | 5% |
Germany | 1 | 5% |
Unknown | 18 | 90% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 7 | 35% |
Researcher | 5 | 25% |
Professor | 4 | 20% |
Student > Bachelor | 1 | 5% |
Student > Master | 1 | 5% |
Other | 1 | 5% |
Unknown | 1 | 5% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 16 | 80% |
Mathematics | 1 | 5% |
Physics and Astronomy | 1 | 5% |
Unknown | 2 | 10% |