7:30 - 9:30 pm

  Welcome Dinner

    9:00 - 9:30 am

  Inaugural Session

    9:30 - 10:45 am

  Google Invited Talk I

  Chair : Rahul Muthu


  Stable Approximation Schemes

  Mark de Berg

   10:45 - 11:05 am

  Break

   11:05 - 12:45 pm

  Algorithms and Optimization

  Chair : C.R. Subramanian


  Optimal length cutting plane refutations of integer programs

  K. Subramani and Piotr Wojciechowski

  11:05 - 11:30 am


  Resource management in device-to-device communications

  Leila Karimi, Vijay Adoni and Daya Gaur

  11:30 - 11:55 am


  Fault-Tolerant Dispersion of Mobile Robots

  Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla and Sumathi Sivasubramaniam

  11:55 - 12:20 pm


  Efficient reductions and algorithms for Subset Product

  Pranjal Dutta and Mahesh Rajasree

  12:20 - 12:45 pm

   12:45 - 1:45 pm

  Lunch Break

   1:45 - 3:50 pm

  Graph Covering and Partition

  Chair : Niranjan Balachandran


  Structural Parameterization of Alliance Problems

  Balchandar Reddy Sangam and Anjeneya Swami Kare

  1:45 - 2:10 pm


  Graph Covering using Bounded Size Subgraphs

  Barun Gorain, Shaswati Patra and Rishi Ranjan Singh

  2:10 - 2:35 pm


  Axiomatic characterization of the the toll walk function of some graph classes

  Lekshmi Kamal K S, Manoj Changat and Iztok Peterin

  2:35 - 3:00 pm


  Maximum subgraph problem for 3-regular Knödel graphs and its wirelength

  R. Sundara Rajan, Remi Mariam Reji and T. M. Rajalaxmi

  3:00 - 3:25 pm


  Transitivity on subclasses of chordal graphs

  Subhabrata Paul and Kamal Santra

  3:25 - 3:50 pm

   3:50 - 4:10 pm

  Break

   4:10 - 5:50 pm

  Graph Connectivity

  Chair : Manoj Changat


  Short cycles dictate dichotomy status of the Steiner tree problem on Bisplit graphs

  A Mohanapriya, P Renjith and N Sadagopan

  4:10 - 4:35 pm


  Cyclability, Connectivity and Circumference

  Anish Hebbar and Niranjan Balachandran

  4:35 - 5:00 pm


  Monitoring edge-geodetic sets in graphs

  Florent Foucaud, Krishna Narayanan and Lekshmi R S

  5:00 - 5:25 pm


  Some insights on dynamic maintenance of Gomory-Hu tree in cactus graphs and general graphs

  Vineet Malik and Sushanta Karmakar

  5:25 - 5:50 pm

   5:50 - 6:30 pm

  CALDAM Business Meeting

  ACSDM Business Meeting

  Chair: Subir Kumar Ghosh

    9:00 - 10:15 am

  Google Invited Talk II

  Chair : Sunitha VadivelMurugan


  Graph Modification Problems with Forbidden Minors

  Ignasi Sau

   10:15 - 10:35 am

  Break

   10:35 - 12:40 pm

  Graph Matching and Computational Geometry

  Chair : Sandip Das


  Latin Hexahedra and Related Combinatorial Structures

  Akihiro Yamamura

  10:35 - 11:0 am


  Algorithm and Complexity of Strongly Stable Non-crossing Matchings

  B.S. Panda and Sachin

  11:00 - 11:25 am


  Minimum Maximal Acyclic Matching in Proper Interval Graphs

  Juhi Chaudhary, Sounaka Mishra and Bhawani Panda

  11:25 - 11:50 am


  Arbitrary oriented color spanning region for line segments

  Sukanya Maji and Sanjib Sadhu

  11:50 - 12:15 pm


  Algorithms for k-Dispersion for Points in Convex Position in the Plane

  Vishwanath Reddy Singireddy, Manjanna Basappa and Joseph S. B. Mitchell

  12:15 - 12:40 pm

   12:40 - 1:45 pm

  Lunch

   1:45 - 3:25 pm

  Graph Colouring I

  Chair : Florent Foucaud


  Coloring of a superclass of 2K2-free graphs

  Athmakoori Prashant and Francis Raj S

  1:45 - 2:10 pm


  5-list coloring toroidal 6-regular triangulations in linear time

  Brahadeesh Sankarnarayanan and Niranjan Balachandran

  2:10 - 2:35 pm


  New bounds and constructions for neighbor-locating colorings of graphs

  Dipayan Chakraborty, Florent Foucaud, Soumen Nandi, Sagnik Sen and Supraja D K

  2:35 - 3:00 pm


  On Structural Parameterizations of Star Coloring

  Sriram Bhyravarapu and Vinod Reddy

  3:00 - 3:25 pm

   3:25 - 3:45 pm

  Break

   3:45 - 5:25 pm

  Graph Colouring II

  Chair : Rishi Ranjan Singh


  The Weak (2,2)-Labelling Problem for graphs with forbidden induced structures

  Julien Bensmail, Hervé Hocquard and Pierre-Marie Marcille

  3:45 - 4:10 pm


  Perfectness of G-generalized join of graphs

  Kavaskar T

  4:10 - 4:35 pm


  On Coupon Coloring of Cayley Graphs

  Pavithra R and Reji T

  4:35 - 5:00 pm


  On Locally Identifying Coloring of Graphs

  Sriram Bhyravarapu, Swati Kumari and Vinod Reddy

  5:00 - 5:25 pm

   5:25 - 5:45 pm

  Break

   5:45 - 6:35 pm

  Game Theory

  Chair : Neeldhara Misra


  Rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane

  Arun Kumar Das, Sandip Das, Anil Maheshwari and Sarvottamananda Swami

  5:45 - 6:10 pm


  Diverse Fair Allocations: Complexity and Algorithms

  Harshil Mittal, Saraswati Nanoti and Aditi Sethi

  6:10 - 6:35 pm

   7:30 - 9:30 pm

  Banquet Dinner

   9:00 - 10:15 am

  Graph Domination I

  Chair : Anil Maheshwari


  On three domination-based identification problems in block graphs

  Dipayan Chakraborty, Florent Foucaud, Aline Parreau and Annegret Wagler

  9:00 - 9:25 am


  Computational Aspects of Double Dominating Sequences in Graphs

  Gopika Sharma and Arti Pandey

  9:25 - 9:50 am


  Pushing Cops and Robber on Oriented Graphs

  Sandip Das, Harmender Gahlawat, Ashwin Ramgopal, Uma Kant Sahoo and Sagnik Sen

  9:50 - 10:15 am

   10:15 - 10:35 am

  Break

   10:35 - 11:50 am

  Graph Domination II

  Chair : Anil Maheshwari


  Complexity Results on Cosecure Domination in Graphs

  Kusum and Arti Pandey

  10:35 - 11:00 am


  Mind the Gap: Edge Facility Location Problems in Theory and Practice

  Moritz Beck, Joachim Spoerhase and Sabine Storandt

  11:00 - 11:25 am


  Relation between broadcast domination and multipacking numbers on chordal graphs

  Sandip Das, Florent Foucaud, Sk Samim Islam and Joydeep Mukherjee

  11:25 - 11:50 am

   11:50 - 12:15 pm

  Conclusion

   12:15 pm

  Lunch