BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1448
DTSTAMP:20240726T041235Z
SUMMARY:Faul Tolerant Distance Oracles
DESCRIPTION:Speaker: Dipan Dey (IIT Gandhinagar)\n\nAbstract: \nThe shortes
 t distance and shortest paths between vertices are very important aspects 
 of Graph Theory. Graphs are often used to represent real-life networks and
  real-life networks are often prone to failures. Due to those failures\, w
 e may want to avoid some edges in the graph at some point of time. \nHenc
 e\, we may want to find the shortest distance and the shortest path betwee
 n two vertices while avoiding some edges or vertices in the graph. Fault-t
 olerant distance oracles are oracles or a set of data structures which can
  answer those kinds of queries. In my talk\, I will be discussing some of 
 our results related to fault-tolerant distance oracles.\nShort Bio: \nDipa
 n obtained a B.Sc. (Hons.) in Mathematics from Vidyasagar College (Kolkata
 ) and an M.Sc. in Mathematics from Banaras Hindu University. During his po
 stgraduate studies at Banaras Hindu University\, he developed an interest 
 in graph theory. He then joined the CSE discipline at IIT Gandhinagar to p
 ursue a PhD under Prof. Manoj Gupta's supervision. His thesis focuses on f
 ault-tolerant distance oracles\, the data structures that can determine di
 stances between vertices while avoiding some edges or vertices. In additio
 n to his thesis work\, he has also worked on linear rank width one graphs 
 and power graphs.\n \n
URL:https://www.tcs.tifr.res.in/web/events/1448
DTSTART;TZID=Asia/Kolkata:20240726T100000
DTEND;TZID=Asia/Kolkata:20240726T110000
LOCATION:A-201 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR