Anuj Tawari

13 papers A* 1B 1Misc 2Journal 8Unranked 1
YearRankTypeTitle / Venue / Authors
2023 — conf
Exactly k MSTs: How Many Vertices Suffice?
COCOA (1)
Apratim Dutta, Rahul Muthu, Anuj Tawari, V. Sunitha
2021 Misc conf
Dynamic Complexity of Expansion.
CSR
Samir Datta, Anuj Tawari, Yadu Vasudev
2020 J jnl
Dynamic Complexity of Expansion.
CoRR
Samir Datta, Anuj Tawari, Yadu Vasudev
2020 A* conf
Dynamic Complexity of Reachability: How Many Changes Can We Handle?
ICALP
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
2020 J jnl
Dynamic complexity of Reachability: How many changes can we handle?
CoRR
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
2018 J jnl
Computing the maximum using (min, +) formulas.
Electron. Colloquium Comput. Complex.
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
2018 J jnl
Shortest path length with bounded-alternation (min, +) formulas.
Electron. Colloquium Comput. Complex.
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
2018 J jnl
Sums of read-once formulas: How many summands are necessary?
Theor. Comput. Sci.
Meena Mahajan, Anuj Tawari
2017 B conf
Computing the Maximum using (min, +) Formulas.
MFCS
Meena Mahajan, Prajakta Nimbhorkar, Anuj Tawari
2016 Misc conf
Sums of Read-Once Formulas: How Many Summands Suffice?
CSR
Meena Mahajan, Anuj Tawari
2016 J jnl
Sums of read-once formulas: How many summands suffice?
CoRR
Meena Mahajan, Anuj Tawari
2015 J jnl
Read-once polynomials: How many summands suffice?
CoRR
Meena Mahajan, Anuj Tawari
2015 J jnl
Sums of read-once formulas: How many summands suffice?
Electron. Colloquium Comput. Complex.
Meena Mahajan, Anuj Tawari