Events

Filters
Export this event to calendar
iCal
RSS
RSS
Close X

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Wednesday, November 19, 2014 4:00 pm - 4:00 pm EST (GMT -05:00)

Graph theory seminar - Ahmad Abdi - cancelled

Shannon, Lehman, Edmonds, and Matroids

Speaker: Ahmad Abdi
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract:

Two players, Cut and Short, are presented with a graph and two distinguished vertices. In his turn, Cut removes an edge, his object being to disconnect the two vertices.

Friday, November 21, 2014 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte seminar - Dan Younger

Bill Tutte: A Snapshot of His Life

Speaker: Dan Younger
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5136B

Abstract: 

Recently, I uncovered in my office a letter from Tutte written in Newmarket, England, dated July 7, 1996. The letter describes the events of the prior several weeks, including his first visit to Bletchley Park since the end of World War II.

Friday, November 28, 2014 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte seminar - Gabriel Gauthier-Shalom

Juggling With Points on an Elliptic Curve

Speaker: Gabriel Gauthier-Shalom
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5136B

Abstract:

Elliptic curves are a useful tool in cryptography, because they can be endowed with an Abelian group structure for which the discrete logarithm problem is believed to be intractable.

Friday, December 5, 2014 2:30 pm - 2:30 pm EST (GMT -05:00)

Tutte seminar - Daniel Bienstock - note time change

Solving Quadratically Constrained Quadratic Programs

Speaker: Daniel Bienstock
Affiliation: Columbia University
Room: Mathematics and Computer Building (MC) 5136B

Abstract:

Quadratically constrained quadratic programs have attracted theoretical interest for some time, especially in the special case of the trust-region subproblem and as a special case of polynomial optimization problems.

Friday, December 12, 2014 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte seminar - Britta Peis - cancelled

Resource Competition on Matroids

Speaker: Britta Peis
Affiliation: RWTH Aachen University
Room: M3 3103

Abstract:  

Congestion games are widely used to model and analyse the behaviour of selfish acting uncontrolled individuals competing over a commonly used set of resources.

Wednesday, January 7, 2015 3:30 pm - 3:30 pm EST (GMT -05:00)

Graph theory seminar - Ahmad Abdi

Shannon, Lehman, Edmonds and Matroids

Speaker: Ahmad Abdi
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 6486

Abstract: 

Two players, Cut and Short, are presented with a graph and two distinguished vertices. In his turn, Cut removes an edge, his object being to disconnect the two vertices.

Friday, January 9, 2015 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte seminar - Konstantinos Georgiou

Lift and project systems performing on the partial-vertex-cover polytope

Speaker: Konstantinos Georgiou
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5479

Abstract: 

We study integrality gap (IG) lower bounds on strong relaxations derived by various lift-and-project systems for the $t$-Partial-Vertex-Cover (t-PVC) problem, a variation of the classic Vertex-Cover problem in which

Monday, January 12, 2015 9:30 am - 9:30 am EST (GMT -05:00)

Seminar - Peter Nelson

The Efficiency of Classes of Linear Codes

Speaker: Peter Nelson
Affiliation: University of Waterloo
Room: Mathematics and Computer Building (MC) 5417

Abstract:

A $[n,k]$-linear code over a field F is a $k$-dimensional subspace of $F^n$; the elements of this subspace are codewords.

Friday, January 16, 2015 9:30 am - 9:30 am EST (GMT -05:00)

Seminar - Johannes Carmesin

Tree-structure vs. Tangles in Graphs and Matroids

Speaker: Johannes Carmesin
Affiliation: University of Hamburg
Room: Mathematics and Computer Building (MC) 5417

Abstract: 

How do we decompose a k-connected graph into "its (k+1)-connected components"? One possible concept of highly connected components are tangles, as introduced by Robertson and Seymour. These can be separated in a tree-like way.

Monday, January 19, 2015 9:30 am - 9:30 am EST (GMT -05:00)

Seminar - Richard Peng

Multifaceted Algorithm Design via Graph Laplacians

Speaker: Richard Peng
Affiliation: MIT
Room: Mathematics and Computer Building (MC) 5417

Abstract:

Many computational problems induced by practice arise at the
intersection of combinatorics, optimization, and statistics.
Combining insights from these areas often leads to better algorithms