BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.17.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Ashoka University
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250317T120000
DTEND;TZID=Asia/Kolkata:20250317T133000
DTSTAMP:20250310T064734Z
CREATED:20250310T064734Z
LAST-MODIFIED:20250310T064734Z
UID:74757-1742212800-1742218200@www.ashoka.edu.in
SUMMARY:CS Seminar: Matching and Edge Coloring in Evolving Graphs
DESCRIPTION:Abstract: Today’s graph networks are complex\, large and evolving. This necessitates the discovery of new graph algorithms and techniques which can be adapted to modern graphs. I will talk about my research\, which is primarily concerned with designing algorithms for networks which are undergoing changes. I will focus on two problems: graph matching and edge coloring. Numerous practical applications have motivated the study of these classical graph problems in evolving graphs.  \nThe problem of computing matchings on unweighted graphs in new models has received much attention. A natural generalization of this problem is the weighted setting\, where edges have weights or cost functions. Unfortunately\, there is a gap between the state-of-the-art for these two problems. In the first part of the talk\, I will present a versatile framework which reduces the weighted setting to the unweighted setting.  \nIn the second part of the talk\, I will present my work on edge coloring\, where my focus has been on analyzing a particular natural and simple algorithm that is conjectured to be optimal.  \nAbout the Speaker: I am a postdoc in the Big Data Algorithms Group at the University of Salzburg. Before this\, I was a PhD student in the Computer Science Department of Rutgers University. My research interests are in graph algorithms. \nWe look forward your active participation.
URL:https://www.ashoka.edu.in/event/cs-seminar-matching-and-edge-coloring-in-evolving-graphs/
END:VEVENT
END:VCALENDAR