Raghunath Tewari
- Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
2010/04/28 by Samir Datta, Datta, Samir, Raghav Kulkarni +5 · 2 citations
Computer Science · #Computational Complexity (cs.CC) #FOS: Computer and information sciences #cs.CC
- Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs
2014/11/27 by Rahul Arora, Ashu Gupta, Arora, Rahul +5 · 1 citation
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Interconnection Networks and Systems