Gurjar, Rohit

1. Bipartite Perfect Matching is in quasi-NC
   2016/01/23 by Fenner, Stephen A., Gurjar, Rohit, Thierauf, Thomas · 5 citations
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences
2. Hitting-sets for ROABP and Sum of Set-Multilinear circuits
   2014/06/29 by Manindra Agrawal, Agrawal, Manindra, Rohit Gurjar +5 · 2 citations
   Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Machine Learning and Algorithms
3. Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces
   2017/08/07 by Gurjar, Rohit, Thierauf, Thomas, Vishnoi, Nisheeth K. · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
4. On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)
   2018/07/13 by Rohit Gurjar, Nisheeth K. Vishnoi, Gurjar, Rohit +1 · 1 citation
   Computer Science · Engineering · #Advanced Graph Theory Research #Coding theory and cryptography #Combinatorics (math.CO) #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #graph theory and CDMA systems
5. Derandomizing Isolation Lemma for K_3,3-free and K₅-free Bipartite Graphs
   2014/11/27 by Arora, Rahul, Gupta, Ashu, Gurjar, Rohit +1 · 1 citation
   #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences
6. Fair Interval Scheduling of Indivisible Chores
   2024/02/06 by Equbal, Sarfaraz, Gurjar, Rohit, Kumar, Yatharth +2 · 1 citation
   #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences