Saroja P. Kanchi

According to our database, Saroja P. Kanchi authored at least 5 papers between 1993 and 1999.

Collaborative distances:

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

1999

Graph Ear Decompositions and Graph Embeddings.

Jianer Chen, Saroja P. Kanchi

SIAM J. Discret. Math., 1999

1997

A Note on Approximating Graph Genus.

Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky

Inf. Process. Lett., 1997

1996

A tight lower bound on the maximum genus of a simplicial graph.

Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross

Discret. Math., 1996

1993

Graph Ear Decompositions and Graph Embeddings (Extended Abstract).

Jianer Chen, Saroja P. Kanchi

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993

On the Complexity of Graph Embeddings (Extended Abstract).

Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky

Proceedings of the Algorithms and Data Structures, Third Workshop, 1993