N V. Vinodchandran
Affiliations: | Mathematics | The University of Nebraska - Lincoln, Lincoln, NE |
Area:
Mathematics, Computer ScienceGoogle:
"N Vinodchandran"
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Braverman V, Liu Z, Singh T, et al. (2018) New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory Algorithmica. 80: 652-667 |
| Braverman V, Liu Z, Singh T, et al. (2015) New bounds for the CLIQUE-GAP problem using graph decomposition theory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9235: 151-162 |
| Chakraborty D, Pavan A, Tewari R, et al. (2014) New time-space upperbounds for directed reachability in high-genus and H-minor-free graphs Leibniz International Proceedings in Informatics, Lipics. 29: 585-595 |
| Garvin B, Stolee D, Tewari R, et al. (2014) ReachFewL = ReachUL Computational Complexity. 23: 85-98 |
| Imai T, Nakagawa K, Pavan A, et al. (2013) An O(n1/2+Σ)-space and polynomial-time algorithm for directed planar reachability Proceedings of the Annual Ieee Conference On Computational Complexity. 277-286 |
| Datta S, Kulkarni R, Tewari R, et al. (2012) Space complexity of perfect matching in bounded genus bipartite graphs Journal of Computer and System Sciences. 78: 765-779 |
| Tewari R, Vinodchandran NV. (2012) Greens theorem and isolation in planar graphs Information and Computation. 215: 1-7 |
| Pavan A, Tewari R, Vinodchandran NV. (2012) On the power of unambiguity in log-space Computational Complexity. 21: 643-670 |
| Datta S, Kulkarni R, Tewari R, et al. (2011) Space complexity of perfect matching in bounded genus bipartite graphs Leibniz International Proceedings in Informatics, Lipics. 9: 579-590 |
| Fortnow L, Hitchcock JM, Pavan A, et al. (2011) Extracting Kolmogorov complexity with applications to dimension zero-one laws Information and Computation. 209: 627-636 |