Pritam Bhattacharya

Conference / Workshop Talks

• Constant Approximation Algorithms for Guarding Simple Polygons using Vertex Guards [slides]
  Event: Eighth IDRBT Doctoral Colloquium (Won 3rd prize)
  Venue: Institute for Development and Research in Banking Technology(IDRBT), Hyderabad
  Date: December 7, 2018
• Constant Approximation Algorithms for Guarding Simple Polygons using Edge Guards [slides]
  Event: Young Researchers' Forum (YRF), SoCG 2018
  Venue: Gólyavár main lecture hall, Eötvös Loránd University (ELTE), Múzeum körút 6-8, Budapest, Hungary
  Date: June 12, 2018
• Approximation and Inapproximability of Guarding Polygons [abstract] [slides]
  Event: Workshop on 'Fine-Grained Complexity of Hard Geometric Problems', SoCG 2018
  Venue: Room 172, Building B, Eötvös Loránd University (ELTE), Múzeum körút 6-8, Budapest, Hungary
  Date: June 11, 2018
• Approximation and Inapproximability of Guarding Polygons [abstract] [slides]
  Event: Intensive Research Program in Discrete, Combinatorial and Computational Geometry (IRP-DCCG)
  Venue: Centre de Recerca Matemàtica (CRM), Edifici C, Universitat Autònoma de Barcelona (UAB), Barcelona, Spain
  Date: April 18, 2018
• Vertex Guarding in Weak Visibility Polygons [slides]
  Event: CALDAM 2015 (Won Springer award for best student presentation)
  Venue: Outreach Auditorium, IIT Kanpur
  Date: February 8, 2015

Invited Research Talks

• Approximation and Inapproximability of Guarding Polygons [abstract] [video]
  Host: Mr. Bikash Chandra
  Venue: Conference Room, 1st Floor, C Block, CSE Department, Kanwal Rekhi (KReSIT) Building, IIT Bombay
  Date: June 21, 2018
• Approximation and Inapproximability of Guarding Polygons [abstract] [slides]
  Host: Prof. Jaikumar Radhakrishnan
  Venue: Room A-201 (STCS Seminar Room), Tata Institute of Fundamental Research (TIFR), Mumbai
  Date: June 20, 2018
• Approximation and Inapproximability of Guarding Polygons [slides]
  Host: Prof. Günter Rote
  Venue: Seminarraum 006, Institut für Informatik, Freie Universität Berlin, Berlin, Germany
  Date: June 8, 2018
• Approximation and Inapproximability of Guarding Polygons [slides]
  Host: Prof. Rolf Klein
  Venue: Room 2.078 (Seminarraum der Informatik I), Campus Poppelsdorf, Bonn University, Bonn, Germany
  Date: June 4, 2018
• Approximability of Guarding Weak Visibility Polygons [abstract] [slides]
  Host: Prof. Alexander Wolff
  Venue: Room E-39, Institute of Computer Science, Wurzburg University, Wurzburg, Germany
  Date: March 28, 2017
• Approximability of Guarding Weak Visibility Polygons [abstract] [slides]
  Host: Prof. Ulrich Meyer
  Venue: Magnus Lecture Hall, Institute of Computer Science, Goethe University, Frankfurt am Main, Germany
  Date: March 27, 2017
• The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm [slides]
  Host: Dr. Arindam Pal
  Venue: TCS Innovation Labs, Newtown, Kolkata
  Date: June 29, 2016

Public Outreach Talks

• Cheating Husbands Puzzles - A Study of the Interplay between Knowledge, Action and Communication [slides]
  Venue: University of Engineering and Management (UEM), Jaipur [poster]
  Date: October 22, 2018
• Cheating Husbands Puzzles - A Study of the Interplay between Knowledge, Action and Communication [slides]
  Venue: University of Engineering and Management (UEM), New Town, Kolkata
  Date: April 3, 2017
• Cheating Husbands and Other Puzzles - The Power of 'Common Knowledge' [slides]
  Venue: St. Xavier's College, Mumbai
  Date: June 20, 2016
• Cheating Husbands Puzzles - A Study of the Interplay between Knowledge, Action and Communication [slides]
  Venue: OP Jindal University, Raigarh
  Date: April 26-27, 2016
• Cheating Husbands Puzzles - A Study of the Interplay between Knowledge, Action and Communication [slides]
  Venue: Science Auditorium, Institute of Engineering and Management, Salt Lake, Kolkata
  Date: April 9, 2016
• Teasing your Brain to Think Critically - The Art and Science of Solving Logical Puzzles [slides] [YouTube video]
  Event: Chai & Why?
  Venue: Prithvi Theatre, Juhu, Mumbai
  Date: December 1, 2013
• Teasing your Brain to Think Critically - The Art and Science of Solving Logical Puzzles [slides]
  Event: Frontiers of Science 2013
  Venue: Homi Bhabha Auditorium, TIFR, Mumbai
  Date: November 24, 2013

STCS Student Seminars @ TIFR

• The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm [abstract]
  Date: June 17, 2016
• Polygon Guarding with Orientation [abstract]
  Date: June 12, 2015
• Art Gallery Problems for Visibility with Reflection [abstract]
  Date: May 29, 2015
• Hardness of Vertex Guarding Polygons With Holes [abstract]
  Date: September 26, 2014
• Algorithms for Computing Diffuse Reflection Paths in Polygons [abstract]
  Date: June 6, 2014
• Cheating Husbands - A Study of the Interplay Between Knowledge, Action, and Communication [abstract]
  Date: November 15, 2013
• Approximation Algorithms for the Partition Vertex Cover Problem [abstract]
  Date: March 1, 2013
• Quadratic Dynamical Systems [abstract]
  Date: September 28, 2012
• Size-energy Tradeoffs for Unate Circuits Computing Symmetric Boolean Functions [abstract]
  Date: September 7, 2012
• Geometric Searching [abstract]
  Date: April 20, 2012
• Lookup Tables, Suffix Trees and Suffix Arrays [abstract]
  Date: October 24, 2011
• Art Gallery Problem [abstract]
  Date: May 24, 2011