| Year |
Citation |
Score |
| 2020 |
Ganguly A, Mehta T, Patel T, Sundaram R, Tiwari D. Resilience and coevolution of preferential interdependent networks Social Network Analysis and Mining. 10: 1-12. DOI: 10.1007/S13278-019-0614-6 |
0.303 |
|
| 2020 |
Gopalakrishnan R, Kanoulas D, Karuturi NN, Rangan CP, Rajaraman R, Sundaram R. Cache Me If You Can: Capacitated Selfish Replication Games in Networks Theory of Computing Systems \/ Mathematical Systems Theory. 64: 272-310. DOI: 10.1007/S00224-019-09939-7 |
0.361 |
|
| 2015 |
Samanta A, Zhou F, Sundaram R. SamaritanCloud: Secure infrastructure for scalable location-based services Computer Communications. 56: 1-13. DOI: 10.1016/J.Comcom.2014.08.013 |
0.587 |
|
| 2014 |
Laoutaris N, Poplawski L, Rajaraman R, Sundaram R, Teng SH. Bounded Budget Connection (BBC) games or how to make friends and influence people, on a budget Journal of Computer and System Sciences. 80: 1266-1284. DOI: 10.1016/J.Jcss.2014.04.013 |
0.328 |
|
| 2014 |
Fadaee SS, Farajtabar M, Sundaram R, Aslam JA, Passas N. The network you keep: Analyzing persons of interest using cliqster Asonam 2014 - Proceedings of the 2014 Ieee/Acm International Conference On Advances in Social Networks Analysis and Mining. 122-129. DOI: 10.1007/S13278-015-0302-0 |
0.336 |
|
| 2013 |
Zhou F, Goel M, Desnoyers P, Sundaram R. Scheduler vulnerabilities and coordinated attacks in cloud computing Journal of Computer Security. 21: 533-539. DOI: 10.3233/Jcs-130474 |
0.554 |
|
| 2013 |
Kintali S, Poplawski LJ, Rajaraman R, Sundaram R, Teng SH. Reducibility among fractional stability problems Siam Journal On Computing. 42: 2063-2113. DOI: 10.1137/120874655 |
0.359 |
|
| 2009 |
Laoutaris N, Smaragdakis G, Rodriguez P, Sundaram R. Delay tolerant bulk data transfers on the internet Sigmetrics/Performance'09 - Proceedings of the 11th International Joint Conference On Measurement and Modeling of Computer Systems. 37: 229-238. DOI: 10.1109/Tnet.2012.2237555 |
0.332 |
|
| 2006 |
Chen J, Rajaraman R, Sundaram R. Meet and merge: Approximation algorithms for confluent flows Journal of Computer and System Sciences. 72: 468-489. DOI: 10.1016/J.Jcss.2005.09.009 |
0.326 |
|
| 1999 |
Krumke SO, Noltemeier H, Wirth H, Marathe MV, Ravi R, Ravi SS, Sundaram R. Improving spanning trees by upgrading nodes Theoretical Computer Science. 221: 139-155. DOI: 10.1016/S0304-3975(99)00030-4 |
0.35 |
|
| 1999 |
Kumar SR, Russell A, Sundaram R. Approximating latin square extensions Algorithmica. 24: 128-138. DOI: 10.1007/Pl00009274 |
0.361 |
|
| 1999 |
Krumke SO, Marathe MV, Noltemeier H, Ravi R, Ravi SS, Sundaram R, Wirth H-. Improving Minimum Cost Spanning Trees by Upgrading Nodes Journal of Algorithms. 33: 92-111. DOI: 10.1006/Jagm.1999.1021 |
0.361 |
|
| 1998 |
Marathe MV, Ravi R, Sundaram R, Ravi SS, Rosenkrantz DJ, Hunt HB. Bicriteria Network Design Problems Journal of Algorithms. 28: 142-171. DOI: 10.1006/Jagm.1998.0930 |
0.37 |
|
| 1997 |
Kumar SR, Panigrahy R, Russell A, Sundaram R. A note on optical routing on trees Information Processing Letters. 62: 295-300. DOI: 10.1016/S0020-0190(97)00077-X |
0.338 |
|
| 1996 |
Ravi R, Sundaram R, Marathe MV, Rosenkrantz DJ, Ravi SS. Spanning Trees---Short or Small Siam Journal On Discrete Mathematics. 9: 178-200. DOI: 10.1137/S0895480194266331 |
0.351 |
|
| 1994 |
Sundaram R, Singh KS, Rangan CP. Treewidth of Circular-Arc Graphs Siam Journal On Discrete Mathematics. 7: 647-655. DOI: 10.1137/S0895480191193789 |
0.329 |
|
| 1993 |
Srikant R, Sundaram R, Singh KS, Rangan CP. Optimal path cover problem on block graphs and bipartite permutation graphs Theoretical Computer Science. 115: 351-357. DOI: 10.1016/0304-3975(93)90123-B |
0.314 |
|
| Show low-probability matches. |