On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack. - Tanima Chatterjee; Bhaskar DasGupta; Nasim Mobasheri; Venkatkumar Srinivasan; Ismael González Yero (CoRR, 2016)

Alleviating partisan gerrymandering: can math and computers help to eliminate wasted votes? - Tanima Chatterjee; Bhaskar DasGupta; Laura Palmieri; Zainab Al-Qurashi; Anastasios Sidiropoulos (CoRR, 2018)

On partisan bias in redistricting: computational complexity meets the science of gerrymandering. - Tanima Chatterjee; Bhaskar DasGupta (CoRR, 2019)

On the computational complexities of three problems related to a privacy measure for large networks under active attack. - Tanima Chatterjee; Bhaskar DasGupta; Nasim Mobasheri; Venkatkumar Srinivasan; Ismael González Yero (Theor. Comput. Sci., 2019)

On theoretical and empirical algorithmic analysis of the efficiency gap measure in partisan gerrymandering. - Tanima Chatterjee; Bhaskar DasGupta; Laura Palmieri; Zainab Al-Qurashi; Anastasios Sidiropoulos (J. Comb. Optim., 2020)