Approximation Algorithms for Minimum Chain Vertex Deletion. - Mrinal Kumar 001; Sounaka Mishra; N. Safina Devi; Saket Saurabh 001 (WALCOM, 2011)

A Characterization of all Stable Minimal Separator Graphs - Mrinal Kumar 001; Gaurav Maheshwari 002; N. Sadagopan (CoRR, 2011)

Arithmetic Circuit Lower Bounds via MaxRank. - Mrinal Kumar 001; Gaurav Maheshwari 002; Jayalal Sarma (Electron. Colloquium Comput. Complex., 2013)

Lower Bounds for Depth 4 Homogenous Circuits with Bounded Top Fanin. - Mrinal Kumar 001; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2013)

Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits. - Mrinal Kumar 001; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2013)

Approximation algorithms for node deletion problems on bipartite graphs with finite forbidden subgraph characterization. - Mrinal Kumar 001; Sounaka Mishra; N. Safina Devi; Saket Saurabh 001 (Theor. Comput. Sci., 2014)

Faster Parameterized Algorithms for Deletion to Split Graphs. - Esha Ghosh; Sudeshna Kolay; Mrinal Kumar 001; Pranabendu Misra; Fahad Panolan; Ashutosh Rai 001; M. S. Ramanujan 001 (Algorithmica, 2015)

Sums of products of polynomials in few variables : lower bounds and polynomial identity testing. - Mrinal Kumar 001; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2015)

Arithmetic circuits with locally low algebraic rank. - Mrinal Kumar 001; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2015)

Efficient indexing of necklaces and irreducible polynomials over finite fields. - Swastik Kopparty; Mrinal Kumar 001; Michael E. Saks (Electron. Colloquium Comput. Complex., 2015)

An exponential lower bound for homogeneous depth-5 circuits over finite fields. - Mrinal Kumar 001; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2015)

The Limits of Depth Reduction for Arithmetic Formulas: It's All About the Top Fan-In. - Mrinal Kumar 001; Shubhangi Saraf (SIAM J. Comput., 2015)

The Chasm at Depth Four, and Tensor Rank : Old results, new insights. - Suryajith Chillara; Mrinal Kumar 001; Ramprasad Saptharishi; V. Vinay (Electron. Colloquium Comput. Complex., 2016)

Functional lower bounds for arithmetic circuits and connections to boolean circuit complexity. - Michael A. Forbes 001; Mrinal Kumar 001; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2016)

Finer separations between shallow arithmetic circuits. - Mrinal Kumar 001; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2016)

Arithmetic Circuit Lower Bounds via Maximum-Rank of Partial Derivative Matrices. - Mrinal Kumar 001; Gaurav Maheshwari 002; Jayalal Sarma (ACM Trans. Comput. Theory, 2016)

Towards an algebraic natural proofs barrier via polynomial identity testing. - Joshua A. Grochow; Mrinal Kumar 001; Michael E. Saks; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2017)

An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. - Mrinal Kumar 001; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2017)

On the Power of Homogeneous Depth 4 Arithmetic Circuits. - Mrinal Kumar 001; Shubhangi Saraf (SIAM J. Comput., 2017)

Hardness vs Randomness for Bounded Depth Arithmetic Circuits. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (CCC, 2018)

On Multilinear Forms: Bias, Correlation, and Tensor Rank. - Abhishek Bhrushundi; Prahladh Harsha; Pooya Hatami; Swastik Kopparty; Mrinal Kumar 001 (Electron. Colloquium Comput. Complex., 2018)

Some Closure Results for Polynomial Factorization and Applications. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (Electron. Colloquium Comput. Complex., 2018)

On top fan-in vs formal degree for depth-3 arithmetic circuits. - Mrinal Kumar 001 (Electron. Colloquium Comput. Complex., 2018)

Near-optimal Bootstrapping of Hitting Sets for Algebraic Circuits. - Mrinal Kumar 001; Ramprasad Saptharishi; Anamay Tengse (Electron. Colloquium Comput. Complex., 2018)

Derandomization from Algebraic Hardness: Treading the Borders. - Zeyu Guo 001; Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (FOCS, 2019)

A quadratic lower bound for homogeneous algebraic branching programs. - Mrinal Kumar 001 (Comput. Complex., 2019)

Hardness-Randomness Tradeoffs for Algebraic Computation. - Mrinal Kumar 001; Ramprasad Saptharishi (Bull. EATCS, 2019)

A Quadratic Lower Bound for Algebraic Branching Programs. - Prerona Chatterjee; Mrinal Kumar 001; Adrian She; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2019)

Schur Polynomials do not have small formulas if the Determinant doesn't! - Prasad Chaugule; Mrinal Kumar 001; Nutan Limaye; Chandra Kanta Mohapatra; Adrian She; Srikanth Srinivasan 001 (Electron. Colloquium Comput. Complex., 2019)

Closure of VP under taking factors: a short and simple proof. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (Electron. Colloquium Comput. Complex., 2019)

Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. - Mrinal Kumar 001; Rafael Mendes de Oliveira; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2019)

Derandomization from Algebraic Hardness: Treading the Borders. - Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (Electron. Colloquium Comput. Complex., 2019)

The Computational Power of Depth Five Arithmetic Circuits. - Mrinal Kumar 001; Ramprasad Saptharishi (SIAM J. Comput., 2019)

Closure Results for Polynomial Factorization. - Chi-Ning Chou; Mrinal Kumar 001; Noam Solomon (Theory Comput., 2019)

