| Name | Affiliation | Talk Title |
| Meena Mahajan | IMSc Chennai | Simultaneous Matchings |
| Kavitha Telikepalli | IISc Bangalore | Approximate distances in weighted graphs |
| G. Sajith | IIT Guwahati | |
| N.S. Narayanaswamy | IIT Chennai | Interval graph coloring |
| Subir Ghosh | TIFR Mumbai | |
| Ramesh Krishnamurthi | Simon Fraser U. | |
| Abhiram Ranade | IIT Mumbai | Precedence constrained scheduling |
| Daya Gaur | U. of Lethbridge | Berge’s Theorem for the Maximum Charge Problem |
| Subhas Chandra Nandy | ISI Kolkatta | |
| Shashank Mehta | IIT Kanpur | |
| V. Valli Kumari | S.R.K.R College | |
| S. Sivaramakrishnan | IIT Mumbai | Complete partition of graphs |
| Rohit Khandekar | U. Waterloo | Sparsest cuts using single commodity flows |