|Professor School of Technology and Computer Science Tata Institute of Fundamental Research Homi Bhabha Road,   Mumbai 400005,   India Tel. No :91-22- 2278 2546 (Office) Fax No :91-22- 2278 2299 and 91-22- 2280 4610 E-Mail address :email@example.com firstname.lastname@example.org||
"As the different streams
having there sources in different places
all mingle their water in the sea,
so, O Lord, the different paths which men take
through different tendencies,
various though they appear, crooked or straight,
all lead to Thee."
2. Exploring Unknown Polygonal Environments with Discrete Visibility
3. Approximation Algorithms for Art Gallery Problems in Polygons and Terrains
4. Recognizing and Characterizing Visibility Graphs of Simple Polygons
5. Computing a Maximum Clique in Visibility Graphs
6. Online Algorithms for Searching and Exploration in the Plane
7. Visibility Graph Theory for Polygons
8. Visibility Graph Theory for Points
9. Robot Path Planning: Off-line and On-line Algorithms
10. Introduction to Approximation Algorithms
11. Introduction to Computational Geometry
12. Two Unsolved Problems on Triangulating Planar Point Sets
Mumbai, July 22-23, 2008. (i) Workshop Brochure , (ii) Lecture Slides.
IIT Kharagpur, October 31-November 2, 2008.
BITS Pilani, January 22-24, 2009.
and Geometric Algorithms", IISc Bangalore, July 15-18, 2009.
Algorithms", NIT Tiruchirapalli, January 7-9, 2010.
Algorithms", BHU Varanasi, January 27-29, 2010.
Algorithms", NIT Rourkela, March 25-27, 2010.
Algorithms", Thapar University Patiala, October 28-30, 2010.
Algorithms", PSG College of Technology, Anna University Coimbatore,
January 6-8, 2011.
Algorithms", NIT Patna, March 26-28, 2011.
Algorithms", IIT Guwahati, October 21-23, 2011.
Algorithms", NIT Karnataka, January 10-12, 2012.
Algorithms", DAIICT Gandhi Nagar, March 14-16, 2012.
Algorithms", IIITDM Jabalpur, November 1-3, 2012.
Algorithms", BITS Pilani Goa, January 17-19, 2013.
ISI Kolkata and RKMVU Belur, February 11-13, 2013.
Algorithms", BESU Shibpur, March 14-16, 2013.
Algorithms", NIT Warangal, October 23-25, 2013.
IIT Madras, February 10-11, 2014.
(The Research Promotion Workshop series is funded by the National Board
for Higher Mathematics).
February 18-20, 2009.
February 10-12, 2010.
February 18-20, 2011.
February 15-17, 2012.
February 14-16, 2013.
February 13-15, 2014.
Abū Jafar Muhammad al-Khwārizmī, a Persian astronomer and mathematician, wrote a treatise in 825 AD, Kitāb hisāb al-adad al-hindī (Book on Calculation with Hindu Numerals), which was translated into Latin in the early 12th century as Liber Algorismi de numero Indorum (The Book of Algorismi on Indian Numerals). The word "Algorism"- the Latin form of al-Khwārizmī's name - came to be applied to any systematic work on ancient Indian-style computational mathematics. The present term "algorithm" is a distorted form of "algorism".
The study of algorithms is at the very heart of computer science. In the last five decades, a number of significant advances have been made in the field of algorithms ranging from the development of faster algorithms to the startling discovery of some natural problems for which all known algorithms are found to be inefficient. These results triggered considerable interest in the study of algorithms, and the area of algorithm design and analysis has evolved into a field of interest.
Teaching and research in this foundational aspect of computing is therefore a natural and desirable thrust area. Hence, algorithmic studies form a major component of computer science and discrete mathematics programs in colleges and universities. In the last four decades, graph and geometric problems have been studied by researchers of computer science and discrete mathematics using the framework of analysis of algorithms.
A series of workshops of introductory lectures on graph and geometric algorithms is being organized for teachers and students (undergraduate, post-graduate and doctoral) at engineering colleges and universities at different locations in India. These introductory workshops provide opportunities to participants for getting exposed to the field of graph and geometric algorithms, which may help them in future in solving graph and geometric problems and designing new algorithms. With this objective, graph and geometric theory and algorithms for some problems with applications are presented in the workshop by a distinguished panel of speakers.