Algorithms and Discrete Applied Mathematics: 5th International Conference, CALDAM 2019, Kharagpur, India, February 14-16, 2019, Proceedings

Description

This book constitutes the proceedings of the 5th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2019, held in Kharagpur, India, in February 2019. The 22 papers presented together with 3 invited papers in this volume were carefully reviewed and selected from 86 submissions. The conference had papers in the areas of algorithms, graph theory, combinatorics, computational geometry, discrete geometry, and computational complexity. Front Matter ....Pages I-XX New Directions in Approximate Nearest-Neighbor Searching (David M. Mount)....Pages 1-15 The Induced Star Partition of Graphs (M. A. Shalu, S. Vijayakumar, T. P. Sandhya)....Pages 16-28 Fault-Tolerant Additive Weighted Geometric Spanners (Sukanya Bhattacharjee, R. Inkulu)....Pages 29-41 Maintaining the Visibility Graph of a Dynamic Simple Polygon (Tameem Choudhury, R. Inkulu)....Pages 42-52 On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements (Deepanjan Kesh, Vidya Sagar Sharma)....Pages 53-64 On m-Bonacci-Sum Graphs (Kalpana Mahalingam, Helda Princy Rajendran)....Pages 65-76 Linear Time Algorithm to Check the Singularity of Block Graphs (Ranveer Singh, Naomi Shaked-Monderer, Avi Berman)....Pages 77-90 b-Coloring of the Mycielskian of Regular Graphs (S. Francis Raj, M. Gokulnath)....Pages 91-96 Drawing Bipartite Graphs in Two Layers with Specified Crossings (Ajit A. Diwan, Bodhayan Roy, Subir Kumar Ghosh)....Pages 97-108 Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms (Gill Barequet, Gil Ben-Shachar)....Pages 109-123 On Rectangle Intersection Graphs with Stab Number at Most Two (Dibyayan Chakraborty, Sandip Das, Mathew C. Francis, Sagnik Sen)....Pages 124-137 Dominating Induced Matching in Some Subclasses of Bipartite Graphs (B. S. Panda, Juhi Chaudhary)....Pages 138-149 Localized Query: Color Spanning Variations (Ankush Acharyya, Anil Maheshwari, Subhas C. Nandy)....Pages 150-160 A Lower Bound for the Radio Number of Graphs (Devsi Bantva)....Pages 161-173 Improved Descriptional Complexity Results on Generalized Forbidding Grammars (Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele, Indhumathi Raman)....Pages 174-188 On Selecting Leaves with Disjoint Neighborhoods in Embedded Trees (Kolja Junginger, Ioannis Mantas, Evanthia Papadopoulou)....Pages 189-200 The Balanced Connected Subgraph Problem (Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit, Sasanka Roy)....Pages 201-215 Covering and Packing of Triangles Intersecting a Straight Line (Supantha Pandit)....Pages 216-230 H-Free Coloring on Graphs with Bounded Tree-Width (N. R. Aravind, Subrahmanyam Kalyanasundaram, Anjeneya Swami Kare)....Pages 231-244 The Relative Signed Clique Number of Planar Graphs is 8 (Sandip Das, Soumen Nandi, Sagnik Sen, Ritesh Seth)....Pages 245-253 Bumblebee Visitation Problem (Sandip Das, Harmender Gahlawat)....Pages 254-262 On Graphs with Minimal Eternal Vertex Cover Number (Jasine Babu, L. Sunil Chandran, Mathew Francis, Veena Prabhakaran, Deepak Rajendraprasad, J. Nandini Warrier)....Pages 263-273 On Chordal and Perfect Plane Triangulations (Sameera M. Salam, Daphna Chacko, Nandini J. Warrier, K. Murali Krishnan, K. S. Sudeep)....Pages 274-285 Back Matter ....Pages 287-287