Old Web
English
Sign In
Acemap
>
authorDetail
>
N. Variyam Vinodch
N. Variyam Vinodch
1
Papers
0
Citations
0
KQI
Citation Trend
Filter By
Interval:
1900~2024
1900
2024
Author
Papers (1)
Sort By
Default
Most Recent
Most Early
Most Citation
No data
Journal
Conference
Others
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs
2011
STACS | Symposium on Theoretical Aspects of Computer Science
Samir Datta
Raghav Kulkarni
Raghunath Tewari
N. Variyam Vinodch
ran
Show All
Source
Cite
Save
Citations (0)
1