About Me

I am a PhD student in the Combinatorics and Optimization department at the University of Waterloo. I am privileged to be working under the supervision of Kanstantsin Pashkovich and Chaitanya Swamy. My interests lie in Algorithmic Game Theory and Combinatorial Optimization.

You can contact me at <first-name>(dot)<last-name>@uwaterloo.ca

Together with Jacob Skitsko, Noah Weninger, and David Aleman, I organise the Combinatorial Optimization Reading Group at University of Waterloo.

Publications

Multidimensional Budget-Feasible Mechanism Design.
Rian Neogi, Kanstantsin Pashkovich, Chaitanya Swamy
Preprint

PDF arXiv

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

PDF arXiv

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

PDF Slides

Recognizing k-Clique Extendible Orderings.
Mathew Francis, Rian Neogi, Venkatesh Raman
Algorithmica 2021
Preliminary version appeared in WG 2020

PDF Slides arXiv

On the Parameterized Complexity of Deletion to H-free Strong Components.
Rian Neogi, M S Ramanujan, Saket Saurabh, Roohani Sharma
SIAM Journal on Discrete Mathematics 2024
Preliminary version appeared in MFCS 2020

PDF Slides arXiv

Tractability of König edge deletion problems.
Diptapriyo Majumdar, Rian Neogi, Venkatesh Raman, S Vaishali
TCS 2019

PDF arXiv

Thesis

Decomposition-based methods for Connectivity Augmentation Problems.
Masters Thesis

PDF

Contact

  • Email: <first-name>(dot)<last-name>@uwaterloo.ca