Scholar
Rik Sengupta
Google Scholar ID: hK7NUBIAAAAJ
IBM Research
Citations & Impact
Citations
112
H-index
7
i10-index
4
Publications
20
Co-authors
19
list available
Publications
Resume (English only)
Academic Achievements
- Published several papers, including 'Tight approximations for graphical house allocation' (with Hadi Hosseini, Andrew McGregor, Rohit Vaish, Vignesh Viswanathan) and 'Multi-structural games and beyond' (with Marco Carmosino, Ron Fagin, Neil Immerman, Phokion Kolaitis, Jon Lenchner).
Research Experience
- Currently a Research Scientist at IBM Research, collaborating with the Logic and Complexity group. Was part of the Theory Group at UMass. Works closely with Ron Fagin, Jon Lenchner, Marco Carmosino, Phokion Kolaitis (UCSC), and Ryan Williams (MIT).
Education
- Ph.D. in Computer Science from the University of Massachusetts Amherst, advised by Andrew McGregor and Neil Immerman; MS in Applied Mathematics from MIT, advised by Michel Goemans; AB in Mathematics from Princeton, advised by Paul Seymour.
Background
- Research interests include algorithms, complexity, and combinatorics, with a particular focus on fair allocations. Background in theoretical mathematics.
Miscellany
- Taught courses such as CICS 191: Mathematical Puzzles and CS 575: Combinatorics and Graph Theory in past semesters. Organizes the Departmental Theory Seminar for CICS at UMass every semester. Will be teaching a section of CICS 191: Mathematical Puzzles at UMass in Fall 2024.
