1999 | ||
---|---|---|
5 | EE | Jianer Chen, Saroja P. Kanchi: Graph Ear Decompositions and Graph Embeddings. SIAM J. Discrete Math. 12(2): 229-242 (1999) |
1997 | ||
4 | EE | Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky: A Note on Approximating Graph Genus. Inf. Process. Lett. 61(6): 317-322 (1997) |
1996 | ||
3 | EE | Jianer Chen, Saroja P. Kanchi, Jonathan L. Gross: A tight lower bound on the maximum genus of a simplicial graph. Discrete Mathematics 156(1-3): 83-102 (1996) |
1993 | ||
2 | Jianer Chen, Saroja P. Kanchi, Arkady Kanevsky: On the Complexity of Graph Embeddings (Extended Abstract). WADS 1993: 234-245 | |
1 | Jianer Chen, Saroja P. Kanchi: Graph Ear Decompositions and Graph Embeddings (Extended Abstract). WG 1993: 376-387 |
1 | Jianer Chen | [1] [2] [3] [4] [5] |
2 | Jonathan L. Gross | [3] |
3 | Arkady Kanevsky | [2] [4] |