SAROJA KANCHI , Ph.D.
Associate Professor of Computer Science and Mathematics
Phone : 810 762 7987 FAX : 810 762 9796 email: skanchi@kettering.edu
RESEARCH INTERESTS AND PUBLICATIONS
Journal
and Reviewed Conference Proceedings
1. S. Kanchi and D. Vineyard “Time Optimal
Distributed All pairs shortest path problem” to appear in International Journal of Information
Theories and Applications, 2004[ Presented at International Conference
on Information Theory and Applications, June 2004, Sofia, Bulgaria]
2. J.Chen and S.Kanchi "Graph Ear
Decompositions and Imbeddings ", SIAM Journal of Discrete
Mathematics. 1999, 229, No 2, pp. 229-243
3.
Kanchi, S. and Chen. J, ``Maximum genus and 2-connected graphs,'' , In Proceedings of the eighth quadrennial
international conference on graph theory, combinatorics, algorithms, and
applications, Y. Alavi, D. R. Lick, and A. Schwenk, ed., Wiley
Interscience, pp. 211-220, 1999.[Presented at International conference on graph theory,
combinatorics, algorithms, and applications; Combinatorics, graph theory, and
algorithms, 1996]
4.J.Chen, S.Kanchi and A.Kanevsky"A note
on Approximating Graph Genus", In Information Processing Letters,
61, No. 6, 1997, pp 317-322
5. S.Kanchi and S. Chakravarthy "Performance Evaluation of a Parallel System", In International Conference on Operations and Quantitative Management; 1997; Number 1, pp. 157-168 [Presented at ICOQM, Jaiipur, India, 1997]
6.J.Chen, S.Kanchi and J.L Gross "Tight
lower bound on maximum genus of simplicial graphs" In Discrete
Mathematics, 156, No. 1-3, 1996, pp. 83-102.
7. Chen, J., S. P. Kanchi, and J. L. Gross.,
``A tight lower bound on the maximum genus of a simplicial graph,'' Proceedings
of The AMS/MAA Joint Summer
Meeting (MathFest): Special Session on Topological Graph Theory, pp.
624, Burlington, MA, Aug. 6-8, 1995.
8.J.Chen and S.Kanchi "Graph Imbeddings
and Graph Ear Decompositions", In Lecture Notes in Computer Science,
790, 1994, pp. 376-387, [
Presented at The 19th International Workshop on Graph-Theoretical Concepts
in Computer Science, (WG'93)]
9. J.Chen, S.Kanchi and A.Kanevsky"On complexity
of graph imbeddings", In Lecture Notes in Computer Science,709,
1993, pp 234-245. [The 3rd Workshop on Algorithms and Data Structures
(WADS'93),]
10. Chen, J., Kanchi, S. P., Gross, J. L.,
``On graph drawings with the smallest number of faces,'' Proceedings of ALCOM
International Workshop PARIS 1993 on Graph Drawing and Topological Graph
Algorithms, Sevres, Paris, Sept. 26-29, 1993.
11. Chen, J., Kanchi, S. P., Kanevsky, A.,
and Joshi, S., ``The complexity of near-optimal graph embeddings,'' Proceedings
of the The 24th Southeastern International Conference on Combinatorics, Graph
Theory, and Computing, Boca Raton, Feb. 22-26, 1993.
12.S.Kanchi "Hamiltonian Circuit in
2-regular digraphs",In Open Problems, SIAM Journal of Discrete
Mathematics Summer 1993.
13. S.Kanchi and J.L. Kim " Alternate Algorithms for Leader Election on Reliable
and Unreliable Complete Networks ",In International Conference On Parallel And Distributed
Computing Systems;
1993; 6th, pp 118-121. [Presented at 6th International conference on parallel and distributed
computing systems -- 1993 Oct : Louisville; KY]
Other Papers
1. Maximum genus,
connectivity, and Nebesky's theorem, by D. Archdeacon, J. Chen, D. Li,. Y. Liu,
Y. Huang, S. Kanchi, R. Nedela and M. Skoviera, submitted in 2001.
2. J.Chen and S.Kanchi "Maximum Genus
and Connectivity of a General Graph", Technical Report, Texas A
& M University,
3. .S.Kanchi and J.Chen "Tight Lower
bound on 2-connected simplicial graphs" , Technical Report, Texas A & M
University, 1996,
4.S.Kanchi "Determining Isomorphism of
graphs", In GMI Industry Symposium, 1996
5.S.Kanchi and F. Harary "Number of
vertices of a graph with maximum genus k" Manuscript, GMI Engineering
& Management Institute, 1995, (coauthor: Frank Harary)
6.S.Kanchi "Polynomial time Algorithm
for embeddings of graphs with bounded genus " Manuscript, GMI
Engineering & Management Institute, 1994
7.S.Kanchi "Maximum genus and Trivalent graphs" , Manuscript, GMI Engineering and Management Institute, 1994