|
Search the dblp DataBase
Saroja P. Kanchi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky
On the Complexity of Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP] WADS, 1993, pp:234-245 [Conf]
- Jianer Chen, Saroja P. Kanchi
Graph Ear Decompositions and Graph Embeddings (Extended Abstract). [Citation Graph (0, 0)][DBLP] WG, 1993, pp:376-387 [Conf]
- Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky
A Note on Approximating Graph Genus. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:61, n:6, pp:317-322 [Journal]
- Jianer Chen, Saroja P. Kanchi
Graph Ear Decompositions and Graph Embeddings. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1999, v:12, n:2, pp:229-242 [Journal]
- Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross
A tight lower bound on the maximum genus of a simplicial graph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:156, n:1-3, pp:83-102 [Journal]
Search in 0.002secs, Finished in 0.002secs
|