Planarizing Gadgets for Perfect Matching do not Exist. - Rohit Gurjar; Arpita Korwar; Jochen Messner; Simon Straub; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2011)

Hitting-sets for low-distance multilinear depth-3. - Manindra Agrawal; Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2013)

On Two-Level Poset Games. - Stephen A. Fenner; Rohit Gurjar; Arpita Korwar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2013)

Exact Perfect Matching in Complete Graphs. - Rohit Gurjar; Arpita Korwar; Jochen Messner; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2013)

Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs. - Rahul Arora 001; Ashu Gupta; Rohit Gurjar; Raghunath Tewari (CoRR, 2014)

Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs. - Rahul Arora 001; Ashu Gupta; Rohit Gurjar; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2014)

Deterministic Identity Testing for Sum of Read Once ABPs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2014)

Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. - Manindra Agrawal; Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (SIAM J. Comput., 2015)

Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs. - Rahul Arora 001; Ashu Gupta; Rohit Gurjar; Raghunath Tewari (STACS, 2016)

Identity Testing for constant-width, and commutative, read-once oblivious ABPs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2016)

Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001; Thomas Thierauf (Comput. Complex., 2017)

Pseudorandom Bits for Oblivious Branching Programs. - Rohit Gurjar; Ben Lee Volk (Electron. Colloquium Comput. Complex., 2017)

Guest Column: Parallel Algorithms for Perfect Matching. - Stephen A. Fenner; Rohit Gurjar; Thomas Thierauf (SIGACT News, 2017)

Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs. - Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (Theory Comput., 2017)

A deterministic parallel algorithm for bipartite perfect matching. - Stephen A. Fenner; Rohit Gurjar; Thomas Thierauf (Commun. ACM, 2019)

Improved Explicit Hitting-Sets for ROABPs. - Zeyu Guo 001; Rohit Gurjar (APPROX-RANDOM, 2020)

Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization. - Rohit Gurjar; Rajat Rathi (ICALP, 2020)

Linear Matroid Intersection is in Quasi-NC. - Rohit Gurjar; Thomas Thierauf (Comput. Complex., 2020)

Impossibility of Derandomizing the Isolation Lemma for all Families. - Manindra Agrawal; Rohit Gurjar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2020)

Matroid Intersection: A pseudo-deterministic parallel reduction from search to weighted-decision. - Sumanta Ghosh; Rohit Gurjar (Electron. Colloquium Comput. Complex., 2021)

Bipartite Perfect Matching is in Quasi-NC. - Stephen A. Fenner; Rohit Gurjar; Thomas Thierauf (SIAM J. Comput., 2021)

Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces. - Rohit Gurjar; Thomas Thierauf; Nisheeth K. Vishnoi (SIAM J. Comput., 2021)

On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes). - Rohit Gurjar; Nisheeth K. Vishnoi (SIAM J. Discret. Math., 2021)

The Complexity of Poset Games. - Stephen A. Fenner; Daniel Grier; Rohit Gurjar; Arpita Korwar; Thomas Thierauf (J. Graph Algorithms Appl., 2022)

Border Complexity of Symbolic Determinant under Rank One Restriction. - Abhranil Chatterjee 001; Sumanta Ghosh; Rohit Gurjar; Roshan Raj (Electron. Colloquium Comput. Complex., 2023)

Fair Scheduling of Indivisible Chores. - Yatharth Kumar; Sarfaraz Equbal; Rohit Gurjar; Swaprava Nath; Rohit Vaish (AAMAS, 2024)

Parallel Complexity of Geometric Bipartite Matching. - Sujoy Bhore; Sarfaraz Equbal; Rohit Gurjar (FSTTCS, 2024)

Fair Interval Scheduling of Indivisible Chores. - Sarfaraz Equbal; Rohit Gurjar; Yatharth Kumar; Swaprava Nath; Rohit Vaish (CoRR, 2024)

Geometric Bipartite Matching is in NC. - Sujoy Bhore; Sarfaraz Equbal; Rohit Gurjar (CoRR, 2024)

Characterizing and Testing Principal Minor Equivalence of Matrices. - Abhranil Chatterjee 001; Sumanta Ghosh; Rohit Gurjar; Roshan Raj (Electron. Colloquium Comput. Complex., 2024)

Fractional Linear Matroid Matching is in quasi-NC. - Rohit Gurjar; Taihei Oki; Roshan Raj (Electron. Colloquium Comput. Complex., 2024)

A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision. - Sumanta Ghosh; Rohit Gurjar; Roshan Raj (Algorithmica, 2024)

Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation. - Rohit Gurjar; Daniel Lokshtanov; Pranabendu Misra; Fahad Panolan; Saket Saurabh 001; Meirav Zehavi (MFCS, 2025)

2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs. - Rohit Gurjar; Kilian Rothmund; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2025)