Chair: TBD

Two Heuristic Approaches for Some Special Colorings of Graphs
Iztok Peterin

Chair: TBD

Consecutive Occurrences with Distance Constraints
Waseem Akram and Sanjeev Saxena
11:15 AM - 11:40 AM

Parameterized Aspects of Distinct Kemeny Rank Aggregation
Koustav De, Harshil Mittal, Palash Dey and Neeldhara Misra
11:40 AM - 12:05 PM

Monitoring edge-geodetic sets in graphs: extremal graphs, bounds, complexity
Florent Foucaud, Pierre-Marie Marcille, Zin Mar Myint, R. B. Sandeep, Sagnik Sen and S Taruni
12:05 PM -12:30 PM

Chair:

Distance-2-Dispersion with Termination by a Strong Team
Barun Gorain, Tanvir Kaur and Kaushik Mondal
2:00 PM - 2:25 PM

On query complexity measures and their relations for symmetric functions
Sanjay S Nair, Rajat Mittal and Sunayana Patro
2:25 PM - 2:50 PM

Chair:

Location-domination type problems under the Mycielski construction
Silvia M. Bianchi, Dipayan Chakraborty, Yanina Lucarini and Annegret K. Wagler
2:50 PM - 3:15 PM

On Total Chromatic Number of Complete Multipartite Graphs
Aseem Dalal and B S Panda
3:15 PM - 3:40 PM

Chair

The Weak-Toll Function of a Graph: Axiomatic Characterizations and First-Order Non-definability
Lekshmi Kamal K S, Manoj Changat and Jeny Jacob
4:15 PM - 4:40 PM

Total Coloring of Some Graph Operations
T Kavaskar and Sreelakshmi Sukumaran
4:40 PM - 5:05 PM

Star colouring of regular graphs meets weaving and line graphs
Shalu M A and Cyriac Antony
5:05 PM - 5:30 PM

Chair: TBD

Random Deselection
Saket Saurabh

Chair: TBD

An efficient interior point method for linear optimization using modified Newton method
Sajad Fathi Hafshejani, Daya Gaur and Robert Benkoczi
11:15 AM - 11:40 AM

Unique Least Common Ancestors and Clusters in Directed Acyclic Graphs
Ameera Vaheeda Shanavas, Manoj Changat, Marc Hellmuth and Peter F Stadler
11:40 AM - 12:05 PM

The Frobenius Problem for the Proth Numbers
Pranjal Srivastava and Dhara Thakkar
12:05 PM -12:30 PM

Chair:

Growth Rate of the Number of Empty Triangles in the Plane
Bhaswar B. Bhattacharya, Sandip Das, Sk Samim Islam and Saumya Sen
2:00 PM - 2:25 PM

Geometric Covering Number: Covering Points with Curves
Arijit Bishnu, Pritam Majumder and Mathew Francis
2:25 PM - 2:50 PM

Improved Algorithms for Minimum-Membership Geometric Set Cover
Sathish Govindarajan and Siddhartha Sarkar
2:50 PM -3:15 PM

Semi-total Domination in Unit Disk Graphs
Sasmita Rout and Gautam Kumar Das
3:15 PM - 3:40 PM

Chair: TBD

Total Coloring Conjecture and Classification Problem
B. S. Panda

Chair:

Eternal Connected Vertex Cover Problem in Graphs: Complexity and Algorithms
Kaustav Paul and Arti Pandey
9:30 AM - 9:55 AM

Impact of Diameter and Convex Ordering for Hamiltonicity and Domination
Mahendra Kumar R and Sadagopan Narasimhan
9:55 AM - 10:20 AM

On Star Partition of Split Graphs
Vijayakumar S and Divya D
10:20 AM - 10:45 AM

Chair:

Star Covers and Star Partitions of Cographs and Butterfly-free Graphs
Vijayakumar S and Joyashree Mondal
11:15 AM - 11:40 AM

Open Packing in H-free Graphs and Subclasses of Split Graphs
M A Shalu and V K Kirubakaran
11:40 AM - 12:05 PM