Exact and Parameterized Algorithms for (k, i)-Coloring. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; Prafullkumar Tale (CALDAM, 2017)

Tractability of König edge deletion problems. - Diptapriyo Majumdar; Rian Neogi; Venkatesh Raman 001; S. Vaishali 001 (Theor. Comput. Sci., 2019)

On the Parameterized Complexity of Deletion to ℋ-Free Strong Components. - Rian Neogi; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma (MFCS, 2020)

Recognizing k-Clique Extendible Orderings. - Mathew C. Francis; Rian Neogi; Venkatesh Raman 001 (Algorithmica, 2021)

Budget-Feasible Mechanism Design: Simpler, Better Mechanisms and General Payment Constraints. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (ITCS, 2024)

On the Parameterized Complexity of Deletion to ( boldsymbol{ mathcal{H}} )-Free Strong Components. - Rian Neogi; M. S. Ramanujan 001; Saket Saurabh 001; Roohani Sharma (SIAM J. Discret. Math., 2024)

An O(log log n)-approximate budget feasible mechanism for subadditive valuations. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (EC, 2025)

An O(log log n)-approximate budget feasible mechanism for subadditive valuations. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (CoRR, 2025)

Multidimensional Budget-Feasible Mechanism Design. - Rian Neogi; Kanstantsin Pashkovich; Chaitanya Swamy (CoRR, 2025)