The Combinatorics of Permutation Polytopes. - Louis J. Billera; Aravamuthan Sarangarajan (Formal Power Series and Algebraic Combinatorics, 1994)

All 0-1 Polytopes are Traveling Salesman Polytopes. - Louis J. Billera; Aravamuthan Sarangarajan (Comb., 1996)

Extremal Properties of 0/1-Polytopes. - Ulrich Kortenkamp; Jürgen Richter-Gebert; Aravamuthan Sarangarajan; Günter M. Ziegler (Discret. Comput. Geom., 1997)

A Lower Bound for Adjacencies on the Traveling Salesman Polytope. - Aravamuthan Sarangarajan (SIAM J. Discret. Math., 1997)

An Optimal Subset Cover for Broadcast Encryption. - Sarang Aravamuthan; Sachin Lodha (INDOCRYPT, 2005)

Covering Codes for Hats-on-a-line. - Sarang Aravamuthan; Sachin Lodha (Electron. J. Comb., 2006)

A Parallelization of ECDSA Resistant to Simple Power Analysis Attacks. - Sarang Aravamuthan; Viswanatha Rao Thumparthy (IACR Cryptol. ePrint Arch., 2006)

Identification of compositionally distinct regions in genomes using the centroid method. - Issaac Rajan; Sarang Aravamuthan; Sharmila S. Mande (Bioinform., 2007)

The average transmission overhead for broadcast encryption. - Sarang Aravamuthan; Sachin Lodha (J. Math. Cryptol., 2007)

Separable Hash Functions. - Sarang Aravamuthan (IACR Cryptol. ePrint Arch., 2010)

e-Valuate: A Two-player Game on Arithmetic Expressions - Sarang Aravamuthan; Biswajit Ganguly (CoRR, 2012)

Network Intrusion Detection via Flow-to-Image Conversion and Vision Transformer Classification. - Chi Mai Kim Ho; Kin Choong Yow 001; Zhongwen Zhu; Sarang Aravamuthan (IEEE Access, 2022)