**SAROJA
KANCHI , Ph.D.**

**Professor of
Computer Science **

Phone : 810 762 7987 FAX : 810 762 9796 email: skanchi@kettering.edu

PUBLICATIONS

**Journal and Reviewed
Conference Proceedings**

S. Kanchi and Charles Welch,

*" An Efficient Algorithm for Finding Large Localizable Regions in Wireless Sensor Networks"***Procedia Computer Science, Vol 19, pp. 1081-1087 , 2013**S. Kanchi and Changhua Wu,

*"Distributed Algorithm for Maximal Rigid Region in Sparse Wireless Sensor Networks"***Proceedings of the IEEE Asia-Pacific Services Computing Conference, 2010**Changhua Wu, Ying Zhang, Weihua Sheng, S. Kanchi,

*"Rigidity guided localization for mobile robotic snsor networks",***International Journal of Ad Hoc and Ubiquitous Computing, Vol 6 No 2, pp.114-128, 2010**.Changhua Wu, Ying Zhang, Weihua Sheng, S. Kanchi,

*"Rigidity guided localization for mobile robotic snsor networks",***International Journal of Ad Hoc and Ubiquitous Computing, Vol 6 No 2, pp.114-128, 2010**.Changhua Wu, Weihua Sheng, Ying Zhang, S. Kanchi,

*"Mobility assisted localization for robotic sensor networks"*,**IEEE International Conference on Information and Automation, 2009.**S. Kanchi and Changhua Wu

*"Robot assisted localization of sensor networks guided by rigidity",***Proceedings of WICON pp 17-19, 2008.**S. Kanchi and J.R. Pimentel, ""

*An Online Bandwidth Scheduling Algorithm for Distributed Control Systems with Multirate Control Loops"***the Proceedings of ICINCO 2008**S.Kanchi and S.Chakravarthy,

*"A Stochastic Model for a Web Environment with Static and Dynamic Page requests***International Conference on Internet and Web Applications and Services, 2006.**S. Kanchi

*"On the number of relativized maximum genus embeddings"***Proceeding of the Conference of Discrete Mathematics and Applications, 2005**S. Kanchi and D. Vineyard ,

*"Time Optimal Distributed All pairs shortest path problem"***International Journal of Information Theories and Applications, 2004**J.Chen and S.Kanchi "

*"Graph Ear Decompositions and Imbeddings"*,**SIAM Journal of Discrete Mathematics 229, No 2, pp. 229-243, 1999**Kanchi, S. and Chen. J,

*``Maximum genus and 2-connected graphs,''*,**Proceedings of the eighth quadrennial international conference on graph theory, combinatorics, algorithms, and applications, Ediited by Y. Alavi, D. R. Lick, and A. Schwenk, ed., Wiley Interscience, pp. 211-220, 1999.**J.Chen, S.Kanchi and A.Kanevsky"

*"A note on Approximating Graph Genus "*",**Information Processing Letters, 61, No. 6, pp 317-322, 1999**S.Kanchi and S. Chakravarthy "

*"Performance Evaluation of a Parallel System" ",***International Conference on Operations and Quantitative Management, Number 1, pp. 157-168, 1997**J.Chen, S.Kanchi and J.L Gross "

*"Tight lower bound on maximum genus of simplicial graphs""***Discrete Mathematics>, 156, No. 1-3, pp. 83-102,1996**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, 1995.**J.Chen and S.Kanchi "Graph Imbeddings and Graph Ear Decompositions",

**Lecture Notes in Computer Science, 790, pp. 376-387, 1994**J.Chen, S.Kanchi and A.Kanevsky"

*On complexity of graph imbeddings",***Lecture Notes in Computer Science,709, pp 234-245, 1993**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, 1993**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, 1993**.S.Kanchi "

*"Hamiltonian Circuit in 2-regular digraphs"*",**Open Problems, SIAM Journal of Discrete Mathematics Summer 1993**.S.Kanchi and J.L. Kim "

*"Alternate Algorithms for Leader Election on Reliable and Unreliable Complete Networks "***", International Conference On Parallel And Distributed Computing Systems; 6th, pp 118-122, 1993**

**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", 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