Approximations for ATSP with Parametrized Triangle Inequality. - L. Sunil Chandran; L. Shankar Ram (STACS, 2002)

On the Number of Minimum Cuts in a Graph. - L. Sunil Chandran; L. Shankar Ram (SIAM J. Discret. Math., 2004)

An Improved Approximation Algorithm for TSP with Distances One and Two. - Markus Bläser; L. Shankar Ram (FCT, 2005)

Approximate Fair Cost Allocation in Metric Traveling Salesman Games. - Markus Bläser; L. Shankar Ram (WAOA, 2005)

Network Discovery and Verification. - Zuzana Beerliova; Felix Eberhard; Thomas Erlebach; Alexander Hall; Michael Hoffmann 002; Matús Mihalák; L. Shankar Ram (IEEE J. Sel. Areas Commun., 2006)

On the relationship between ATSP and the cycle cover problem. - L. Sunil Chandran; L. Shankar Ram (Theor. Comput. Sci., 2007)

Approximately Fair Cost Allocation in Metric Traveling Salesman Games. - Markus Bläser; L. Shankar Ram (Theory Comput. Syst., 2008)

Approximation Algorithms for Multi-Criteria Traveling Salesman Problems. - Bodo Manthey; L. Shankar Ram (Algorithmica, 2009)

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. - Markus Bläser; L. Shankar Ram; Maxim Sviridenko (Oper. Res. Lett., 2009)