Conference on Algorithms and Discrete Applied Mathematics
Indian Institute of Technology, Kanpur
February 8-10, 2015
| Time | Day 0 |
|---|---|
| 20 hr. | Welcome Dinner VH Dining Hall |
| Time | Day 1 |
|---|---|
| 8.45 hr. - 9.30hr. | Registration and Inauguration |
| Session I | Invited Talk-I Chair: Sumit Ganguly |
| 9.30 hr. - 10.45 hr. |
C. R. Subramanian, IMSc. Chennai. Probabilistic Arguments in Graph Coloring |
| 10.45 hr. - 11.15 hr. | Tea Outreach Building Lawns |
| Session II | Computational Geometry Chair: Partha P. Goswami |
| 11.15 hr. - 11.40 hr. |
Md. Shafiul Alam and Asish Mukhopadhyay Three paths to point placement |
| 11.40 hr. - 12.05 hr. |
Pritam Bhattacharya, Subir Kumar Ghosh and Bodhayan Roy Vertex Guarding in Weak Visibility Polygons |
| 12.05 hr. - 12.30 hr. |
Adrian Dumitrescu, Anirban Ghosh and Masud Hasan On Collections of Polygons Cuttable with a Segment Saw |
| 12.30 hr. - 12.55 hr. |
Binay Bhattacharya, Minati De, Anil Maheshwari, Subhas Nandy and Sasanka Roy Rectilinear path problems in the presences of rectangular obstacles |
| 12.55 hr. - 14.00 hr. | Lunch VH Dining Hall |
| Session III | Graph Theory I Chair: Manoj Changat |
| 14.00 hr. - 14.25 hr. |
Karthick T. New Polynomial Case for Efficient Domination in P6-free Graphs |
| 14.25 hr. - 14.50 hr. |
Ahmad Biniaz, Anil Maheshwari and Michiel Smid Higher-Order Triangular-Distance Delaunay Graphs. Graph-Theoretical Properties |
| 14.50 hr. - 15.15 hr. |
B S Panda Separator Theorems for Interval Graphs and Proper Interval Graphs |
| 15.15 hr. - 15.50 hr. | Tea Outreach Building Lawns |
| Session IV | Algorithms and Complexity Chair: N.S. Narayanaswamy |
| 15.45 hr. - 16.10 hr. |
Ankit Chauhan and Raghavendra Rao B V. Parameterized Analogues of Probabilistic Computation |
| 16.10 hr. - 16.35 hr. |
Mark Korenblit Algebraic Expressions of Rhomboidal Graphs |
| 16.35 hr. - 17.00 hr. |
Sigve Hortemo Sther Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter |
| 17.00 hr. | Business Meeting Chair: Subir Ghosh |
| 19.30 hr. | Dinner VH Dining Hall |
| Time | Day 2 |
|---|---|
| Session V | Invited Talk-II Chair: Ramesh Krishnamurti |
| 9.30 hr. - 10.45 hr. |
Pavol Hell Obstruction Characterizations in Graphs and Digraphs |
| 10.45 hr. - 11.15 hr. | Tea Outreach Building Lawns |
| Session VI | Graph Theory II Chair: Bhawani S. Panda |
| 11.15 hr. - 11.40 hr. |
Francis P and Francis Raj S. Bounds for the b-chromatic number of induced subgraphs and G-e |
| 11.40 hr. - 12.05 hr. |
Ashok Kumar Das and Ritapa Chakraborty New Characterizations Of Proper Interval Bigraphs and Proper Circular Arc Bigraphs |
| 12.05 hr. - 12.30 hr. |
Rohan Sharma, Bibhas Adhikari and Abhishek Mishra On Spectra of Corona Graphs |
| 12.30 hr. - 12.55 hr. |
Manoj Changat, Divya Sindhu Lekha, Henry Martyn Mulder and Ajitha R. Subhamathi Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs |
| 12.55 hr. - 14.00 hr. | Lunch VH Dining Hall |
| Session VII | Algorithms I Chair: Anil Maheshwari |
| 14.00 hr. - 14.25 hr. |
Olivier Bodini, Antoine Genitrini, Frederic Peschanski and Nicolas Rolin Associativity for Binary Parallel Processes. a Quantitative Study |
| 14.25 hr. - 14.50 hr. |
Paul Manuel, Indra Rajasingh, Sundara Rajan R, Parthiban N and Rajalaxmi T.M. A Tight Bound for Congestion of an Embedding |
| 14.50 hr. - 15.15 hr. |
S. Mindi Yuan, Wei Shen, Jun Li, Yannis Pavlidis and Shen Li Auction/Belief propagation algorithms for constrained assignment problem |
| 15.15 hr. - 15.50 hr. | Tea Outreach Building Lawns |
| Session VIII | Approximation and Randomized Algorithms Chair: Sandip Das |
| 15.45 hr. - 16.10 hr. |
Santiago Ravelo and Carlos Ferreira A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem |
| 16.10 hr. - 16.35 hr. |
Puspal Bhabak and Hovhannes Harutyunyan Constant Approximation for Broadcasting in k-cycle Graph |
| 16.35 hr. - 17.00 hr. |
Apurba Sarkar, Arindam Biswas, Mousumi Dutt and Arnab Bhattacharya Generation of Random Digital Curves using Combinatorial Techniques |
| 19.30 hr. | Banquet Dinner Outreach Building Lawns |
| Time | Day 3 |
|---|---|
| Session IX | Graph Theory III Chair: Daya Gaur |
| 9.30 hr. - 9.55 hr. |
N.S. Narayanaswamy and Anju Srinivasan Tree Path Labeling of Hypergraphs A Generalization of the Consecutive Ones Property |
| 9.55 hr. - 10.20 hr. |
Sujoy Kumar Bhore, Dibyayan Chakraborty, Sandip Das and Sagnik Sen On a special class of boxicity 2 graphs |
| 10.20 hr. - 10.45 hr. |
Arti Pandey and B.S. Panda Domination in some subclasses of bipartite graphs |
| 10.45 hr. - 11.15 hr. | Tea Outreach Building Lawns |
| Session X | Algorithms II Chair: Surender Baswana |
| 11.15 hr. - 11.40 hr. |
Arun K Pujari, Venkateswara Rao Kagita, Anubhuthi Garg and Vineet Padmanabhan Bi-directional Search for Skyline Probability |
| 11.40 hr. - 12.05 hr. |
Daya Ram Gaur and Rishi Ranjan Singh Cumulative vehicle routing problem. a column generation approach |
| 12.05 hr. - 12.30 hr. |
Barun Gorain and Partha Sarathi Mandal Energy Efficient Sweep Coverage with Mobile and Static Sensors |
| 12.30 hr. - 14.00 hr. | Closing session followed by Lunch VH Dining Hall |
+91 (512) 259-7638