KIC-TEQIP Workshop: Algorithms In Engineering
"Don't believe what your eyes are telling you. All they show is limitation.
Look with your understanding, find out what you already know, and you'll see the way to fly."
~ Richard Bach

Information for Computer Programming (c) course MA511

Photo of gautam

Gautam K. Das
Department of Mathematics
Indian Institute of Technology Guwahati
Guwahati - 781039
Assam, India
Phone: +91 361 258 2626
Fax: +91 361 258 2649
Email: gkd <*|at|*> iitg <.> ernet <.> in





Academic Qualification


Experience

Research Interests


Teaching Experience


Academic Achievement


Visits


Publications

    Book Chapter:

  1. 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.
  2. Journals:

  3. P. Carmi, G. K. Das, R. K. Jallu, S. C. Nandy, P. R. Prasad and Y. Stein, Minimum Dominating Set Problem for Unit Disks Revisited, International Journal of Computational Geometry and Applications, Vol. 25, pp. 227-244, 2015.
  4. M. Basappa,R. Acharyya and G. K. Das, Unit Disk Cover Problem in 2D, Journal of Discrete Algorithms, Vol. 33, pp. 193-201, 2015.
  5. G. K. Das, M. De, S. Kolay, S. C. Nandy and S. Sur-Kolay, Approximation Algorithms for Computing Maximum Independent Set of a Unit Disk Graph, Information Processing Letters, Vol. 115, pp. 439-446, 2015.
  6. M. De, G. K. Das, P. Carmi and S. C. Nandy, Approximation algorithms for a variant of Discrete Piercing Set Problem for Unit Disks, International Journal of Computational Geometry and Applications (IJCGA), Vol. 23, pp. 461-477, 2013.
  7. G. K. Das, R. Fraser, A. Lopez-Ortiz and B. G. Nickerson, On the discrete unit disk cover problem, International Journal of Computational Geometry and Applications (IJCGA), vol. 22, pp 407-419, 2012.
  8. F. Claude, G. K. Das, R. Dorrigiv, S. Durocher, R. Fraser, A. López-Ortiz, B. G. Nickerson and A. Salinger, An improved line-separable algorithm for discrete unit disk cover, Discrete Mathematics, Algorithms, and Application , vol. 2, pp 77-87, 2010.
  9. G. K. Das, S. Das and S. C. Nandy, Homogeneous 2-hop broadcast in 2D, Computational Geometry:Theory and Applications , vol. 43, pp. 182-190, 2010.
  10. G. K. Das, D. Mukhopadhyay and S. C. Nandy, Improved algorithm for a widest 1-corner corridor, Information Processing Letters , vol. 109, pp. 1060-1065, 2009.
  11. G. K. Das and S. C. Nandy, Weighted Broadcast Range Assignment in Linear Radio Networks, Information Processing Letters , vol. 106, pp. 136-143, 2008.
  12. 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.
  13. 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.
  14. 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.
  15. 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.
  16. Refereed Conference Proceedings:

  17. Ramesh K. Jallu and Gautam K. Das, Improved Algorithm for Maximum Independent Set on Unit Disk Graph, International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2016), LNCS 9602, pp. 212-223, 2016.
  18. Manjanna B., Ramesh K. Jallu and Gautam K. Das, Constrained k-Center Problem on a Convex Polygon, The 15th International Conference on Computational Science and its Application (ICCSA 2015), LNCS - 9156, pp. 209-222, 2015.
  19. Rashmisnata Acharyya, Manjanna B., Gautam K. Das, Unit disk cover problem in 2D, The 13th International Conference on Computational Science and its Application (ICCSA 2013), LNCS - 7972, pp. 73-85, 2013.
  20. P. Agrawal and G. K. Das, Improved interference in wireless sensor networks, International Conference on Distributed Computing and Internet Technologies (ICDCIT 2013), LNCS - 7753, pp. 92-102, 2013.
  21. M. De, G. K. Das and S. C. Nandy, Approximation algorithms for the discrete piercing set problem for unit disks, Canadian Conference on Computational Geometry (CCCG 2011), pp. 375-380, 2011.
  22. G. K. Das, R. Fraser, A. López-Ortiz and B. G. Nickerson, On the discrete unit disk cover problem, Fifth Annual Workshop on Algorithms and Computation (WALCOM 2011), LNCS - 6552, pp. 146-157, 2011.
  23. G. K. Das and B. G. Nickerson, I/O-efficient triangular range search and its application, Canadian Conference on Computational Geometry (CCCG 2010), pp. 245-248, 2010.
  24. G. K. Das, A. Mukhopadhyay, S. C. Nandy, S. Patil and S. V. Rao, Computing the straight skeleton of a monotone polygon in O(n log n) time, Canadian Conference on Computational Geometry (CCCG 2010), pp. 207-210, 2010.
  25. G. K. Das and B. G. Nickerson, I/O-efficient rectangular segment search, The 2010 International Conference on Computational Science and its Application (ICCSA 2010), pp. 61-67, 2010.
  26. 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.
  27. G. K. Das, S. Roy, S. Das and S. C. Nandy, Base Station Placement Problem on the Boundary of a Convex Region, First Annual Workshop on Algorithms and Computation (WALCOM 2007), pp. 151-152, 2007.
  28. 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.
  29. 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.
  30. 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.
  31. 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.
  32. 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.
  33. 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.
  34. Technical Reports:

  35. R. Acharyya, Manjanna B. and G. K. Das, Unit Disk Cover Problem (2012), http://arxiv.org/abs/1209.2951
  36. P. Agrawal and G. K. Das, Improved Interference in Wireless Sensor Networks (2012), http://arxiv.org/abs/1207.5708

    Manuscripts under consideration (Journal):

  37. Ramesh K. Jallu, Prajwal R. Prasad and Gautam K. Das, Distributed construction of connected dominating set in unit disk graphs, (submitted) 2015.
  38. Manjanna B., Ramesh K. Jallu, Gautam K. Das and Subhas C. nandy, The Euclidean k-supplier problem in R^2, (submitted) 2015.



Last Modified June 12, 2015