Read-once polynomials: How many summands suffice? - Meena Mahajan; Anuj Tawari (CoRR, 2015)

Sums of read-once formulas: How many summands suffice? - Meena Mahajan; Anuj Tawari (Electron. Colloquium Comput. Complex., 2015)

Computing the maximum using (min, +) formulas. - Meena Mahajan; Prajakta Nimbhorkar; Anuj Tawari (Electron. Colloquium Comput. Complex., 2018)

Shortest path length with bounded-alternation (min, +) formulas. - Meena Mahajan; Prajakta Nimbhorkar; Anuj Tawari (Electron. Colloquium Comput. Complex., 2018)

Sums of read-once formulas: How many summands are necessary? - Meena Mahajan; Anuj Tawari (Theor. Comput. Sci., 2018)

Dynamic Complexity of Reachability: How Many Changes Can We Handle? - Samir Datta; Pankaj Kumar; Anish Mukherjee 001; Anuj Tawari; Nils Vortmeier; Thomas Zeume (ICALP, 2020)

Dynamic Complexity of Expansion. - Samir Datta; Anuj Tawari; Yadu Vasudev (CSR, 2021)

Exactly k MSTs: How Many Vertices Suffice? - Apratim Dutta; Rahul Muthu; Anuj Tawari; V. Sunitha (COCOA (1), 2023)