BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Miloš Stojakovic (University of Novi Sad)
DTSTART:20210624T141500Z
DTEND:20210624T160000Z
DTSTAMP:20260422T065846Z
UID:CJCS/19
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CJCS/19/">De
 aling with bichromatic non-crossing matchings</a>\nby Miloš Stojakovic (U
 niversity of Novi Sad) as part of Copenhagen-Jerusalem Combinatorics Semin
 ar\n\n\nAbstract\nGiven a set of n red and n blue points in the plane\, we
  are interested in matching red points with blue points by straight line s
 egments so that the segments do not cross. We develop a range of tools for
  dealing with the non-crossing matchings of points in convex position. It 
 turns out that the points naturally partition into groups that we refer to
  as orbits\, with a number of properties that prove useful for studying an
 d efficiently processing the non-crossing matchings.\n\n\nBottleneck match
 ing is such a matching that minimizes the length of the longest segment. I
 llustrating the use of the developed tools\, we show how to solve the prob
 lem of finding bottleneck matchings of points in convex position faster th
 an before.\n\nJoint work with Marko Savić.\n
LOCATION:https://researchseminars.org/talk/CJCS/19/
END:VEVENT
END:VCALENDAR