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
Demo Data from SIGIR 2026 / reviewers in the wild / expert

M. S. Madanlal

dblp:19/6812 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1997
—ORCID · none

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

Theory of computation · 2 · 1 first-authorDatabases, data management, data science and information retrieval · 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
Approximation and online algorithms · 50% Computational complexity · 50%

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

TopicWeightPapersLastEvidence papers
Computational complexity
hardness of approximation		 0.011997
Restrictions of Minimum Spanner Problems · Inf. Comput. 1997
Approximation and online algorithms › approximation algorithms › network design
spanner problems		 0.011997
Restrictions of Minimum Spanner Problems · Inf. Comput. 1997
YearPublicationVenuePosition
1997 Restrictions of Minimum Spanner Problems
G. Venkatesan, Udi Rotics, M. S. Madanlal, Johann A. Makowsky, C. Pandu Rangan
 Inf. Comput.3
1996 Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs
M. S. Madanlal, G. Venkatesan, C. Pandu Rangan
 Inf. Process. Lett.1