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 Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
|
---|---|
Chapter number | 31 |
Book title |
Automata, Languages and Programming
|
Published in |
Lecture notes in computer science, January 2010
|
DOI | 10.1007/978-3-642-14165-2_31 |
Book ISBNs |
978-3-64-214164-5, 978-3-64-214165-2
|
Authors |
Guruswami, Venkatesan, Saket, Rishi, Venkatesan Guruswami, Rishi Saket |
Mendeley readers
The data shown below were compiled from readership statistics for 31 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
Country | Count | As % |
---|---|---|
United States | 1 | 3% |
Canada | 1 | 3% |
Unknown | 29 | 94% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 10 | 32% |
Professor > Associate Professor | 5 | 16% |
Student > Master | 4 | 13% |
Researcher | 4 | 13% |
Lecturer | 2 | 6% |
Other | 2 | 6% |
Unknown | 4 | 13% |
Readers by discipline | Count | As % |
---|---|---|
Computer Science | 22 | 71% |
Mathematics | 3 | 10% |
Agricultural and Biological Sciences | 1 | 3% |
Physics and Astronomy | 1 | 3% |
Unknown | 4 | 13% |