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

Talks in 2025

February 18, in CAB G51, Michael Hoffmann: Monotone Arc Diagrams with Few Biarcs [details]
February 20, in OAT S15, Jiaqi Zheng (NUS): Zero-Sum Games over Symmetric Cones as an Algorithmic Framework [details]
February 25, in OAT S15, Goran Žužić (Google Research): Recent and future advancements in AI for TCS/math [details]

March 04, in CAB G51, Maxim Mikhaylov: Topology of decision boundaries [details]
March 13, in CAB G52, Matija Pasch: Improved Universal Graphs for Trees [details]
March 18, in OAT S15, Ahad Zehmakan (Australian National University): Viral Marketing in Social Networks with Competing Products [details]
March 25, in OAT S15, Patrick Schnider: Linear Embeddings of Simplicial Complexes [details]
March 27, in CAB G52, Anton Paramonov: Branching Random Walks for Blazing-Fast Broadcasts! [details]

April 01, in OAT S15, Sebastian Haslebacher: Two Applications of l_p-Contraction [details]
April 03, in CAB G51, Simon Weber: Finding Fixpoints of l_p Contraction Maps (Query-)Efficiently [details]
April 08, in CAB G51, Philip Whittington: Time-Optimal k-Server [details]
April 10, in OAT S15, Hongjie Chen: Private and Robust Estimation for Random Graphs [details]

May 06, in OAT S15, Zylan Benjert (TU Delft): Epidemic Diffusion on GIRGs and Real Networks [details]
May 08, in OAT S15, Bernd Gärtner: Optimizing Symbol Visibility Through Displacement [details]
May 13, in CAB G51, Kalina Petrova (ISTA): Odd-Ramsey numbers of complete bipartite graphs [details]
May 15, in CAB G51, Hung Hoang (TU Wien): The k-Opt algorithm for TSP has exponential running time [details]
May 20, in OAT S15, David Fisac (Universitat Autònoma de Barcelona): A combinatorial perspective on Markov numbers (through geometry) [details]

August 21, in OAT S15, Lukas Himmelreich: The Risk-Sensitive Bahncard Problem: Competitive and Learning-Augmented Algorithms [details]

September 25, in OAT S15, Kosta Panagiotou (LMU): Dispersion on the complete graph [details]

October 02, in OAT S15, Kostas Lakis: The Diameter of GIRGs [details]
October 14, in OAT S15, Daniel Chiu: Geometric Routing in GIRGs [details]
Friday, October 17, in OAT S15 (15:00), Matt Regehr (University of Waterloo): Query-Efficient Locally Private Hypothesis Selection via the Scheffe Graph [details]
Friday, October 17, in OAT S15 (15:30), Argyris Mouzakis (University of Waterloo): Optimal Differentially Private Sampling of Unbounded Gaussians [details]
October 21, in CAB G51, Patryk Morawski: Ramsey numbers of digraphs with local edge structure [details]
October 23, in CAB G51, Aleksa Milojevic: Set-families with many disjoint pairs, and their relations to coding theory and communication complexity [details]
October 30, in OAT S15, Felix Quernheim: α > τ−2 - The Final Frontier: These are the Lower Bounds for Distances in GIRGS [details]

November 11, in CAB G51, Moritz Stocker: Packing Peas and Stealing Gold — Online Unbounded Knapsack Problems [details]
November 13, in OAT S15, Hongjin Wu: Skeleton of Globally Synchronizing Graphs [details]
November 18, in OAT S15, Theophile Thiery: Improved Approximation for Weighted k-Matroid Intersection [details]
November 20, in OAT S15, Tim Rieder: Random-Shift revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings [details]
November 25, in OAT S15, Sharat Ibrahimpur: Stochastic Load Balancing with Machine Reservations [details]

December 09, in OAT S15, Marc Dufay: An Improved Deterministic Algorithm For Online Matching With Delays [details]
December 11, in CAB G51, Maja Gwozdz: Entropic Optimal Transport on Graphs: A Geometry-Adapted Sinkhorn Algorithm [details]
December 16, in CAB G51, Kalina Petrova (ISTA): Packing subdivisions into regular graphs [details]

Automatic MiSe System Software Version 1.4803M | admin login