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