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

Jeyakesavan Veerasamy

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

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

Theory of computation · 3Software engineering, systems software and programming languages · 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
Algorithms and data structures · 50% Graph algorithms and graph theory · 50%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory › graph algorithms › routing
approximation algorithms for routing		 0.011999
Approximation Algorithms for the Asymmetric Postman Problem · SODA 1999
YearPublicationVenuePosition
1999 Approximation Algorithms for the Asymmetric Postman Problem
Balaji Raghavachari, Jeyakesavan Veerasamy
 SODA2
1999 Spare capacity assignment in telecom networks using path restoration and further improvement using traffic splitting
Jeyakesavan Veerasamy, S. Venkatesan 0001, Jay C. Shah
 J. Syst. Softw.1
1999 A 3/2-Approximation Algorithm for the Mixed Postman Problem
abstract
The mixed postman problem, a generalization of the Chinese postman problem, is that of finding the shortest tour that traverses each edge of a given mixed graph (a graph containing both undirected and directed edges) at least once. The problem is solvable in polynomial time either if the graph is undirected or if the graph is directed, but it is NP-hard in mixed graphs. An approximation algorithm with a performance ratio of 3/2 for the postman problem on mixed graphs is presented.
Balaji Raghavachari, Jeyakesavan Veerasamy
 SIAM J. Discret. Math.2
1998 Approximation Algorithms for the Mixed Postman Problem
Balaji Raghavachari, Jeyakesavan Veerasamy
 IPCO2