Geometric Algorithms and its Applications in Wireless Networks, Ad hoc and Sensor Networks.
Teaching Experience
Worked as a teaching assistant in the Design and Analysis of Algorithms course offered to
the M. Tech (Computer Science) first year students (2006-2007 academic year) of Indian Statistical
Institute.
Worked as a teaching assistant in the Computational Geometry course offered to the
M. Tech (Computer Science) second year students (2004-2005/2005-2006 academic years) of Indian Statistical
Institute.
Academic Achievement
Awarded National Scholarship from Government of India on the
basis of B. Sc. result for pursuing higher education.
Visits abroad
Visited Department of Computer Science, City University of Hong Kong, Hong Kong,
China during June 13-23, 2006.
Publications
Book Chapter:
G. K. Das, S. Das and S. C. Nandy, Range Assignment Problem in Wireless Network,
Indian Statistical Institute Platinum Jubille Series on Statistical
Science and Interdisciplinary Research - Algorithms, Information Security and
Architecture vol. 3, pp. 195-224, 2008.
Journals:
G. K. Das and S. C. Nandy, Weighted Broadcast Range Assignment in Linear Radio Networks, Information Processing Letters , vol. 106, pp. 136-143, 2008.
G. K. Das, S. Roy, S. Das and S. C. Nandy, Variations of Base Station Placement Problem on the Boundary of a Convex Region, International Journal of Foundations of Computer Science, vol 19, pp. 405-427, 2008.
G. K. Das, S. C. Ghosh and S. C. Nandy, Improve Algorithm for
Minimum Cost Range Assignment
Problem for Linear Radio Networks, International Journal of Foundations of Computer Science, vol. 18, pp. 619-635, 2007.
G. K. Das, S. Das, S. C. Nandy and B. P. Sinha, Efficient Algorithm for Placing a Given Number of Base Stations to Cover a Convex Region, Journal of Parallel and Distributed Computing, vol. 66, no. 11, pp. 1353-1358, 2006.
G. K. Das, S. Das and S. C. Nandy, Range Assignment for Energy Efficient Broadcasting in Linear Radio Networks, Theoretical Computer Science, vol. 352, pp. 332-341, 2006.
Refereed Conference Proceedings:
G. K. Das, D. Mukhopadhyay and S. C. Nandy, Improved Algorithm for a Widest
1-corner Corridor, Third Annual Workshop on Algorithms and Computation
(WALCOM 2009), LNCS - 5431, pp. 83-92, 2009.
G. K. Das and S. C. Nandy, Weighted Broadcast in Linear Radio Networks, International
Conference on Algorithmic Aspects in Information and Management (AAIM 2006), LNCS 4041. pp. 343-353, 2006.
G. K. Das, S. Das and S. C. Nandy, Homogeneous 2-hops broadcast in 2D, The 2006 International
Conference on Computational Science and its Application (ICCSA 2006), LNCS 3981, pp. 750-759, 2006.
G. K. Das, S. Das, S. C. Nandy and B. P. Sinha, Placing a given number of base stations to
cover a convex region, International Workshop on Distributed Computing (IWDC 2005), LNCS 3741,
pp. 57-62, 2005.
G. K. Das, S. C. Ghosh and S. C. Nandy, Improved Algorithm for Minimum Cost Range Assignment
Problem for Linear radio Networks, International Workshop on Distributed Computing (IWDC 2004),
LNCS 3326, pp. 412-423, 2004.
G. K. Das, S. Das and S. C. Nandy, Efficient Algorithms for Energy Efficient Broadcasting in
Linear Radio Networks, International Conference on High Performence Computing (HiPC 2004),
LNCS 3296, pp. 420-429, 2004.
G. K. Das, S. C. Ghosh and S. C. Nandy, An Efficient Heuristic Algorithm for 2D h-Hops Range
Assignment Problem, IEEE Global Telecommunication Conference (GLOBECOM 2004),
vol. 2, pp. 1051 - 1055, 2004.
Curriculum Vitae [PDF]
Last Modified Aug. 28, 2007