Chennai Theory Day - 2016



The list of accepted abstracts is available here: THE LIST

The program is given below.

Schedule: Chennai Theory Day, Thusday 28th April 2016

Time

Title

Speaker

 

 

 

 

Session 1 (Chair: Saket Saurabh)

 

9:30-10:00

Complete and Intermediate polynomials in Algebraic Complexity Theory

Nitin Saurabh

10:00-10.30

Sums of read-once formulas: How many summands suffice?

Anuj Tawari

10:30-11.00

Noncommutative Valiant's Classes: Structure and Complete Problems

S. Raja

 

 

 

11:00-11:30

Coffee Break

 

 

 

 

 

Session 2 (Chair: Sounaka Mishra)

 

11:30-12.00

Harmonious Coloring

Prafullakumar P Tale

12:00-12.30

On Minimum Average Stretch Spanning Trees in Grid Graphs

Pankaj Pundir

12:30-13.00

Tree reconstruction using separator queries

Jagadish M.

 

 

 

13:00-14:00

LUNCH

 

 

 

 

 

Session 3: Invited Talk 1 (Chair: M. Praveen)

 

14:00-15:00

Parameterized Reachability in Networks with Many Identical Processes

Arnaud Sangnier

 

 

 

15:00-15:30

Coffee Break

 

 

 

 

 

Session 4 (Chair: Sujata Ghosh)

 

15:30-16:00

Factorisations over Orbit-finite Nominal Monoids

Amaldev Manuel

16:00-16:30

Limited Set Quantifiers over Countable Linear Orderings

Sreejith A V

 

 

 

16:30-17:00

Coffee Break

 

 

 

 

 

Session 5 (Chair: Sourav Chakraborty)

 

17:00-17:30

Balanced Allocation: Patience is not a Virtue

William Moses Jr.

 

 

 

19:00-21:00

Banquet

 





Schedule: Chennai Theory Day, Friday 29th April 2016

Time

Title

Speaker

 

 

 

 

Session 6 (Chair: Geevarghese Philip)

 

9:30-10:00

Subexponential algorithms for Rectilinear Steiner tree and arborescence

S. Kolay

10:00-10.30

Polynomial kernel for Vertex Cover parameterized by small degree modulators

Diptapriyo Majumdar

10:30-11.00

Parameterized Complexity of Red Blue Set Cover for lines

Pradeesha Ashok

 

 

 

11:00-11:30

Coffee Break

 

 

 

 

 

Session 7 (Chair: Meena Mahajan)

 

11:30-12.00

On the Limitations of Color-Refinement and Linear-Programming Approaches to Graph Isomorphism

Gaurav Rattan

12:00-12.30

Characterization and Lower Bounds for Branching Program Size using Projective Dimension

Krishnamoorthy Dinesh

12:30-13.00

Limitations of sum of products of Read-Once Polynomials

Ramya Chandrasekar

 

 

 

13:00-14:00

LUNCH

 

 

 

 

 

Session 8: Invited Talk 2 (Chair: B Srivathsan)

 

14:00-15:00

Colouring oriented graphs

Sagnik Sen

 

 

 

15:00-15:30

Coffee Break

 

 

 

 

 

Session 9 (Chair: K.V. Subrahmanyam)

 

15:30-16:00

Learning Rotations from Images

Muthuvel Murugan

16:00-16:30

Fast Gaussian Process Regression for Big Data

Rajiv Sambasivan

 

 

 

16:30-17:00

Snacks

 

1