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 |
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
|
---|---|
Chapter number | 57 |
Book title |
Algorithms – ESA 2013
|
Published by |
Springer, Berlin, Heidelberg, September 2013
|
DOI | 10.1007/978-3-642-40450-4_57 |
Book ISBNs |
978-3-64-240449-8, 978-3-64-240450-4
|
Authors |
Mark Jones, Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh, Ondřej Suchý, Jones, Mark, Lokshtanov, Daniel, Ramanujan, M. S., Saurabh, Saket, Suchý, Ondřej |
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 % |
---|---|---|
Japan | 1 | 50% |
Unknown | 1 | 50% |
Demographic breakdown
Readers by professional status | Count | As % |
---|---|---|
Student > Ph. D. Student | 1 | 50% |
Professor > Associate Professor | 1 | 50% |
Readers by discipline | Count | As % |
---|---|---|
Mathematics | 1 | 50% |
Computer Science | 1 | 50% |