BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69ce98f81a6c1
DTSTART;TZID=America/Toronto:20260109T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260109T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-felipe-fidalgo-suitable-splitting-strategy
SUMMARY:Tutte Colloquium - Felipe Fidalgo- A suitable splitting strategy f
 or\nDiscretizable Distance Geometry graphs using inherent symmetries
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Felipe Fidalgo\n\nAFFILIATION:\n Universidade Federa
 l de Santa Catarina\n\nLOCATION:\n MC 5501\n\nABSTRACT:  Discretizable D
 istance Geometry Problems (DDGP) consist\nin a subclass of Distance Geomet
 ry Problems (DGP) where the search\nspace can be discretized and reduced t
 o a binary tree. Such problems\ncan be tackled by applying a Branch-and- P
 rune algorithm (BP)\, which\nis able to perform an exhaustive enumeration 
 of the solution set. \n\nIn this work\, we exploit the concept of symmetr
 y in the search tree\nfor splitting it into subtrees so that they can be e
 xplored only once\,\nfavouring and improvement on the algorithm performanc
 es.  \nWe present some computational experiments on a set of artificiall
 y\ngenerated instances\, with exact distances\, to validate the\ntheoreti
 cal results. \nJoint work with Douglas S. Gonçalves (UFSC\, Brazil)\, Car
 lile Lavor\n(UNICAMP\, Brazil)\, Leo Liberti (CNRS\, France) and Antonio M
 ucherino\n(Université de Rennes\, France).
DTSTAMP:20260402T162736Z
END:VEVENT
END:VCALENDAR