Rik Sengupta

Rik Sengupta is a Part-Time Lecturer at the University of Massachusetts Amherst, located in the Lederle Graduate Research Center. His research focuses on graph theory, algorithms, combinatorics, and fair allocation mechanisms. He has contributed to theoretical computer science, discrete mathematics, and algorithmic economics.

His work spans dynamic graph streaming algorithms, fair division under structured constraints, and optimization problems with fairness metrics. He also explores graph reconstruction techniques, quantifier complexity in boolean functions, and Ramsey theory applications.

Recent publications highlight trends in graphical allocation models, probabilistic graph analysis, and algorithmic solutions for resource distribution challenges. Notable areas include EFX allocations over graphs, time-aware fairness in knapsack problems, and approximation algorithms for housing markets.

Rik holds no explicitly listed academic awards or grants. His advising activities are not detailed in the provided texts.

He is affiliated with computational theory research groups but no specific labs or teams are mentioned.