Rohit Gurjar

67 papers A* 7A 7B 2Journal 48Unranked 3
YearRankTypeTitle / Venue / Authors
2026 A conf
2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs.
STACS
Rohit Gurjar, Kilian Rothmund, Thomas Thierauf
2026 J jnl
Learning Read-Once Determinants and the Principal Minor Assignment Problem.
CoRR
Abhiram Aravind, Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, Chandan Saha
2026 J jnl
Learning Read-Once Determinants and the Principal Minor Assignment Problem.
Electron. Colloquium Comput. Complex.
Abhiram Aravind, Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, Chandan Saha
2025 J jnl
2D Minimal Graph Rigidity is in NC for One-Crossing-Minor-Free Graphs.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Kilian Rothmund, Thomas Thierauf
2025 A* conf
Characterizing and Testing Principal Minor Equivalence of Matrices.
STOC
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2025 B conf
Quasipolynomial-Time Deterministic Kernelization and (Gammoid) Representation.
MFCS
Rohit Gurjar, Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi
2024 J jnl
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision.
Algorithmica
Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2024 J jnl
Characterizing and Testing Principal Minor Equivalence of Matrices.
CoRR
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2024 J jnl
Characterizing and Testing Principal Minor Equivalence of Matrices.
Electron. Colloquium Comput. Complex.
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2024 J jnl
Fair Interval Scheduling of Indivisible Chores.
CoRR
Sarfaraz Equbal, Rohit Gurjar, Yatharth Kumar, Swaprava Nath, Rohit Vaish
2024 A conf
Fair Scheduling of Indivisible Chores.
AAMAS
Yatharth Kumar, Sarfaraz Equbal, Rohit Gurjar, Swaprava Nath, Rohit Vaish
2024 A conf
Fractional Linear Matroid Matching Is in Quasi-NC.
ESA
Rohit Gurjar, Taihei Oki, Roshan Raj
2024 J jnl
Fractional Linear Matroid Matching is in quasi-NC.
CoRR
Rohit Gurjar, Taihei Oki, Roshan Raj
2024 J jnl
Fractional Linear Matroid Matching is in quasi-NC.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Taihei Oki, Roshan Raj
2024 J jnl
Geometric Bipartite Matching is in NC.
CoRR
Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar
2024 — conf
Parallel Complexity of Geometric Bipartite Matching.
FSTTCS
Sujoy Bhore, Sarfaraz Equbal, Rohit Gurjar
2023 A conf
Border Complexity of Symbolic Determinant Under Rank One Restriction.
CCC
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2023 J jnl
Border Complexity of Symbolic Determinant under Rank One Restriction.
CoRR
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2023 J jnl
Border Complexity of Symbolic Determinant under Rank One Restriction.
Electron. Colloquium Comput. Complex.
Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2022 A* conf
A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision.
SODA
Sumanta Ghosh, Rohit Gurjar, Roshan Raj
2022 J jnl
The Complexity of Poset Games.
J. Graph Algorithms Appl.
Stephen A. Fenner, Daniel Grier, Rohit Gurjar, Arpita Korwar, Thomas Thierauf
2021 J jnl
Bipartite Perfect Matching is in Quasi-NC.
SIAM J. Comput.
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
2021 J jnl
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces.
SIAM J. Comput.
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
2021 — conf
Matroid Intersection: A Pseudo-Deterministic Parallel Reduction from Search to Weighted-Decision.
APPROX-RANDOM
Sumanta Ghosh, Rohit Gurjar
2021 J jnl
Matroid Intersection: A pseudo-deterministic parallel reduction from search to weighted-decision.
Electron. Colloquium Comput. Complex.
Sumanta Ghosh, Rohit Gurjar
2021 J jnl
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes).
SIAM J. Discret. Math.
Rohit Gurjar, Nisheeth K. Vishnoi
2020 J jnl
Impossibility of Derandomizing the Isolation Lemma for all Families.
Electron. Colloquium Comput. Complex.
Manindra Agrawal, Rohit Gurjar, Thomas Thierauf
2020 — conf
Improved Explicit Hitting-Sets for ROABPs.
APPROX-RANDOM
Zeyu Guo, Rohit Gurjar
2020 J jnl
Linear Matroid Intersection is in Quasi-NC.
Comput. Complex.
Rohit Gurjar, Thomas Thierauf
2020 A* conf
Linearly Representable Submodular Functions: An Algebraic Algorithm for Minimization.
ICALP
Rohit Gurjar, Rajat Rathi
2020 J jnl
Pseudorandom Bits for Oblivious Branching Programs.
ACM Trans. Comput. Theory
Rohit Gurjar, Ben Lee Volk
2019 J jnl
A deterministic parallel algorithm for bipartite perfect matching.
Commun. ACM
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
2019 A* conf
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes).
SODA
Rohit Gurjar, Nisheeth K. Vishnoi
2018 A* conf
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces.
ICALP
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
2018 J jnl
On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes).
CoRR
Rohit Gurjar, Nisheeth K. Vishnoi
2017 J jnl
Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic Branching Programs.
Comput. Complex.
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2017 J jnl
Exact Perfect Matching in Complete Graphs.
ACM Trans. Comput. Theory
Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf
2017 J jnl
Guest Column: Parallel Algorithms for Perfect Matching.
SIGACT News
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
2017 J jnl
Identity Testing for Constant-Width, and Any-Order, Read-Once Oblivious Arithmetic Branching Programs.
Theory Comput.
Rohit Gurjar, Arpita Korwar, Nitin Saxena
2017 J jnl
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces.
CoRR
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
2017 J jnl
Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Thomas Thierauf, Nisheeth K. Vishnoi
2017 A* conf
Linear matroid intersection is in quasi-NC.
STOC
Rohit Gurjar, Thomas Thierauf
2017 J jnl
Pseudorandom Bits for Oblivious Branching Programs.
CoRR
Rohit Gurjar, Ben Lee Volk
2017 J jnl
Pseudorandom Bits for Oblivious Branching Programs.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Ben Lee Volk
2016 J jnl
Bipartite Perfect Matching is in quasi-NC.
CoRR
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
2016 A* conf
Bipartite perfect matching is in quasi-NC.
STOC
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
2016 A conf
Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs.
STACS
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
2016 A conf
Identity Testing for Constant-Width, and Commutative, Read-Once Oblivious ABPs.
CCC
Rohit Gurjar, Arpita Korwar, Nitin Saxena
2016 J jnl
Identity Testing for constant-width, and commutative, read-once oblivious ABPs.
CoRR
Rohit Gurjar, Arpita Korwar, Nitin Saxena
2016 J jnl
Identity Testing for constant-width, and commutative, read-once oblivious ABPs.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Arpita Korwar, Nitin Saxena
2016 J jnl
Linear Matroid Intersection is in quasi-NC.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Thomas Thierauf
2016 J jnl
Planarizing Gadgets for Perfect Matching Do Not Exist.
ACM Trans. Comput. Theory
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
2015 J jnl
Bipartite Perfect Matching is in quasi-NC.
Electron. Colloquium Comput. Complex.
Stephen A. Fenner, Rohit Gurjar, Thomas Thierauf
2015 A conf
Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic Branching Programs.
CCC
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2015 J jnl
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits.
SIAM J. Comput.
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2014 J jnl
Derandomizing Isolation Lemma for $K_{3, 3}$-free and $K_5$-free Bipartite Graphs.
CoRR
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
2014 J jnl
Derandomizing Isolation Lemma for K
Electron. Colloquium Comput. Complex.
Rahul Arora, Ashu Gupta, Rohit Gurjar, Raghunath Tewari
2014 J jnl
Deterministic Identity Testing for Sum of Read Once ABPs.
CoRR
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2014 J jnl
Deterministic Identity Testing for Sum of Read Once ABPs.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Arpita Korwar, Nitin Saxena, Thomas Thierauf
2014 J jnl
Hitting-sets for ROABP and Sum of Set-Multilinear circuits.
CoRR
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2014 J jnl
Hitting-sets for ROABP and Sum of Set-Multilinear circuits.
Electron. Colloquium Comput. Complex.
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2013 J jnl
Exact Perfect Matching in Complete Graphs.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Arpita Korwar, Jochen Messner, Thomas Thierauf
2013 J jnl
Hitting-sets for low-distance multilinear depth-3.
CoRR
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2013 J jnl
Hitting-sets for low-distance multilinear depth-3.
Electron. Colloquium Comput. Complex.
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
2013 J jnl
On Two-Level Poset Games.
Electron. Colloquium Comput. Complex.
Stephen A. Fenner, Rohit Gurjar, Arpita Korwar, Thomas Thierauf
2012 B conf
Planarizing Gadgets for Perfect Matching Do Not Exist.
MFCS
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf
2011 J jnl
Planarizing Gadgets for Perfect Matching do not Exist.
Electron. Colloquium Comput. Complex.
Rohit Gurjar, Arpita Korwar, Jochen Messner, Simon Straub, Thomas Thierauf