Anuj Tawari

According to our database, Anuj Tawari authored at least 8 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Exactly k MSTs: How Many Vertices Suffice?

Apratim Dutta, Rahul Muthu, Anuj Tawari, V. Sunitha

Proceedings of the Combinatorial Optimization and Applications, 2023

2021

Dynamic Complexity of Expansion.

Samir Datta, Anuj Tawari, Yadu Vasudev

Proceedings of the Computer Science - Theory and Applications, 2021

2020

Dynamic Complexity of Reachability: How Many Changes Can We Handle?

Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2018

Sums of read-once formulas: How many summands are necessary?

Meena Mahajan, Anuj Tawari

Theor. Comput. Sci., 2018

Shortest path length with bounded-alternation (min, +) formulas.

Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari

Electron. Colloquium Comput. Complex., 2018

Computing the maximum using (min, +) formulas.

Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari

Electron. Colloquium Comput. Complex., 2018

2015

Sums of read-once formulas: How many summands suffice?

Meena Mahajan, Anuj Tawari

Electron. Colloquium Comput. Complex., 2015

Read-once polynomials: How many summands suffice?

Meena Mahajan, Anuj Tawari

CoRR, 2015