| Publication | Date of Publication | Type |
|---|
| Dynamic meta-theorems for distance and matching | 2024-06-24 | Paper |
Space efficient algorithm for solving reachability using tree decomposition and separators
Theoretical Computer Science | 2024-02-23 | Paper |
scientific article; zbMATH DE number 7799601 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7799594 (Why is no real title available?)
(available as arXiv preprint) | 2024-02-05 | Paper |
scientific article; zbMATH DE number 7754308 (Why is no real title available?)
Theory of Computing | 2023-10-25 | Paper |
| scientific article; zbMATH DE number 7650313 (Why is no real title available?) | 2023-02-03 | Paper |
scientific article; zbMATH DE number 7650245 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650316 (Why is no real title available?) | 2023-02-03 | Paper |
Randomized and Symmetric Catalytic Computation
Computer Science – Theory and Applications | 2022-10-19 | Paper |
| Compressed Decision Problems in Hyperbolic Groups. | 2022-07-18 | Paper |
| Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs | 2022-07-18 | Paper |
An O ( n ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Trading determinism for time in space bounded computations
(available as arXiv preprint) | 2018-03-21 | Paper |
Derandomizing isolation lemma for \(K_{3,3}\)-free and \(K_5\)-free bipartite graphs
(available as arXiv preprint) | 2018-01-24 | Paper |
| New time-space upperbounds for directed reachability in high-genus and \(H\)-minor-free graphs | 2017-04-25 | Paper |
An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
Algorithms and Computation | 2016-01-11 | Paper |
Directed planar reachability is in unambiguous log-space
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
Simultaneous time-space upper bounds for red-blue path problem in planar DAGs
WALCOM: Algorithms and Computation | 2015-02-27 | Paper |
\textsc{ReachFewL} = \textsc{ReachUL}
Computational Complexity | 2014-09-25 | Paper |
On the power of unambiguity in log-space
Computational Complexity | 2012-12-27 | Paper |
Green's theorem and isolation in planar graphs
Information and Computation | 2012-10-11 | Paper |
| Improved bounds for bipartite matching on surfaces | 2012-08-23 | Paper |
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences | 2012-08-17 | Paper |
| Space complexity of perfect matching in bounded genus bipartite graphs | 2012-01-23 | Paper |
ReachFewL = ReachUL
Lecture Notes in Computer Science | 2011-08-17 | Paper |
