| |
|
|
Name |
KRISHNENDU BASULI |
|
Designation
|
ASSISTANT PROFESSOR
|
|
Highest Degree
|
Master of Computer Science
|
|
Research Interest
|
Graph Theory, Soft Computing.
|
|
Teaching
|
Graph Theory, Computer Network, OOPs etc.
|
List of Publications
1. Spanning Tree Generation in the Limelight, S. Naskar, K.Basuli, S.S.Sarma, and R.K.Pal, Proc. of the National Seminar on Recent Advances in Operational Research and Related Computational Aspects, Department of Applied Mathematics, University of Calcutta,Kolkata, India, pp. 57-60, Aug. 22-23, 2007.
2. Serial Port Data Communications using MODBUS Protocol, S.Naskar, K.Basuli, and S.S.Sarma, ACM Ubiquity, Volume 9, Issue 3, January 22-28, 2008.
3. Generation of a Random Simple Graph and Its Graphical Presentation, K.Basuli and S.Naskar, ACM Ubiquity, Volume 9, Issue 10, March 11-17, 2008.
4. On Degree Sequence, S.Naskar, K.Basuli, S.S.Sarma, and K.N.Dey, ACM Ubiquity, Volume 9, Issue 16, April 22-28, 2008.
5. Content-Based Image Retrieval System, M.M.Sardar, K.Basuli, and S.Naskar, ACM Ubiquity, Volume 9, Issue 32, August 12-18, 2008.
6. When a Degree Sequence represents a Tree Sequence, S.Naskar, K.Basuli, and S.S.Sarma, ICFAI University Journal of Computer Science, Volume 2, No. 3, p.p.-62-69, 2008.
7. Determination of Hamiltonian Circuit and Euler Trail from a Given Degree Sequence, K.Basuli, S.Naskar, and S.S.Sarma, Journal of Physical Science, Volume 12, 2008, pp.- 249-252.
8. Finding Maximum Clique Number of a Graph from its Degree Sequence, S.Naskar, K.Basuli, and S.S.Sarma, ICACT-2008, Hydrabad, Paper Id: TN285, 2008.
9. Obscure History of Graphs, S.S.Sarma, S.Naskar, K.Basuli, and R.Halder, The ICFAI University Journal of Computer Sciences, Vol. III, No. 2, pp.74-78, 2009.
10. Generation of All Spanning Trees of a Simple, Symmetric Connected Graph, K. Basuli, S. Naskar, S.S.Sarma, SSRN, December 30, 2009
|
|
