 | 2009 |
|---|
| 15 |       | Bodo Manthey,
L. Shankar Ram:
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems.
Algorithmica 53(1): 69-88 (2009) |
| 14 | | Markus Bläser,
L. Shankar Ram,
Maxim Sviridenko:
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems.
Oper. Res. Lett. 37(3): 176-180 (2009) |
| 2008 |
|---|
| 13 | | Markus Bläser,
L. Shankar Ram:
Approximately Fair Cost Allocation in Metric Traveling Salesman Games.
Theory Comput. Syst. 43(1): 19-37 (2008) |
| 2007 |
|---|
| 12 | | L. Sunil Chandran,
L. Shankar Ram:
On the relationship between ATSP and the cycle cover problem.
Theor. Comput. Sci. 370(1-3): 218-228 (2007) |
| 2006 |
|---|
| 11 | | Bodo Manthey,
L. Shankar Ram:
Approximation Algorithms for Multi-criteria Traveling Salesman Problems.
WAOA 2006: 302-315 |
| 10 | | Bodo Manthey,
L. Shankar Ram:
Approximation Algorithms for Multi-Criteria Traveling Salesman Problems
CoRR abs/cs/0606040: (2006) |
| 9 | | Zuzana Beerliova,
Felix Eberhard,
Thomas Erlebach,
Alexander Hall,
Michael Hoffmann,
Matús Mihalák,
L. Shankar Ram:
Network Discovery and Verification.
IEEE Journal on Selected Areas in Communications 24(12): 2168-2181 (2006) |
| 2005 |
|---|
| 8 | | Zuzana Beerliova,
Felix Eberhard,
Thomas Erlebach,
Alexander Hall,
Michael Hoffmann,
Matús Mihalák,
L. Shankar Ram:
Network Discovery and Verification.
Algorithms for Optimization with Incomplete Information 2005 |
| 7 | | Markus Bläser,
L. Shankar Ram:
An Improved Approximation Algorithm for TSP with Distances One and Two.
FCT 2005: 504-515 |
| 6 | | Markus Bläser,
L. Shankar Ram,
Maxim Sviridenko:
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems.
WADS 2005: 350-359 |
| 5 | | Markus Bläser,
L. Shankar Ram:
Approximate Fair Cost Allocation in Metric Traveling Salesman Games.
WAOA 2005: 82-95 |
| 4 | | Zuzana Beerliova,
Felix Eberhard,
Thomas Erlebach,
Alexander Hall,
Michael Hoffmann,
Matús Mihalák,
L. Shankar Ram:
Network Discovery and Verification.
WG 2005: 127-138 |
| 2004 |
|---|
| 3 | | L. Sunil Chandran,
L. Shankar Ram:
On the Number of Minimum Cuts in a Graph.
SIAM J. Discrete Math. 18(1): 177-194 (2004) |
| 2002 |
|---|
| 2 | | L. Sunil Chandran,
L. Shankar Ram:
On the Number of Minimum Cuts in a Graph.
COCOON 2002: 220-229 |
| 1 | | L. Sunil Chandran,
L. Shankar Ram:
Approximations for ATSP with Parametrized Triangle Inequality.
STACS 2002: 227-237 |
