Time

Title

Speaker

8:45 - 9:00

Welcome Address

Invited Talk 1: Chair: Sujata Ghosh

9:00-10:00

Storage and Search in Dynamic Peer-to-Peer Networks

John Augustine

Session 1: Chair: Sajin Koroth

10:05-10:30

Helly-type theorems in property testing

Rameshwar Pratap

10:30-10.55

Linear Time Algorithm for Tree t-spanner in Outerplanar

G.Ramakrishna

Graphs via Supply-Demand Partition in Trees

10:55-11.20

Channel systems, well-quasi-orders, and hard problems

Prateek Karandikar

11:20-11:45

Coffee Break

Session 2: Chair: M.S.Ramanujan

11:45-12:10

Identity testing and Multilinearity testing in Read-

Karteek Sreenivasaiah

Twice/Thrice formulas

12:10-12:35

Counting Popular Matchings in House Allocation Problems

Nitesh Jha

12:35-13:00

LP Approach to Odd Cycle Transversal in Perfect Graphs

Krithika

13:00-14:00

LUNCH

Invited Talk 2: Chair: Narayan Kumar

14:00-15:00

50 years of Krohn-Rhodes Theorems

Kamal Lodaya

15:00-15:15

Coffee Break

Session 3: Chair: Karteek Sreenivasaiah

15:15-15:40

Testing Uniformity of Stationary Distribution

Akshay Kamath

15:40-16:05

Depth Lower Bounds against Circuits with Sparse Orientation

Sajin Koroth

16:05-16:30

Tent, C²-join and {P₅; C₅}-free graphs

S Devi Yamini

16:30-17:00

Coffee Break and Snacks

Session 3: Chair: Nitesh Jha

17:00-17:25

Cuts on Skew-Symmetric Graphs and Linear Time FPT algorithm

M.S.Ramanujan

17:25-17:50

Adjacent Ordered Multi-Pushdown Systems

Prakash Saivasan

17:50-18:15

Pebbling, Entropy and Branching Program Size Lower Bounds

Balagopal Komarath