Academic Qualification

• Ph. D. in Computer Science from Indian Statistical Institute, Kolkata, India, in June 2008.
  Thesis Title : Placement and Range Assignment in Power-aware Radio Networks
  Thesis Advisor : Professor Subhas C. Nandy
• Master of Technology in Computer Science from Indian Statistical Institute, Kolkata, India, in 2002.
• Master of Science in Applied Mathematics from Calcutta University, Kolkata, India, in 2000.
• Bachelor of Science (B.Sc) in Mathematics Hons. from Calcutta University, Kolkata, India, in 1998.

Experience

June, 2021 - till date

Professor
Department of Mathematics
Indian Institute of Technology Guwahati
Guwahati, Assam, India

March, 2016 - June, 2021

Associate Professor
Department of Mathematics
Indian Institute of Technology Guwahati
Guwahati, Assam, India

May, 2011 - March, 2016

Assistant Professor
Department of Mathematics
Indian Institute of Technology Guwahati
Guwahati, Assam, India

May, 2009 - April, 2011:

Postdoctoral Fellow
Faculty of Computer Science
University of New Brunswick
New Brunswick, Canada
Advisor : Professor Bradford G. Nickerson

February, 2008 - March, 2009:

Associate Computer Scientist
Tor Anumana Technologies Pvt. Ltd.
Kolkata, India

June, 2007 - January, 2008:

Project Linked Personnel
Advanced Computing and Microelectronics Unit
Indian Statistical Institute, Kolkata, India
Project: Sensor Network Management: A Geometric Approach
Advisor : Professor Subhas C. nandy

August, 2004 - June, 2007:

Senior Research Fellow
Advanced Computing and Microelectronics Unit
Indian Statistical Institute, Kolkata, India
Advisor : Professor Subhas C. nandy

August, 2002 - August, 2004:

Junior Research Fellow
Advanced Computing and Microelectronics Unit
Indian Statistical Institute, Kolkata, India
Advisor : Professor Subhas C. Nandy

Research Interests

• Data Structure and Algorithms
• Approximation Algorithms
• Geometric Algorithms

Teaching Experience

Computer Programming (MA511), July-November, 2015 offered to M. Sc. (M & C) of IITG.
• Computer Programming (MA511), Summer, 2015 offered to M. Sc. (M & C) of IITG.
• Data Structures and Algorithms (MA512), Summer, 2015 offered to M. Sc. (M & C) of IITG (Half Course).
• Formal Languages and Automata Theory (MA351), January-May, 2015 offered to B. Tech. (M & C)of IITG.
• Mathematics-I (MA101), July-November, 2014 offered to all B. Tech students of IITG.
• Formal Languages and Automata Theory (MA351 and CS 203), Summer, 2014 offered to B. Tech. (M & C) and B. Tech (Computer Science) of IITG.
• Data Structures and Algorithms (MA252), Summer, 2014 offered to B. Tech. (M & C) of IITG.
• Data Structures and Algorithms (MA512), January - May, 2014 offered to M. Sc. (M & C) of IITG.
• Theory of Computation (MA453), July-November, 2013 offered to B. Tech (M & C) of IITG.
• Formal Languages and Automata Theory (MA351 and CS 203), Summer, 2013 offered to B. Tech. (M & C) and B. Tech (Computer Science) of IITG (Half course).
• Theory of Computation (MA514 and CS 302), Summer, 2013 offered to M. Sc. (M & C) and B. Tech (Computer Science) of IITG (Half course).
• Data Structures and Algorithms (MA512), January - May, 2013 offered to M. Sc. (M & C) of IITG.
• Computer Programming (MA511), July - November, 2012 offered to M. Sc. (M & C) of IITG.
• Theory of Computation (MA352 and CS 302), Summer, 2012 offered to B. Tech (M & C) and B. Tech (Computer Science) of IITG.
• Theory of Computation (MA514), January - May, 2012 offered to M. Sc. (M & C) of IITG.
• Formal Languages and Automata Theory (MA513), July - November, 2011 offered to M. Sc. (M & C) of IITG.
• 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

