Professor Ph.D. (ISI Kolkata)
+91 (0)361 258 2626 gkd ◊ iitg ⋅ ac ⋅ in
Research Area: Computational Geometry, Approximation Algorithms, Wireless Networks
Room No: E1-311
Personal Website | IRINS Profile
Department Responsibilities:
M.Tech (DS), Department of Mathematics
March, 2016 - till date
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
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.
1. Gautam K. Das, Partha Sarathi Mandal, Krishnendu Mukhopadhyaya, Shin-Ichi Nakano (Eds.), "WALCOM: Algorithms and Computation - 13th International Conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019, Proceedings", 0 , Springer (Part of the Lecture Notes in Computer Science book series) , vol.11355 (978-3-030-10563-1) ,pp.420 [2019]
16. Manjanna Basappa, Gautam K. Das., "Discrete unit square cover problem.", Discrete Mathematics, Algorithms and Applications , vol.10 (6) ,pp.1850072:1-1850072-18., [2018]
15. Manjanna Basappa, Gautam K. Das., "Discrete unit square cover problem.", Discrete Mathematics, Algorithms and Applications , vol.10 (6) ,pp.1850072:1-1850072-18., [2018]
14. G. K. Das, M. De, S. Kolay, S. C. Nandy, S. Sur-Kolay., "Approximation Algorithms for Computing Maximum Independent Set of a Unit Disk Graph", Information Processing Letters , vol.115 ,pp.439-446, [2015]
13. M. Basappa, R. Acharyya, G. K. Das., "Unit Disk Cover Problem in 2D", Journal of Discrete Algorithms , vol.33 ,pp.193-201, [2015]
12. P. Carmi, G. K. Das, R. K. Jallu, S. C. Nandy, P. R. Prasad, Y. Stein., "Minimum Dominating Set Problem for Unit Disks Revisited", International Journal of Computational Geometry and Applications. , vol.25 (3) ,pp.227-244, [2015]
11. Minati De, Gautam K. Das, Paz carmi, Subhas C. nandy., "Approximation Algorithms for the Discrete Piercing Set Problem for Unit Disks", International Journal of Computational Geometry and Applications (IJCGA) , vol.23 (6) ,pp.461-477, [2013]
10. G. K. Das, R. Fraser, A. Lopez-Ortiz, B. G. Nickerson., "On the discrete unit disk cover problem", International Journal of Computational Geometry and Applications (IJCGA) , vol.22 ,pp.407-419, [2012]
9. G. K. Das, S. Das, S.C. Nandy., "Homogeneous 2-hop broadcast in 2D.", Computational Geometry : Theory and Applications , vol.43 ,pp.182-190, [2010]
8. G. K. Das, F. Claude, R. Dorrigiv, S. Durocher, R. Fraser, A. Lopex-Oritz, B. G. Nickerson, A. Salinger., "An improved line-separable algorithm for discrete unit disk cover.", Mathematics, Algorithms, and Application. , vol.2 ,pp.77-87, [2010]
7. G. K. Das, D. Mukhopadhyay, S.C. Nandy., "Improved algorithm for a widest 1-corner corridor.", Information Processing Letters. , vol.109 ,pp.1060-1065, [2009]
6. G. K. Das, S. Roy, S. Das, 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]
5. G. K. Das, S.C. Nandy., "Weighted Broadcast Range Assignment in Linear Radio Networks.", Information Processing Letters. , vol.106 ,pp.136-143, [2008]
4. G. K. Das, S. Das, 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]
3. G. K. Das, S.C. Ghosh, 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]
2. G. K. Das, S. C. Das, S.C. Nandy., "Range Assignment for Energy Efficient Broadcasting in Linear Radio Networks.", Theoretical Computer Science. , vol.352 ,pp.332-341, [2006]
1. G. K. Das, S. C. Das, B.P. Sinha, S.C. Nandy., "Efficient Algorithm for Placing a Given Number of Base Stations to Cover a Convex Region.", Journal of Parallel and Distributed Computing. , vol.66 (11) ,pp.1353-1358, [2006]
22. Pawan K. Mishra, Sangram K. Jena, Gautam K. Das, S.V. Rao., "Capacitated Discrete Unit Disk Cover.", The 13th International Conference on Algorithms and Computation. ,pp.407-418, [2019]
21. Nitesh Tripathi, Manjish Pal, Minati De, Gautam K. Das, Subhas C. Nandy., "Guarding Polyhedral Terrain by k-Watchtowers.", The 12th International Workshop on Frontiers in Algorithmics. ,pp.112-125, [2018]
20. Sangram K. Jena, Ramesh K. Jallu, Gautam K. Das, Subhas C. Nandy., "The Maximum Distance-d Independent Set Problem on Unit Disk Graphs.", The 12th International Workshop on Frontiers in Algorithmics. ,pp.68-80, [2018]
19. Ramesh K. Jallu, Sangram K. Jena, Gautam K. Das., "Liar's Dominating Set in Unit Disk Graphs.", The 24th International Conference on Computing and Combinatorics. ,pp.516-528, [2018]
18. R. K. Jallu, G. K. Das., "Improved Algorithm for Maximum Independent Set on Unit Disk Graph.", Second International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2016), LNCS-9602 (Springer-Verlag), pp. 212-223, Thiruvananthapuram, India, February 18-20. [2016]
17. M Basappa, R. K. Jallu, G. K. Das., "Constrained k-Center Problem on a Convex Polygon.", The 15th International Conference on Computational Science and its Application (ICCSA 2015), LNCS - 9156(Springer-Verlag), Banff, AB, Canada, June 22-25. ,pp.209-222, [2015]
16. Rashmisnata Acharyya, Manjanna B., G. 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]
15. P. Agrawal, 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]
14. G.K. Das, R. Fraser, A. Lopez-Ortiz, 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]
13. M. De, G. K. Das, 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]
12. G.K. Das, B. G. Nickerson., "I/O-efficient rectangular segment search.", The 2010 International Conference on Computational Science and its Application (ICCSA 2010). ,pp.161-67, [2010]
11. G.K. Das, A. Mukhopadhyay, S. C. Nandy, S. Patil, 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]
10. G.K. Das, B. G. Nickerson., "I/O-efficient triangular range search and its application.", Canadian Conference on Computational Geometry (CCCG 2010). ,pp.245-248, [2010]
9. G.K. Das, D. Mukhopadhyay, 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]
8. G. K. Das, S. Das, 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. ,pp.195-224, [2008]
7. G.K. Das, S. Roy, 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]
6. G.K. Das, S. Das, 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]
5. G.K. Das, 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]
4. G.K. Das, S. Das, S. C. Nandy, 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]
3. G.K. Das, S.C. Ghosh, 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]
2. G.K. Das, S. Das, 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]
1. G.K. Das, S.C. Ghosh, 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]
Research Scholars
| 1 | Sasmita Rout |
| 1 | Sangram Kishor Jena |
| 2 | Manjanna B |
| 3 | Ramesh Kumar Jallu |
No Project Available!
