Algorithms and Complexity Theory Seminars

Unless stated otherwise, the seminars are on Thursdays at 2pm.  If you would like to be reminded of forthcoming seminars, please subscribe to the algorithms-seminar mailing list here.

Upcoming seminarsPrevious seminars

 Subscribe to this seminar series calendar.

• 24May
  To iterate or not to iterate: A linear time algorithm for recognizing almost-DAGs

  14:00 Thursday 24th May ( week Week 5, Trinity Term 2018 ) in Room 051, Wolfson Building

  Ramanujan Sridharan ( University of Warwick )
• 31May
  Recent Advances on the Parameterized Complexity of Integer Linear Programming

  14:00 Thursday 31st May ( week 6, Trinity Term 2018 ) in LTB in Department of Computer Science

  Sebastian Ordyniak ( University of Sheffield )
• 14Jun
  TBC

  14:00 Thursday 14th June ( week Week 8, Trinity Term 2018 ) in 051

  Andreas Galanis ( University of Oxford )

Standa Živný