BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1332
DTSTAMP:20230914T125959Z
SUMMARY:A Parameterized View on P-matchings
DESCRIPTION:Speaker: Juhi Chaudhary (Ben-Gurion University of the Negev\, I
srael)\n\nAbstract: \nA matching M is a P-matching if the subgraph induced
by the endpoints of the edges of M satisfies property P. For example\, if
the property P is that of being a graph\, being a matching\, being acycli
c\, or being disconnected\, then we obtain the usual matching\, an induced
matching\, an acyclic matching\, and a disconnected matching\, respective
ly. First\, I will survey the latest developments related to P-matchings f
rom the viewpoint of Parameterized Complexity. Then\, I will describe some
results focusing majorly on acyclic matchings and on three algorithmic pa
radigms: approximation hardness\, kernelization lower bounds\, and FPT alg
orithms with respect to various parameters such as treewidth and some belo
w-guarantee parameters. The second part of the talk is based on the two re
cent joint works with Meirav Zehavi\, which appeared in WG’2023.\n \n
URL:https://www.tcs.tifr.res.in/web/events/1332
DTSTART;TZID=Asia/Kolkata:20230912T160000
DTEND;TZID=Asia/Kolkata:20230912T170000
LOCATION:via Zoom in A201
END:VEVENT
END:VCALENDAR