( en | de | ru )

 

Disambiguation of "Tewari, Raghunath"

Author of the publication

copydeleteadd this publication to your clipboard
An O(nε) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.

, and . Electron. Colloquium Comput. Complex., (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Amit Tewari

Michael Raghunath

Martin Raghunath

Raghunath Acharya

Michael Raghunath

 

Other publications of authors with the same name

Review of additive combinatorics by Terence Tao and Van H. Vu.. SIGACT News, 45 (1): 24-26 (2014)Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs., and . WALCOM, volume 8973 of Lecture Notes in Computer Science, page 258-269. Springer, (2015)Grid Graph Reachability., and . CoRR, (2019)Derandomizing Isolation Lemma for K3, 3-free and K5-free Bipartite Graphs., , , and . STACS, volume 47 of LIPIcs, page 10:1-10:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)ReachFewL = ReachUL., , , and . Comput. Complex., 23 (1): 85-98 (2014)Space efficient algorithm for solving reachability using tree decomposition and separators., and . Theor. Comput. Sci., (January 2024)Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs., , , and . Electron. Colloquium Comput. Complex., (2010)Green's Theorem and Isolation in Planar Graphs., and . Electron. Colloquium Comput. Complex., (2010)Circuit Complexity of Bounded Planar Cutwidth Graph Matching., and . Electron. Colloquium Comput. Complex., (2018)Unambiguous Catalytic Computation., , , and . FSTTCS, volume 150 of LIPIcs, page 16:1-16:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)