KICTEQIP 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
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
 Ph. D. in Computer Science from Indian Statistical Institute, Kolkata,
India, in June 2008.
 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
February, 2008  March, 2009:
Associate Computer Scientist
Tor Anumana Technologies Pvt.
Ltd.
Kolkata, India
June, 2007  January, 2008:
August, 2004  June, 2007:
August, 2002  August, 2004:
Research Interests
 Data Structure and Algorithms
 I/Oefficient Geometric Algorithms
 Complexity Theory
 Approximation Algorithms
 Geometric Algorithms and its Applications in Wireless Networks, Ad hoc and
Sensor Networks.
Teaching Experience
Computer Programming (MA511), JulyNovember, 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), JanuaryMay, 2015
offered to B. Tech. (M & C)of IITG.
 MathematicsI (MA101), JulyNovember, 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), JulyNovember, 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 (20062007 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
(20042005/20052006 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 23, 2009, as part of NSERC strategic Grant "Optimal Data Structures for Organization and Retrieval of Spatial Data".
 Visited Department of Computer Science, City University of Hong Kong, Hong
Kong, China during June 1323, 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. 195224, 2008.
Journals:
 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. 227244, 2015.
 M. Basappa,R. Acharyya and G. K. Das,
Unit Disk Cover Problem in 2D,
Journal of Discrete Algorithms, Vol. 33, pp. 193201, 2015.
 G. K. Das, M. De, S. Kolay, S. C. Nandy and S. SurKolay,
Approximation Algorithms for Computing Maximum Independent Set of a Unit Disk Graph,
Information Processing Letters, Vol. 115, pp. 439446, 2015.
 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. 461477, 2013.
 G. K. Das, R. Fraser, A. LopezOrtiz and B. G. Nickerson,
On the discrete unit disk cover problem,
International Journal of Computational Geometry and Applications (IJCGA),
vol. 22, pp 407419, 2012.
 F. Claude, G. K. Das, R. Dorrigiv, S. Durocher, R. Fraser, A. LópezOrtiz, B. G. Nickerson and A. Salinger,
An improved lineseparable algorithm for discrete unit disk cover,
Discrete Mathematics, Algorithms, and Application , vol. 2, pp 7787, 2010.
 G. K. Das, S. Das and S. C. Nandy,
Homogeneous 2hop broadcast in 2D,
Computational Geometry:Theory and Applications ,
vol. 43, pp. 182190, 2010.
 G. K. Das, D. Mukhopadhyay and S. C. Nandy,
Improved algorithm for a widest 1corner corridor,
Information Processing Letters , vol. 109, pp. 10601065, 2009.
 G. K. Das and S. C. Nandy, Weighted Broadcast Range Assignment in
Linear Radio Networks, Information Processing Letters
, vol. 106, pp. 136143, 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. 405427, 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. 619635, 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. 13531358, 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. 332341, 2006.
Refereed Conference Proceedings:
 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. 212223, 2016.
 Manjanna B., Ramesh K. Jallu and Gautam K. Das,
Constrained kCenter Problem on a Convex Polygon,
The 15th International Conference on Computational Science
and its Application (ICCSA 2015), LNCS  9156, pp. 209222, 2015.
 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. 7385, 2013.
 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. 92102, 2013.
 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. 375380, 2011.
 G. K. Das, R. Fraser, A. LópezOrtiz and B. G. Nickerson,
On the discrete unit disk cover problem,
Fifth Annual Workshop on Algorithms and Computation (WALCOM 2011), LNCS  6552, pp. 146157, 2011.
 G. K. Das and B. G. Nickerson,
I/Oefficient triangular range search and its application,
Canadian Conference on Computational Geometry (CCCG 2010), pp. 245248, 2010.
 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. 207210, 2010.
 G. K. Das and B. G. Nickerson,
I/Oefficient rectangular segment search,
The 2010 International Conference on Computational Science and its Application (ICCSA 2010), pp. 6167, 2010.
 G. K. Das, D. Mukhopadhyay and S. C. Nandy, Improved Algorithm for a
Widest 1corner Corridor, Third Annual Workshop on Algorithms
and Computation (WALCOM 2009), LNCS  5431, pp. 8392, 2009.
 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. 151152, 2007.
 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. 343353,
2006.
 G. K. Das, S. Das and S. C. Nandy, Homogeneous 2hops broadcast in
2D, The 2006 International Conference on Computational Science
and its Application (ICCSA 2006), LNCS 3981, pp. 750759, 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.
5762, 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. 412423, 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. 420429, 2004.
 G. K. Das, S. C. Ghosh and S. C. Nandy, An Efficient Heuristic
Algorithm for 2D hHops Range Assignment Problem, IEEE Global
Telecommunication Conference (GLOBECOM 2004), vol. 2, pp. 1051 
1055, 2004.
Technical Reports:
 R. Acharyya, Manjanna B. and G. K. Das, Unit Disk Cover Problem (2012),
http://arxiv.org/abs/1209.2951
 P. Agrawal and G. K. Das, Improved Interference in Wireless Sensor Networks (2012),
http://arxiv.org/abs/1207.5708
Manuscripts under consideration (Journal):

Ramesh K. Jallu, Prajwal R. Prasad and Gautam K. Das,
Distributed construction of connected dominating set in unit disk graphs, (submitted) 2015.

Manjanna B., Ramesh K. Jallu, Gautam K. Das and Subhas C. nandy,
The Euclidean ksupplier problem in R^2, (submitted) 2015.
Last Modified June 12, 2015