No. Title Author Year
1 Reachability and Matching in Single Crossing Minor Free Graphs Datta, Samir et al. 2021
2 Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs Gupta, Chetan et al. 2021
3 Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs Gupta, Chetan et al. 2020
4 An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability Jain, Rahul et al. 2019
5 Reachability in High Treewidth Graphs Jain, Rahul et al. 2019
6 Reachability in O(log n) Genus Graphs is in Unambiguous Logspace Gupta, Chetan et al. 2019
7 Unambiguous Catalytic Computation Gupta, Chetan et al. 2019
8 Derandomizing Isolation Lemma for K3,3-free and K5-free Bipartite Graphs Arora, Rahul et al. 2016
9 Trading Determinism for Time in Space Bounded Computations Kallampally, Vivek Anand T et al. 2016
10 New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs Chakraborty, Diptarka et al. 2014
11 Improved Bounds for Bipartite Matching on Surfaces Datta, Samir et al. 2012
12 Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs Datta, Samir et al. 2011
Current Page :
Number of result pages: 1
Number of documents: 12


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI