ACCEPTED PAPERS

CALDAM 2019 Accepted Papers

CALDAM 2019 Accepted Papers

Shalu M A, Vijayakumar S and Sandhya T P. The Induced Star Partition of Graphs
Sukanya Bhattacharjee and R Inkulu. Fault-Tolerant Additive Weighted Geometric Spanners
Tameem Choudhury and R Inkulu. Maintaining the visibility graph of a dynamic simple polygon
Deepanjan Kesh and Vidya Sagar Sharma. On the Bitprobe Complexity of Two Probe Adaptive Schemes Storing Two Elements
Kalpana Mahalingam and Helda Princy Rajendran. On m-bonacci-sum graphs
Ranveer Singh, Naomi Shaked-Monderer and Avi Berman. Linear time algorithm to check the singularity of block graphs
Francis Raj S and Gokulnath M. b-coloring of the Mycielskian of regular graphs
Ajit Diwan, Bodhayan Roy and Subir Ghosh. Two-layer drawings of bipartite graphs
Gill Barequet and Gil Ben-Shachar. Minimal-Perimeter Polyominoes: Chains, Roots, and Algorithms
Dibyayan Chakraborty, Sandip Das, Mathew Francis and Sagnik Sen. On rectangle intersection graphs with stab number at most two
B S Panda and Juhi Choudhary. Dominating Induced Matching in Some Subclasses of Bipartite Graphs
Ankush Acharyya, Anil Maheshwari and Subhas C. Nandy. Localized query: Color spanning variations
Devsi Bantva. A lower bound for the radio number of graphs
Henning Fernau, Lakshmanan Kuppusamy, Rufus O. Oladele and Indhumathi R. Improved Descriptional Complexity Results on Generalized Forbidding Grammars
Kolja Junginger, Ioannis Mantas and Evanthia Papadopoulou. On selecting leaves with disjoint neighborhoods in embedded trees
Sujoy Bhore, Sourav Chakraborty, Satyabrata Jana, Joseph S. B. Mitchell, Supantha Pandit and Sasanka Roy. The Balanced Connected Subgraph Problem
Supantha Pandit. Covering and Packing of Triangles Intersecting a Straight Line
N. R. Aravind, Subrahmanyam Kalyanasundaram and Anjeneya Swami Kare. H-Free Coloring on Graphs with Bounded Tree-Width
Soumen Nandi, Sandip Das, Sagnik Sen and Ritesh Seth. The relative signed clique number of planar graphs is 8
Sandip Das and Harmender Gahlawat. Bumblebee Visitation Problem
Jasine Babu, L. Sunil Chandran, Mathew Francis, Veena Prabhakaran, Deepak Rajendraprasad and J. Nandini Warrier. On Graphs with Minimal Eternal Vertex Cover Number
Sameera M Salam, Daphna Chacko, Nandini J Warrier, Murali Krishnan and Sudeep K S. On chordal and perfect plane triangulations