Exact Algorithms for Some Graph Coloring and Covering Problems Master's Thesis Seminar Speaker: Siddharth Bhandari, TIFR Organisers: Vinod M. PrabhakaranTime: Tuesday, 13 June 2017, 11:00 to 12:00 Venue: A-201 (STCS Seminar Room) Inclusion-Exclusion based methods will be presented for solving exactly some graph coloring and covering problems. Read more about Exact Algorithms for Some Graph Coloring and Covering Problems
Studying Lower Bounds for Conflict-free Colouring of Guards in Polygons Master's Thesis Seminar Speaker: Suneel Sarswat, TIFR Time: Thursday, 19 February 2015, 16:00 to 17:00 Venue: AG-80 Abstract: Art gallery problem is to determine the number of guards that are sufficient to see or cover all points in $P$. Read more about Studying Lower Bounds for Conflict-free Colouring of Guards in Polygons
