BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://aarms.math.ca
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:UTC
BEGIN:STANDARD
TZOFFSETFROM:+0000
TZOFFSETTO:+0000
TZNAME:UTC
DTSTART:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;VALUE=DATE:20221118
DTEND;VALUE=DATE:20221119
DTSTAMP:20260612T210953
CREATED:20221008T120408Z
LAST-MODIFIED:20221008T120408Z
UID:6902-1668729600-1668815999@aarms.math.ca
SUMMARY:University of New Brunswick Data Challenge 2022
DESCRIPTION:The Data Challenge will bring together three competitive events\, Data Visualization (7th Annual)\, Data Analytics (3rd Annual)\, and Data Sprint (3rd Annual) on Nov. 18\, 2022\, in a hybrid format – virtually and in person! Take up the challenge and demonstrate the power of data\, with the flexibility to take part remotely.\nParticipants and teams will have the chance to showcase their ability to tell a story driven by data in three unique competitive formats. Teams can participate in all three competitive events. It is an ideal setting for citizens to get engaged\, meet leaders in academia\, government\, and private organizations\, and explore the world of data science.
URL:https://aarms.math.ca/event/university-of-new-brunswick-data-challenge-2022/
LOCATION:University of New Brunswick (Fredericton Campus)\, Fredericton\, New Brunswick\, Canada
CATEGORIES:AARMS sponsored events
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=UTC:20221130T153000
DTEND;TZID=UTC:20221130T163000
DTSTAMP:20260612T210953
CREATED:20221124T144803Z
LAST-MODIFIED:20230106T112807Z
UID:6970-1669822200-1669825800@aarms.math.ca
SUMMARY:Atlantic Graph Theory Seminar: Sebastian Cioaba\, University of Delaware
DESCRIPTION:Addressing graphs and hypergraphs \nIn 1970s\, Ron Graham and Henry Pollak introduced the notion of graph addressing which is a labeling of the vertices of an undirected graph by words of the same length over the alphabet {0\,1\,*} such that the distance between any two vertices equals the number of positions in their labels/addresses where one vertex has a 0 and the other one has a 1. The minimum of length of such words has been investigated by various people and is closely related to the partition of the edge set of the graph into bicliques (complete bipartite subgraphs). In this talk\, I will describe some recent results related to this parameter for various families of graphs and the corresponding problem for hypergraphs. \nZoom info:\n\nhttps://us02web.zoom.us/j/87564743456?pwd=cTdkMGxYQ0dGaG4zdkZpeFVlTmsrQT09 \nMeeting ID: 875 6474 3456\nPasscode: 259500
URL:https://aarms.math.ca/event/atlantic-graph-theory-semibar-sebastian-cioaba-university-of-delaware/
LOCATION:Online via Zoom
CATEGORIES:AARMS Atlantic Graph Theory Seminar,Atlantic Graph Theory Seminar
ORGANIZER;CN="jeannette Janssen":MAILTO:jeannette.janssen@dal.ca
END:VEVENT
END:VCALENDAR