• Technical Program Committee Member, IEEE International Conference on Advanced Networks and Telecommunication Systems (ANTS) 2015

• Technical Program Committee Member, The 10th International Workshop on Algorithms and Computation (WALCOM) 2016

• Awarded under Microsoft Outstanding Young Faculty Programme at Indian Institute of Technology Guwahati, Assam, India.

• Awarded National Scholarship from Government of India on the basis of B. Sc. result for pursuing higher education.

Visits

• Visited Department of Computer Science, University of Waterloo, Canada during June 2-3, 2009.

• Visited Department of Computer Science, City University of Hong Kong, Hong Kong, China during June 13-23, 2006.

Publications

Books (edited):

1. Gautam K. Das, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, Shin-Ichi Nakano, WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 - March 2, 2019, Proceedings, Lecture Notes in Computer Science 11355, Springer 2019, ISBN 978-3-030-10563-1.

Book Chapter:

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

3. Manjanna Basappa, Ramesh K. Jallu and Gautam K. Das, Constrained k-Center Problem on a Convex Polygon, International Journal of Foundations of Computer Science (accepted).
4. Gautam K. Das, Guilherme D.da Fonseca and Ramesh K. Jallu, Efficient independent set approximation in unit disk graphs, Discrete Applied Mathematics (In Press).
5. Manjanna Basappa and Gautam K. Das, Discrete unit square cover problem, Discrete Mathematics, Algorithms, and Application, vol. 10, pages. 1850072, 2018.
6. Ramesh K. Jallu, Prajwal R. Prasad and Gautam K. Das, Distributed construction of connected dominating set in unit disk graphs, Journal of Parallel and Distributed Computing, vol. 104, pp. 159-166, 2017.
7. 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.
8. M. Basappa,R. Acharyya and G. K. Das, Unit Disk Cover Problem in 2D, Journal of Discrete Algorithms, Vol. 33, pp. 193-201, 2015.
9. 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.
10. 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.
11. 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.
12. 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.
13. 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.
14. 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.
15. G. K. Das and S. C. Nandy, Weighted Broadcast Range Assignment in Linear Radio Networks, Information Processing Letters , vol. 106, pp. 136-143, 2008.
16. 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.
17. 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.
18. 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.
19. 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:

20. Pawan K. Mishra, Sangram K. Jena, Gautam K. Das and S. V. Rao, Capacitated Discrete Unit Disk Cover, The 13th International Conference on Algorithms and Computation (WALCOM 2019), LNCS 11355, pp. 407-418, 2019.
21. Ramesh K. Jallu, Sangram K. Jena and Gautam K. Das, Liar's Dominating Set in Unit Disk Graphs, The 24th International Conference on Computing and Combinatorics (COCOON 2018), LNCS 10976, pp. 516-528, 2018.
22. Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das and Subhas C. Nandy, The Maximum Distance-d Independent Set Problem on Unit Disk Graphs, The 12th International Workshop on Frontiers in Algorithmics(FAW 2018), LNCS 10823, pp. 68-80, 2018.
23. Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das and Subhas C. Nandy, Guarding Polyhedral Terrain by k-Watchtowers, The 12th International Workshop on Frontiers in Algorithmics(FAW 2018), LNCS 10823, pp. 112-125, 2018.
24. Ramesh K. Jallu and Gautam K. Das, Liar's Domination in 2D, International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2017), LNCS 10156, pp. 219-229, 2017.
25. Manjanna Basappa, Ramesh K. Jallu, Gautam K. Das and Subhas C. Nandy, The Euclidean k-Supplier Problem in R^2, The 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks (ALGOSENSORS 2016), LNCS 10050, pp. 129-140, 2016.
26. 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.
27. 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.
28. 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.
29. 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.
30. 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.
31. 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.
32. 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.
33. 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.
34. 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.
35. 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.
36. 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.
37. 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.
38. 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.
39. 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.
40. 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.
41. 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.
42. 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.

Technical Reports:

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