Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

Talks in 2024

February 20, in OAT S15/S16/S17, Simon Meierhans: Incremental Cycle Detection via Dynamic Minimum Cost Flow [details]
February 22, in CAB G51, Michael Hoffmann: Bipartite Dichotomous Ordinal Graphs [details]
February 27, in OAT S15/S16/S17, Goran Zuzic (Google Research): Deterministic Polylog-Competitive Routing [details]

March 05, in OAT S15/S16/S17, Seth Pettie (University of Michigan): Algorithms Should Have Bullshit Detectors! (or Polynomial Time Byzantine Agreement with Optimal Resilience) [details]
March 12, in CAB G51, Noah Kravitz (Princeton University): Can you reconstruct a set from its subset sums? [details]
March 14, in CAB G51, Damien Berriaud: Stable Dinner Party Seating Arrangements [details]
March 21, in CAB G51, Andrei-Costin Constantinescu: No Checkerboards Allowed! Permutations Satisfying (Non-)Betweenness Constraints in Polynomial Time [details]
March 26, in OAT S15/S16/S17, Johannes Lengler: Population Diversity in a Neutral Fitness Landscape [details]
March 28, in CAB G51, Simon Weber: Two Choices are Enough: Reductions in UEOPL [details]

April 02, in CAB G51, Rajko Nenadov (University of Auckland, New Zealand): Global rigidity of random graphs [details]
April 11, in CAB G51, Eoin Hurley (University of Amsterdam): Induced Trees in Sparse Expanders [details]
April 16, in CAB G51, Simona Boyadzhiyska (University of Birmingham): Ramsey goodness of loose paths [details]
April 18, in CAB G51, Cesare Carissimo: How Can We Better Understand Complex Learning Dynamics - The Case of Q-Learning and Braess's Paradox [details]
April 23, in OAT S15/S16/S17, Raphael Steiner: Short paths on and diameters of polytopes [details]
April 25, in CAB G51, Leon Schiller: Plus Strategies are Exponentially Slower for Planted Optima of Random Height [details]
April 30, in OAT S15/S16/S17, Richard Hladik: Fast and Simple Sorting Using Partial Information [details]

May 07, in OAT S15/S16/S17, Kalina Petrova: A note on digraph splitting [details]
May 21, in OAT S15/S16/S17, Raghu Raman Ravi: Sublinear Cuts are the Exception in BDF-GIRGs [details]
May 23, in CAB G51, Patrick Schnider: Stabbing convex sets with lines [details]
May 28, in OAT S15/S16/S17, Sebastian Haslebacher: Similarities between ARRIVAL and Simple Stochastic Games [details]

July 18, Jonas Lill: Parameterized Algorithm for Max-Cut in Multigraphs [details]

September 10, in OAT S15/S16/S17, Frank Neumann (University of Adelaide): Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes [details]
September 10, in OAT S15/S16/S17, Aneta Neumann (University of Adelaide): Diversity Optimization for the Detection and Concealment of Spatially Defined Communication Networks [details]
September 17, Simon Meierhans: Simple Dynamic Spanner and News on Dynamic Flow [details]
September 26, in CAB G51, Kostas Lakis: Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models [details]

October 08, in OAT X 11 (floor 19), Rares Buhai: Semirandom Planted Clique and the Restricted Isometry Property [details]

Automatic MiSe System Software Version 1.4803M | admin login