Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)
Talks in 2022
February
- February 22, Meghana M. Reddy: Simplifying Non-simple Fan-Planar Drawings [details]
- February 24, Eleonora Eichelberg: Computational Complexity of Counting Crossing-free Structures in a Restricted and Augmented Setting [details]
March
- March 01, Goran Zuzic: A Simple Boosting Framework for Transshipment [details]
- March 03, Christoph Grunau: A Near-Optimal Deterministic Parallel Algorithm for (1+eps)-Approximate Shortest Paths [details]
- March 08, Julian Portmann: Average Awake Complexity of MIS and Matching [details]
- March 10, Daniel Bertschinger: Lions and Contamination [details]
- March 15, Istvan Tomon: Hyperplane covers of finite spaces [details]
- March 17, Simon Weber: Training Fully-Connected Neural Networks is ER-Complete [details]
- March 22, Nemanja Draganic: Induced subgraphs of sparse random graphs [details]
- March 24, David Munha Canas Correia: Rainbow matchings [details]
- March 29, Nicolas El Maalouly: Top-k Perfect Matching: Approximation and FPT Algorithms [details]
- March 31, Joost Jorritsma (Eindhoven University of Technology ): Distance evolutions in growing preferential attachment graphs [details]
April
- April 05, Saeed Ilchi: Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs [details]
- April 07, Michal Dory: Fault-Tolerant Labeling and Compact Routing Schemes [details]
- April 12, Raphael Steiner: New bounds for relatives of Hadwiger's conjecture [details]
- April 14, Marc Kaufmann: Success-Rate Sensitivity in the Self-Adjusting (1, λ)-EA [details]
- April 26, Kalina Petrova: Size-Ramsey numbers of subcubic graphs [details]
- April 28, Lasse Wulf (TU Graz): Non-preemptive tree packing [details]
May
- May 03, Charlotte Knierim: Hat guessing numbers of strongly degenerate graphs [details]
- May 05, Miloš Trujić: On the size-Ramsey number of grids [details]
- May 10, Jean Cardinal (Université Libre de Bruxelles): Diameter estimates for graph associahedra [details]
- May 12, Hung Hoang: Hardness of Approximating the Rank of a Graph Divisor [details]
- May 17, Nicolas Grelier: Max clique in disk graphs and Max independent set in graphs with forbidden odd cycles [details]
- May 19, Tommaso d'Orsi: A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs [details]
- May 24, Rajai Nasser: Age Distribution in Arbitrary Preemptive Memoryless Networks [details]
- May 31, Stefan Tiegel: Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise [details]
June
- June 02, Ulysse Schaller: Block-monotone subsequences [details]
- June 28, Arturo Merino (TU Berlin): Efficient generation of rectangulations via permutation languages [details]
- June 30, Torsten Mütze (University of Warwick): Efficient generation of elimination trees and Hamilton paths on graph associahedra [details]
August
- August 23, Zhihan Jin: Semi-algebraic And Semi-linear Ramsey Numbers [details]
- August 25, Emanuel Seemann: Matchings and Hamiltonian cycles in 1-planar graphs [details]
September
- September 15, in CAB G 56, Alex Black (UC Davis): Small Shadows of Lattice Polytopes [details]
- September 20, Maxime Larcher: A Random Walk Algorithm for the 2-Armed Bandit [details]
- September 22, Oliver Janzer: Small subgraphs with large average degree [details]
- September 27, Miloš Stojaković (University of Novi Sad): Generalised Turan Game [details]
- September 29, Joel Widmer: Solving systems of linear equations of Matousek matrices in the matrix-vector query model (Master Thesis) [details]
October
- October 04, Jingqiu Ding: Fast algorithm for random overcomplete order-3 tensor decomposition [details]
- October 06, Gleb Novikov: Higher degree sum-of-squares relaxations robust against oblivious outliers [details]
- October 18, Vaclav Rozhon: Thoughts on creating math videos [details]
- October 20, Meghana M. Reddy: On the Number of Edges in Maximal 2-planar Graphs [details]
- October 25, Nicolas El Maalouly: Approximation Algorithms for the Exact Matching Problem [details]
- October 27, Saeed Ilchi: Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates [details]
November
- November 01, Marc Kaufmann: Hitting time of clique factors in the random graph process [details]
- November 03, Lior Gishboliner: Polynomial removal lemmas: overview and new results [details]
- November 08, Raphael Steiner: Splitting digraphs [details]
- November 10, Johannes Lengler: Two-Dimensional Drift Analysis [details]
- November 15, Simon Weber: A Universal Construction for Unique Sink Orientations [details]
- November 17, Charlotte Knierim: Oriented Discrepancy of Hamilton cycles [details]
- November 29, Kalina Petrova: Minimum degree conditions for spanning linear hypertrees of bounded degree [details]
December
- December 01, Thomas Bläsius (Karlsruhe Institute of Technology): On the External Validity of Average-Case Analyses of Graph Algorithms [details]
- December 06, Jozef Skokan (LSE): Graphs with large minimum degree and large girth are three-colourable [details]
- December 08, Christoph Grunau: Distributed Derandomization via Local Rounding [details]
- December 15, Abhishek Methuku: A proof of the Erdős–Faber–Lovász conjecture. [details]
Upcoming talks | All previous talks | Talks by speaker |
Upcoming talks in iCal format (beta version!)
Previous talks by year: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login