Research
Work & Projects
My work spans combinatorial optimization, algorithm design, and equitable network design — from computational redistricting to healthcare access modeling. Below are my papers and interactive tools built from this research.
Papers
FalCom: A Sampling Method for Districting and Hierarchical Facility Location
with Hemanshu Kaul
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
Chicago Healthcare Network — Optimization-Based Decision Support for Equitable Access
with Hemanshu Kaul & Kim Erwin
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
A Diffusion Model for Political Redistricting
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
UAV Routing for Maximum Information Collection under Time Windows
with Melis Boran & Mustafa Tural
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
Bike-Share Stations: An Equity Analysis and Location Optimization
with Ishaan Goel, Hemanshu Kaul & Taran Mellacheruvu
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum.
Coloring of Graphs Avoiding Bicolored Paths of a Fixed Length
Graphs and Combinatorics, 40(1), Art. 11, 2024
We study proper vertex colorings of graphs that avoid bicolored paths of a fixed length — that is, paths whose vertices alternate between exactly two colors. We introduce the Pk-chromatic number sk(G), the minimum number of colors needed for such a coloring. For any graph with maximum degree d ≥ 2 and k ≥ 4, we establish that sk(G) = O(d(k−1)/(k−2)). We also determine exact values of sk for products of cycles and paths when k = 5 and k = 6. The problem generalizes classical star coloring and acyclic coloring and connects chromatic theory with Ramsey-type structural questions.