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

Talks in 2010

January 12, Tobias Christ: Consistent digital line segments [details]
January 19, Dominik Scheder: Constraint Satisfaction - Speeding Up Deterministic Local Search By Defining a Graph on the Set of Colors [details]
January 26, Marek Sulovský: On History of Tverberg Theorems[abstract] [details]
January 28, Johannes Blömer (Paderborn University): Non-uniform sampling and Bregman-clustering on well-separated instances [details]

March 02, Yves Brise: Minimizing Interference in Wireless Networks [details]
March 04, Luca Gugelmann: Random Graph Processes and the Differential Equation Method [details]
March 09, Thomas Rast: Tutte's characterizations of graphic and regular matroids [details]
March 11, David Adjiashvili (ETH - Institute for Operations Research): Adaptable-Robust Shortest Path [details]
March 16, Joachim Buhmann (ETH - Institute of Computational Science): Information theoretic model validation for clustering [details]
March 18, Andrea Francke: A Quasioptimum for Linear Programs (Master's Thesis Presentation) [details]
March 23, Benny Sudakov (UCLA - Departement of Mathematics): A Conjecture of Erdos on Graph Ramsey Numbers [details]
March 25, Florian Jug: Brain Science - On the Gap Between Observations and Current Knowledge [45 minutes]. [details]
March 30, Bernd Gärtner: USO - What's new though? [details]

April 01, Henning Thomas: Bounding Running Times via Forbidden 0-1 Matrices [details]
April 08, Micha Sharir (Tel Aviv University): Improved bounds for geometric permutations in higher dimensions [details]
April 13, Simi Haber (Tel Aviv University): The number of F-matchings in a random tree is a zero residue [details]
April 15, Ido Ben-Eliezer (Tel Aviv University): On the size Ramsey number of directed path [details]
April 22, Florian Jug: Relearning to Balance -- How Biofeedback Can Help You to Stand Upright [details]
April 27, Torsten Mütze: Globally sparse Ramsey Graphs [details]
April 29, Ueli Peter: Non-growing preferential attachment random graphs [details]

May 04, Mohammad Torabi Dashti (D-INFK - Information Security): Constructing and recognizing permutation-complete words [details]
May 06, Sonny Ben-Shimon (Tel-Aviv University): Hamiltonicity Maker-Breaker Games on Random Regular Graphs [details]
May 11, Tobias Müller (CWI Amsterdam): Line arrangements and geometric representations of graphs [details]
May 18, Emo Welzl: Covering Points By Disks Inside a Simple Polygon [details]
May 20, Johannes Lengler (Uni Saarbrücken): Automata Liar Games [details]
May 25, Gilad Tsur (Tel Aviv University): Testing Computability By Width-2 OBDDs in two settings. [details]
May 27, Augusto Teixeira (D-MATH): Random graphs left by a random walk [details]

June 01, Uli Wagner: A combinatorial/geometric proof of the Colored Tverberg Theorem [details]
June 03, Yuri Rabinovich (University of Haifa): Finite volume spaces and related issues [details]
Monday, June 07, Anastasios Sidiropoulos (TTY-C Chicago): Metric embeddings for topological graphs [details]
June 22, Martin Tancer: A counterexample to Wegner's conjecture on good covers [details]

July 13, Mike Luby (Qualcomm, San Diego, USA; 45 minute talk): Raptor coding technology [details]

August 10, Bhalchandra D. Thatte (University of Oxford): Reconstructing Population Pedigrees [details]
August 24, Csaba Dávid Tóth (University of Calgary): Watchman Tours for Polygons with Holes [details]
August 26, Stefan Schneider: Random Walk Algorithms for SAT and Constraint Satisfaction Problems [details]

September 16, Graham Brightwell (LSE): Ramsey-goodness [details]
September 21, Marc van Kreveld (Utrecht University): Computing with Shapes [details]
September 23, Will Perkins (NYU): Forgetfulness of Balls and Bins [details]
September 28, Heidi Gebauer: Constructing a Non-Two-Colorable Hypergraph with Few Edges [details]
September 30, Robin Moser: A Full Derandomization of Schoening's k-SAT Algorithm [details]

October 05, Torsten Mütze: Probabilistic one-player vertex-coloring games via deterministic two-player games - the deterministic game [details]
October 07, Thomas Rast: Probabilistic one-player vertex-coloring games via deterministic two-player games - the probabilistic game [details]
October 12, Yves Brise: It's Easy to Compute Exactly, but Hard to Minimize Fill-in [details]
October 14, Martin Jaggi: A typical day in the life of the optimization problem max x^T A x [details]
October 19, Dominik Scheder: Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses. [details]
October 21, Gabriel Nivasch: Avoiding forbidden sequences and matrices. [details]
October 26, Frederik von Heymann (TU Delft): Combinatorial ideas for an old analytic enigma. [details]
October 28, Jan Foniok: Randomised roundings on hypergraphs [details]

November 02, Anna Gundert: Connectivity of Random 2-Complexes [details]
November 04, Luca Gugelmann: Graphs in Hyperbolic Geometry [details]
November 09, Tobias Christ: Covering Polygons with Triangles [details]
November 11, Michael Hoffmann: Pointed binary encompassing trees: Simple and optimal [details]
November 16, Abel Guardian Camacho (45m, student GD): Matched Drawings of Planar Graphs [details]
November 18, Timon Hertli: Investigating and Improving the PPSZ Algorithm for SAT (master thesis) [details]
November 23, Marek Sulovský: Recent events on the conflict-free front. [details]
November 25, Bernd Gärtner: Approximately Solving Semidefinite Programs [details]
November 30, Johannes Lengler: Random Integers [details]

December 02, Ueli Peter: Steiner Tree Approximation via Iterative Randomized Rounding [details]
December 07, Gyula Károlyi (Eötvös Loránd University): Evaluation of polynomials over finite rings via additive combinatorics [details]
December 09, Angelika Steger: The degree distribution of random planar graphs [details]
December 14, Marek Sulovský: Obtuse angles: is the flat world being too fat? [details]
December 16, Sebastian Stich: Principles of self-adaptation in randomized optimization. [details]
December 21, Katherine Edwards (McGill): Packing T-joins in Planar Graphs [details]