Background

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 programs in colleges and universities.

In the last four decades, graph and geometric problems have been studied by computer science researchers using the framework of analysis of algorithms. Graph theory is the study of the properties of graphs. Graph algorithms are one of the oldest classes of algorithms and they have been studied for almost 300 years. Graphs provide essential models for many applications areas of computer science, and at the same time, they are fascinating objects of study in pure and applied mathematics. There have been a number of exciting recent developments in graph theory that are important for designers of algorithms to know about. Correspondingly, the algorithmic viewpoint of computer science has stimulated much research in graph theory. Graph theory and graph algorithms are inseparably intertwined subjects.

On the other hand, the main impetus for the development of geometric algorithms came from the progress in computer graphics, computer-aided design and manufacturing. In addition, algorithms are also designed for geometric problems that are classical in nature. The success of the field can be explained from the beauty of the geometry problems studied, the solutions obtained, and by the many application domains- computer graphics, geographic information systems, robotics and others, in which geometric algorithms play a crucial role. [Top]

Objectives

Graph and geometric algorithms are at the heart of many computer applications. So, it is expected that computer scientists and professional programmers know frequently used algorithms and generic techniques for efficient organization and retrieval of data, modeling, understanding and solving graph and geometric problems. This introductory workshop provides an opportunity to the 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 will be presented in the workshop by a distinguished panel of speakers. [Top]

Areas

Geometric Algorithms, Graph Algorithms, Graph Theory, Randomized Algorithms, Approximation Algorithms, Data Structures, Algorithmic Techniques, Computational Geometry, Combinatorial Geometry, Computer Graphics, Discrete Mathematics. [Top]

Participants

Teachers and students (undergraduate, post-graduate and doctoral) of Computer Science and Engineering are eligible to attend this workshop. Participants are expected to have taken introductory courses in Discrete Mathematics, Data Structures and Algorithms. Scientists and engineers working in research laboratories or industries with required background are also welcome to attend the workshop. [Top]

Benefits

Participants will be exposed to key tools and techniques in the field of graph and geometric algorithms. Speakers are key figures in their respective research areas, and the purpose of the workshop is to expose students, teachers, and computer professionals to various key developments in these research areas. This will benefit the participants in designing, analyzing and implementing complex software, especially arising in the field of robotics, geographical information systems, route planning, wireless and mobile networks. Workshop may lead to active collaboration between participants and resource persons in these areas. Participants will be issued certificates for attending the workshop. [Top]

Coordinators

• Prof. Subir Kumar Ghosh (Co-Convener), School of Technology & Computer Science, Tata Institute of Fundamental Research, Mumbai 400005.
• Prof. Rahul Muthu (Co-Convener), Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar 382 007.
• Prof. V. Sunitha, Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar 382 007.
• Prof. Srikrishnan Divakaran, Dhirubhai Ambani Institute of Information and Communication Technology, Gandhinagar 382 007.
• Prof. Sathish Govindarajan,Department of Computer Science & Automation, Indian Institute of Scince, Bangalore 560012.
[Top]

Course Outline

Algorithmic Paradigms:

• Speaker: Srikrishnan Divakaran, Dhirubhai Ambani Institute of Information and Communication Technology.
  Topic: Introduction to Randomized Algorithms.
• Speaker: Daya Gaur, Indian Institute of Technology, Ropar.
  Topic: Introduction to Approximation Algorithms.

Graphs & Algorithms:

• Speaker: Abhiram G. Ranade, Indian Institute of Technology, Bombay.
  Topic: Some Formulations of the Genome Assembly Problem.
• Speaker: Sachin Patkar, Indian Institute of Technology, Bombay.
  Topic: Network Flows and Applications.
• Speaker: Niranjan Balachandran, Indian Institute of Technology, Bombay.
  Topic: Graph Coloring.
• Speaker: Ashok Thakorbhai Amin, Dhirubhai Ambani Institute of Information & Communication Technology, Gandhinagar.
  Topic: On Uniformly Optimally Reliable Networks.

Geometry & Algorithms:

• Speaker: Sathish Govindarajan, Indian Institute of Science, Bangalore.
  Topic: Introduction to Combinatorial Geometry.
• Speaker: Subir Kumar Ghosh, Tata Institute of Fundamental Research
  Topic: Introduction to Computational Geometry.
• Speaker: Sudebkumar Prasant Pal, Indian Institute of Technology, Kharagpur.
  Topic: Geometric Data Structures.

Geometry and Applications:

• Speaker: Subodh Kumar, Indian Institute of Technology, Delhi.
  Topic: Cache Friendly Compressed Representation for Geometry.
• Speaker: Sharat Chandran, Indian Institute of Technology, Bombay.
  Topic: Using Shape Spaces for Structure for Motion.
• Speaker: Amitabha Mukerjee, Indian Institute of Technology, Kanpur.
  Topic: Manifold Discovery in High-Dimensional Data.

Registration

1. There is no registration fee.
2. A limited number of travel support is available for outstation participants from Western India.
3. Accommodation is available for outstation participants.
4. Maximum of 100 applications will be selected for the workshop.
5. Lunch will be provided free of cost to all participants at the workshop venue for all three days.
6. Registration is closed.
7. Spot registration may be possible on the first day of the workshop subject to the availability of seats.