Unbalancing Sets and An Almost Quadratic Lower Bound for Syntactically Multilinear Arithmetic Circuits. - Noga Alon; Mrinal Kumar 001; Ben Lee Volk (Comb., 2020)

Decoding Multivariate Multiplicity Codes on Product Sets. - Siddharth Bhandari; Prahladh Harsha; Mrinal Kumar 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2020)

Monotone Circuit Lower Bounds from Robust Sunflowers. - Bruno Pasqualotto Cavalar; Mrinal Kumar 001; Benjamin Rossman (Electron. Colloquium Comput. Complex., 2020)

On the Existence of Algebraically Natural Proofs. - Prerona Chatterjee; Mrinal Kumar 001; C. Ramya; Ramprasad Saptharishi; Anamay Tengse (Electron. Colloquium Comput. Complex., 2020)

If VNP is hard, then so are equations for it. - Mrinal Kumar 001; C. Ramya; Ramprasad Saptharishi; Anamay Tengse (Electron. Colloquium Comput. Complex., 2020)

A Polynomial Degree Bound on Defining Equations of Non-rigid Matrices and Small Linear Circuits. - Mrinal Kumar 001; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2020)

On the Power of Border of Depth-3 Arithmetic Circuits. - Mrinal Kumar 001 (ACM Trans. Comput. Theory, 2020)

Lower Bounds for Matrix Factorization. - Ben Lee Volk; Mrinal Kumar 001 (Comput. Complex., 2021)

Ideal-theoretic Explanation of Capacity-achieving Decoding. - Siddharth Bhandari; Prahladh Harsha; Mrinal Kumar 001; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2021)

Algorithmizing the Multiplicity Schwartz-Zippel Lemma. - Siddharth Bhandari; Prahladh Harsha; Mrinal Kumar 001; Ashutosh Shankar (Electron. Colloquium Comput. Complex., 2021)

Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. - Vishwas Bhargava; Sumanta Ghosh; Mrinal Kumar 001; Chandra Kanta Mohapatra (Electron. Colloquium Comput. Complex., 2021)

Quadratic Lower Bounds for Algebraic Branching Programs and Formulas. - Prerona Chatterjee; Mrinal Kumar 001; Adrian She; Ben Lee Volk (Comput. Complex., 2022)

A Lower Bound on Determinantal Complexity. - Mrinal Kumar 001; Ben Lee Volk (Comput. Complex., 2022)

Fast Multivariate Multipoint Evaluation Over All Finite Fields. - Vishwas Bhargava; Sumanta Ghosh; Zeyu Guo 001; Mrinal Kumar 001; Chris Umans (Electron. Colloquium Comput. Complex., 2022)

Derandomization from Algebraic Hardness. - Zeyu Guo 001; Mrinal Kumar 001; Ramprasad Saptharishi; Noam Solomon (SIAM J. Comput., 2022)

A Polynomial Degree Bound on Equations for Non-rigid Matrices and Small Linear Circuits. - Ben Lee Volk; Mrinal Kumar 001 (ACM Trans. Comput. Theory, 2022)

Deterministic Algorithms for Low Degree Factors of Constant Depth Circuits. - Mrinal Kumar 001; Varun Ramanathan 002; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2023)

Fast Numerical Multivariate Multipoint Evaluation. - Sumanta Ghosh; Prahladh Harsha; Simão Herdade; Mrinal Kumar 001; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2023)

Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. - Rohan Goyal; Prahladh Harsha; Mrinal Kumar 001; Ashutosh Shankar (Electron. Colloquium Comput. Complex., 2023)

An Improved Line-Point Low-Degree Test. - Prahladh Harsha; Mrinal Kumar 001; Ramprasad Saptharishi; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2023)

Near-Optimal Bootstrapping of Hitting Sets for Algebraic Models. - Mrinal Kumar 001; Ramprasad Saptharishi; Anamay Tengse (Theory Comput., 2023)

Schur Polynomials Do Not Have Small Formulas If the Determinant does not. - Prasad Chaugule; Mrinal Kumar 001; Nutan Limaye; Chandra Kanta Mohapatra; Adrian She; Srikanth Srinivasan 001 (Comput. Complex., 2023)

Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. - Mrinal Kumar 001; Varun Ramanathan 002; Ramprasad Saptharishi; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2024)

High Rate Multivariate Polynomial Evaluation Codes. - Swastik Kopparty; Mrinal Kumar 001; Harry Sha (Electron. Colloquium Comput. Complex., 2024)

Determinants vs. Algebraic Branching Programs. - Abhranil Chatterjee 001; Mrinal Kumar 001; Ben Lee Volk (Comput. Complex., 2024)

Deterministic factorization of constant-depth algebraic circuits in subexponential time. - Somnath Bhattacharjee; Mrinal Kumar 001; Varun Ramanathan 002; Ramprasad Saptharishi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2025)

Closure under factorization from a result of Furstenberg. - Somnath Bhattacharjee; Mrinal Kumar 001; Shanthanu S. Rai; Varun Ramanathan 002; Ramprasad Saptharishi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2025)

Constant-depth circuits for polynomial GCD over any characteristic. - Somnath Bhattacharjee; Mrinal Kumar 001; Shanthanu S. Rai; Varun Ramanathan 002; Ramprasad Saptharishi; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2025)

An exposition of recent list-size bounds of FRS Codes. - Abhibhav Garg; Prahladh Harsha; Mrinal Kumar 001; Ramprasad Saptharishi; Ashutosh Shankar (Electron. Colloquium Comput. Complex., 2025)