Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Talks in 2023

February 21, Bernhard Haeupler: Intro to Expander Decopositions and Hop-Constrained Expanders [details]
February 23, Ulysse Schaller: Different speeds of Rumor Spreading [details]
February 28, Kalina Petrova: Size-Ramsey numbers of structurally sparse graphs [details]

March 02, David Ellis Hershkowitz: Hop-Bounded Flows [details]
March 07, Michaela Borzechowski (Freie Universität Berlin): Unique Sink Orientations of Grids is in Unique End of Potential Line [details]
March 09, Domagoj Bradač: Effective bounds for induced size-Ramsey numbers of cycles [details]
March 14, Duri Janett: Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions [details]
March 16, David Munha Canas Correia: Hamilton cycles in pseudorandom graphs [details]
March 21, Nemanja Draganić: Pancyclicity [details]
March 23, Zhihan Jin: The Minimum Degree Removal Lemma Thresholds [details]
March 28, Martin Fürer (Pennsylvania State University): Finding tree decompositions [details]
March 30, Julian Portmann: Sublinear Time Arboricity Approximation [details]

April 04, Patrick Schnider: Tverberg's Theorem for Hyperplanes [details]
April 06, Maxime Larcher: Efficient Generation of Size-Conditioned Galton-Watson Trees [details]
April 18, Nicolas El Maalouly: Equivalency Classes of Certain Constrained Matching Problems [details]
April 20, Meghana M. Reddy: Local Complexity of Polygons and its Relevance in the Art Gallery Problem [details]
April 25, Simon Weber: Reducing Nearest Neighbor Training Sets Optimally and Exactly [details]
April 27, Marc Kaufmann: OneMax is not the Easiest Function for Fitness Improvements [details]

May 02, Gleb Novikov: Robust Mean Estimation Without a Mean: Dimension-Independent Error in Polynomial Time for Symmetric Distributions [details]
May 04, Hung Hoang (Amazon): Zigzagging through acyclic orientations of graphs and hypergraphs [details]
May 09, Sebastian Haslebacher: Exact Matching: Characterization on Restricted Graph Classes [details]
May 11, Saeed Ilchi: Deterministic Distributed Hitting Set [details]
May 16, Michael Hoffmann: Lower bounds for obstacle numbers [details]
May 23, Patryk Morawski: Bounded-degree spanning trees in randomly perturbed digraphs [details]
May 25, Goran Zuzic (Google Research): Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances [details]
May 30, Rares Buhai: Algorithms Approaching the Threshold for Semi-random Planted Clique [details]

June 01, Rajko Nenadov: The determinism of randomness: a game-theoretic approach [details]
Wednesday, June 07, in OAT S 21, David Zuckerman (University of Texas): Almost Chor-Goldreich Sources and Adversarial Random Walks [details]
June 13, Benjamin Doerr (Ecole Polytechnique): Runtime Guarantees for the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) [details]
Monday, June 19, in OAT S 13, Leon Schiller (Hasso-Plattner Institute, Potsdam, Germany): Cliques in High-Dimensional Geometric Inhomogeneous Random Graphs [details]

July 11, in OAT X 11, Rouzbeh Hasheminezhad: The Myth of the Robust-Yet-Fragile Nature of Scale-Free Networks [details]

September 19, in OAT S15/S16/S17, Josiah Rohrer: Extended L-Graphs of Unique Sink Orientations (Master Thesis) [details]
September 21, in CAB G51, Anita Dürr: Approximating Exact Matching in bipartite graph [details]
September 26, in OAT S15/S16/S17, Nicolas El Maalouly: Top-k Perfect Matching: Motivation and LP Relaxation [details]

Automatic MiSe System Software Version 1.4803M | admin login