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:20230312T070000 END:DAYLIGHT BEGIN:STANDARD TZNAME:EST TZOFFSETFROM:-0400 TZOFFSETTO:-0500 DTSTART:20231105T060000 END:STANDARD END:VTIMEZONE BEGIN:VEVENT UID:69f378e6d56c4 DTSTART;TZID=America/Toronto:20231201T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20231201T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-samuel-jaques SUMMARY:Tutte Colloquium - Samuel Jaques CLASS:PUBLIC DESCRIPTION:TITLE: Wires\, bits\, and the cost of sorting\n\nSpeaker:\n Sa muel Jaques\n\nAffiliation:\n University of Waterloo\n\nLocation:\n MC 550 1\n\nABSTRACT: How hard is it to sort a list of n integers? A basic cours e\non algorithms says it's O(n log n) time\, but what if the list is\nenor mous - so big you would need to cover the surface of the moon just\nto sto re it? DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d6556 DTSTART;TZID=America/Toronto:20231124T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20231124T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-karen-yeats-2 SUMMARY:Tutte Colloquium - Karen Yeats CLASS:PUBLIC DESCRIPTION:TITLE: Diagonal coefficients\, graph invariants with the symme tries of\nFeynman integrals\, and the proof of the c_2 completion conjectu re\n\nSpeaker:\n Karen Yeats\n\nAffiliation:\n University of Waterloo\n\nL ocation:\n MC 5501\n\nABSTRACT: In a scalar field theory the contribution of a Feynman\ndiagram to the beta function of the theory\, the Feynman pe riod\, can be\nwritten as an integral in terms of the (dual) Kirchhoff pol ynomial of\nthe graph. DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d6cbd DTSTART;TZID=America/Toronto:20231117T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20231117T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-luke-postle-2 SUMMARY:Tutte Colloquium - Luke Postle CLASS:PUBLIC DESCRIPTION:TITLE: Hypergraph Matchings Avoiding Forbidden Submatchings\n\ nSpeaker:\n Luke Postle\n\nAffiliation:\n University of Waterloo\n\nLocati on:\n MC 5501\n\nABSTRACT: We overview a general theory for finding perf ect or almost\nperfect matchings in a hypergraph G avoiding a given set of forbidden\nsubmatchings (which we view as a hypergraph H where V(H)=E(G)) . DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d75b0 DTSTART;TZID=America/Toronto:20231110T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20231110T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/distinguishe d-tutte-lecture-david-b-shmoys SUMMARY:Distinguished Tutte Lecture - David B. Shmoys CLASS:PUBLIC DESCRIPTION:TITLE: Algorithmic Tools for Congressional Districting: Fairne ss via\nAnalytics\n\nSpeaker:\n David B. Shmoys\n\nAffiliation:\n Cornell  University\n\nLocation:\n MC 5501\n\nABSTRACT: The American winner-take -all congressional district system\nempowers politicians to engineer elect oral outcomes by manipulating\ndistrict boundaries. To date\, computationa l solutions mostly focus on\ndrawing unbiased maps by ignoring political a nd demographic input\, and\ninstead simply optimize for compactness and ot her related metrics. DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d7d02 DTSTART;TZID=America/Toronto:20231103T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20231103T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-walaa-moursi-0 SUMMARY:Tutte Colloquium - Walaa Moursi CLASS:PUBLIC DESCRIPTION:TITLE: The Chambolle-Pock algorithm revisited: splitting opera tor and\nits range with applications\n\nSpeaker:\n Walaa Moursi\n\nAffilia tion:\n University of Waterloo\n\nLocation:\n MC 5501\n\nABSTRACT: Primal -dual hybrid gradient (PDHG) is a first-order method\nfor saddle-point pro blems and convex programming introduced by\nChambolle and Pock. Recently\, Applegate et al. analyzed the behavior\nof PDHG when applied to an infeas ible or unbounded instance of linear\nprogramming\, and in particular\, sh owed that PDHG is able to diagnose\nthese conditions. DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d83f8 DTSTART;TZID=America/Toronto:20231020T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20231020T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-sepehr-assadi SUMMARY:Tutte Colloquium - Sepehr Assadi CLASS:PUBLIC DESCRIPTION:TITLE: A Simple Sparsification Algorithm for Maximum Matching with\nApplications to Graph Streams \n\nSpeaker:\n Sepehr Assadi\n\nAffil iation:\n University of Waterloo\n\nLocation:\n MC 5501\n\nABSTRACT: In t his talk\, we present a simple algorithm that\nreduces approximating the maximum weight matching problem in\narbitrary graphs to few adaptively cho sen instances of the same\nproblem on sparse graphs. DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d8c62 DTSTART;TZID=America/Toronto:20230929T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20230929T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-nikhil-kumar SUMMARY:Tutte Colloquium - Nikhil Kumar CLASS:PUBLIC DESCRIPTION:TITLE: An Approximate Generalization of the Okamura-Seymour Th eorem\n\nSpeaker:\n Nikhil Kumar\n\nAffiliation:\n University of Waterloo\ n\nLocation:\n MC 5501\n\nABSTRACT: We consider the problem of multicommo dity flows in planar\ngraphs. Okamura and Seymour showed that if all the d emands are\nincident on one face\, then the cut-condition is sufficient fo r routing\ndemands. DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d953d DTSTART;TZID=America/Toronto:20230922T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20230922T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-vida-dujmovic SUMMARY:Tutte Colloquium - Vida Dujmovic CLASS:PUBLIC DESCRIPTION:TITLE: Proof of the Clustered Hadwiger Conjecture\n\nSpeaker:\ n Vida Dujmovic\n\nAffiliation:\n University of Ottawa\n\nLocation:\n MC 5 501\n\nABSTRACT: Hadwiger's Conjecture asserts that every Kh-minor-free\n graph is properly (h-1)-colourable. We prove the following improper\nanal ogue of Hadwiger's Conjecture: for fixed h\, every Kh-minor-free\ngraph i s (h-1)-colourable with monochromatic components of bounded\nsize. DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6d9e64 DTSTART;TZID=America/Toronto:20230804T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20230804T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq uium-bill-jackson SUMMARY:Tutte Colloquium - Bill Jackson CLASS:PUBLIC DESCRIPTION:TITLE: Rigidity of Simplicial Complexes\n\nSpeaker:\n Bill Jac kson\n\nAffiliation:\n Queen Mary University of London\n\nLocation:\n MC 5 501\n\nABSTRACT: A _simplicial k-cycle_ is an abstract simplicial k-compl ex\nin which every (k-1)-face belongs to an even number of k-faces. A\n_si mplicial k-circuit_ is a minimal simplicial k-cycle (in the sense\nthat n one of its proper subcomplexes are simplicial k-cycles). DTSTAMP:20260430T154438Z END:VEVENT BEGIN:VEVENT UID:69f378e6da826 DTSTART;TZID=America/Toronto:20230721T153000 SEQUENCE:0 TRANSP:TRANSPARENT DTEND;TZID=America/Toronto:20230721T153000 URL:https://uwaterloo.ca/combinatorics-and-optimization/events/joint-tutte- colloquium-algorithms-and-complexity-seminar SUMMARY:Joint Tutte Colloquium & Algorithms and Complexity Seminar - Leonid \nGurvits CLASS:PUBLIC DESCRIPTION:TITLE: Combinatorial and complexity theoretic aspects of Stabi lities\nand Controllabilities of linear switched systems(discrete and\ncon tinuous time)\n\nSpeaker:\n Leonid Gurvits\n\nAffiliation:\n The City Coll ege of New York\n\nLocation:\n MC 5501\n\nABSTRACT: I will talk about my \"pre-hyperbolic\" research\, some of it\ndone jointly with Alex Samorodni tsky and Alex Olshevsky. DTSTAMP:20260430T154438Z END:VEVENT END:VCALENDAR