On the Complexity of Graph Embeddings (Extended Abstract). - Jianer Chen; Saroja P. Kanchi; Arkady Kanevsky (WADS, 1993)

Graph Ear Decompositions and Graph Embeddings (Extended Abstract). - Jianer Chen; Saroja P. Kanchi (WG, 1993)

A tight lower bound on the maximum genus of a simplicial graph. - Jianer Chen; Saroja P. Kanchi; Jonathan L. Gross (Discret. Math., 1996)

A Note on Approximating Graph Genus. - Jianer Chen; Saroja P. Kanchi; Arkady Kanevsky (Inf. Process. Lett., 1997)

Graph Ear Decompositions and Graph Embeddings. - Jianer Chen; Saroja P. Kanchi (SIAM J. Discret. Math., 1999)