Vimalraj Sharma

According to our database, Vimalraj Sharma authored at least 9 papers between 2018 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Lossy Catalytic Computation.

Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

CoRR, 2024

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs.

Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2022

Dynamic Meta-Theorems for Distance and Matching.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021

Reachability and Matching in Single Crossing Minor Free Graphs.

Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

2020

Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs.

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2020

Randomized and Symmetric Catalytic Computation.

Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2020

2019

Unambiguous Catalytic Computation.

Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2019

Reachability in O(log n) Genus Graphs is in Unambiguous Logspace.

Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

2018

Reachability in O(log n) Genus Graphs is in Unambiguous.

Chetan Gupta, Vimalraj Sharma, Raghunath Tewari

Electron. Colloquium Comput. Complex., 2018