Rainbow connection number and connected dominating sets. - L. Sunil Chandran; Anita Das 001; Deepak Rajendraprasad; Nithin M. Varma (J. Graph Theory, 2012)

Small Stretch Pairwise Spanners. - Telikepalli Kavitha; Nithin M. Varma (ICALP (1), 2013)

Small Stretch Pairwise Spanners and Approximate D-Preservers. - Telikepalli Kavitha; Nithin M. Varma (SIAM J. Discret. Math., 2015)

Parameterized Property Testing of Functions. - Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; Nithin Varma 001 (Electron. Colloquium Comput. Complex., 2017)

Brief Announcement: Erasure-Resilience Versus Tolerance to Errors. - Sofya Raskhodnikova; Nithin Varma 001 (ICALP, 2018)

Erasures versus Errors in Local Decoding and Property Testing. - Sofya Raskhodnikova; Noga Ron-Zewi; Nithin Varma 001 (Electron. Colloquium Comput. Complex., 2018)

Erasure-Resilient Property Testing. - Kashyap Dixit; Sofya Raskhodnikova; Abhradeep Thakurta; Nithin Varma 001 (SIAM J. Comput., 2018)

Erasures vs. Errors in Local Decoding and Property Testing. - Sofya Raskhodnikova; Noga Ron-Zewi; Nithin Varma 001 (ITCS, 2019)

Analyzing massive datasets with missing entries: models and algorithms - Nithin Varma 001 (2019)

New Algorithms and Lower Bounds for LIS Estimation. - Ilan Newman; Nithin Varma 001 (CoRR, 2020)

Erasure-Resilient Sublinear-Time Graph Algorithms. - Amit Levi; Ramesh Krishnan S. Pallavoor; Sofya Raskhodnikova; Nithin Varma 001 (Electron. Colloquium Comput. Complex., 2020)

Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). - Noga Ron-Zewi; Ronen Shaltiel; Nithin Varma 001 (Electron. Colloquium Comput. Complex., 2020)

Bipartite graphs of small readability. - Rayan Chikhi; Vladan Jovicic; Stefan Kratsch; Paul Medvedev; Martin Milanic; Sofya Raskhodnikova; Nithin Varma 001 (Theor. Comput. Sci., 2020)

New Sublinear Algorithms and Lower Bounds for LIS Estimation. - Ilan Newman; Nithin Varma 001 (ICALP, 2021)

Parameterized Convexity Testing. - Abhiruk Lahiri; Ilan Newman; Nithin Varma 001 (SOSA, 2022)

EFX Exists for Four Agents with Three Types of Valuations. - Pratik Ghosal; Vishwa Prakash HV; Prajakta Nimbhorkar; Nithin Varma 001 (CoRR, 2023)

Sublinear-Time Computation in the Presence of Online Erasures. - Iden Kalemaj; Sofya Raskhodnikova; Nithin Varma 001 (Theory Comput., 2023)

Average Sensitivity of Graph Algorithms. - Nithin Varma 001; Yuichi Yoshida (SIAM J. Comput., 2023)

Strongly Sublinear Algorithms for Testing Pattern Freeness. - Ilan Newman; Nithin Varma 001 (TheoretiCS, 2024)

(Almost Full) EFX for Three (and More) Types of Agents. - Pratik Ghosal; Vishwa Prakash HV; Prajakta Nimbhorkar; Nithin Varma 001 (AAAI, 2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions. - Martin G. Herold; Danupon Nanongkai; Joachim Spoerhase; Nithin Varma 001; Zihang Wu (SoCG, 2025)

EFX Exists for Three Types of Agents. - Vishwa Prakash HV; Pratik Ghosal; Prajakta Nimbhorkar; Nithin Varma 001 (EC, 2025)