Conference
2026
Space Complexity of Reachability in Simple Path Graphs
K. Dinesh, C. Sasidharan, Michal Koucký et al.
· International Symposium on M... · 0 citations
We have 3 of 52 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Conference
2026
Parameterizing the Complexity of Finding Long Paths in DAGs
This work studies the unambiguous complexity of the Long Path problem on DAGs under parameterization and obtains an algorithm that achieves unambiguous and co-unambiguous O ( k log n ) space while running in time polynomial in both n and k.
Ronak Bhadra, Saurya Singh, Raghunath Tewari
· International Symposium on M... · 0 citations
Conference
2026
Upper Clique Transversal on Interval Graphs and Beyond
Lars Jaffke, P. T. de Lima, Amir Nikabadi
· International Symposium on M... · 0 citations