Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

R. Mahesh 0002

dblp:237/2659 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 100%

Topics — the 1 heaviest of 1, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph layout
graph bandwidth
0.011991
On Finding the Minimum Bandwidth of Interval Graphs · Inf. Comput. 1991
YearPublicationVenuePosition
1991 On Finding the Minimum Bandwidth of Interval Graphs
R. Mahesh 0002, C. Pandu Rangan, Aravind Srinivasan
Inf. Comput.1