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 combinatorial optimization, algorithmic game theory, and approximation algorithms.

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

Together with David Aleman and Nathan Benedetto, I organise the Combinatorial Optimization Reading Group at University of Waterloo.

Publications

(in chronological order)

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

PDF

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
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
  • Office: MC 5031, Mathematics Building, University of Waterloo