BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20200329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260406T041114Z
UID:5d9706f7da237325219732@ist.ac.at
DTSTART:20191115T100000
DTEND:20191115T110000
DESCRIPTION:Speaker: Hiroshi Hirai\nhosted by Vladimir Kolmogorov\nAbstract
 : A CAT(0) space is a geodesic metric space having globally non positive c
 urvature.In this talk\, I will discuss combinatorial and algorithmic aspec
 ts ofCAT(0) spaces associated withcombinatorial objects (graphs\, posets\,
  etc)\, from applied mathematics points of view.Topics include: (1) The sp
 ace of phylogenetic trees (Billera\, Holmes\, Vogtmann 2001)\, and Owen-Pr
 ovan algorithm (Owen\, Provan 2011)  computing the geodesic between two ph
 ylogenetic trees\, via parametric network flow. (2) Orthoscheme complexes 
 associated with posets (Brady-McCammond 2010)\, classes of lattices/semila
 ttices having CAT(0) orthoscheme complexes\, and their application to sub-
 modular optimization.
LOCATION:Mondi Seminar Room 3\, Central Building\, ISTA
ORGANIZER:kharppre@ist.ac.at
SUMMARY:Hiroshi Hirai: Combinatorial and algorithmic aspects of CAT(0) comp
 lexes
URL:https://talks-calendar.ista.ac.at/events/2352
END:VEVENT
END:VCALENDAR