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

All Previous Talks

1996

April

• April 18, 1996, Emo Welzl: Lernen durch Verdoppeln [details]
• April 23, 1996, Hans-Martin Will: Dynamisches Verwalten kinematischer Strukturen [details]
• April 25, 1996, Bernhard von Stengel: Bimatrixspiele: Berechnung von Gleichgewichtspunkten [details]
• April 30, 1996, Hans-Martin Will: Dynamisches Verwalten kinematischer Strukturen [details]

May

• May 02, 1996, Lutz Kettner: CEBaP: Contour Based Polyhedron Visualization: Hidden Surface Removal in R^3 [details]
• May 14, 1996, Jiří Matoušek: Approximation by zonotopes, numerical integration, and discrepancy [details]
• May 21, 1996, Johannes Blömer: Expander Codes [details]
• May 28, 1996, Emo Welzl: Verdoppeln II: Spannbaeume mit kleiner Kreuzungszahl [details]
• May 30, 1996, Daniel Bleichenbacher: Optimal Tree-based One-time Signature Schemes [details]

June

• June 04, 1996, Jiří Matoušek: Constants for Cuttings [details]
• June 06, 1996, Christian Cachin: Online Secret Sharing [details]
• June 11, 1996, Jan Camenisch: Ein effizientes faires Zahlungssystem [details]
• June 18, 1996, Joachim Giesen: Quantencomputer: Grundlagen [details]
• June 20, 1996, Joachim Giesen: Quantencomputer: Diskreter Logarithmus [details]
• June 25, 1996, Juerg Nievergelt: Kasparov - Deep Blue 4:2. Does it mean anything for CS? [details]
• June 27, 1996, Brigitte Kroell: Historische Probleme in der stochastischen Geometrie [details]

July

• July 02, 1996, Johannes Blömer: Härte gegen Zufall [details]
• July 04, 1996, Paul Callahan: Well-separated sets and some problems involving complete Euclidean graphs [details]
• July 09, 1996, Bernhard von Stengel: Tracing Equilibria in Extensive Games by Complementary Pivoting [details]

August

• Sunday, August 11, 1996, Peter Remmele: Kinematisches Voronoidiagram in 3D und dessen Implementation [details]
• Wednesday, August 28, 1996, Frank Wagner: Ein systematischer Ansatz fuer die Landkartenbeschriftung [details]

September

• Saturday, September 07, 1996, Stefan Felsner (FU Berlin): Reduzierte Dekompositionen und Young Tableaux (45 min) [details]
• Wednesday, September 11, 1996, Stefan Felsner: Graphs and Poset-Dimension (45 min) [details]
• September 17, 1996, Joachim Giesen: Kruemmung von Kurven [details]
• September 19, 1996, Bernhard von Stengel: Wie garantiert man a [details]
• Saturday, September 21, 1996, Leonidas Guibas (Stanford University): Collision Detection (45 min) Raum E42 [details]
• September 26, 1996, Tetsuo Asano: Polynomial-time algorithm for Optimal Image Segmentation (11.00 - 12.00) [details]

October

• October 01, 1996, Micha Sharir: k-sets: panem et circences [details]
• October 03, 1996, Micha Sharir: Davenport-Schinzel Sequences, Lower Envelopes [details]
• October 08, 1996, Micha Sharir: Davenport-Schinzel Sequences, Lower Envelopes [details]
• October 10, 1996, Micha Sharir: Davenport-Schinzel Sequences, Lower Envelopes [details]
• October 15, 1996, Nicola Galli: Random Graphs: Exact analyses vs. asymptotic approximations. [details]
• October 17, 1996, Johannes Blömer: Ausfalltolerante Codes [details]
• October 22, 1996, Christoph Stamm: Visualisierung der logischen Deduktion mittels Resolution [details]
• October 24, 1996, Micha Sharir: Davenport-Schinzel Sequences, Lower Envelopes [details]
• October 29, 1996, Hans-Martin Will: A faster Earley Parser [details]
• October 31, 1996, Joachim Giesen: Wavelets (Einfuehrung) [details]

November

• November 05, 1996, Emo Welzl: Perfect Matchings in k-Regular Bipartite Graphs [details]
• November 07, 1996, Artur Andrzejak: Relationen zwischen den Anzahlen der $k$-Mengen und den Anzahlen der $j$-Facetten [details]
• November 12, 1996, Danny Krizanc: Approximating the Unsatisfiability Threshold of Random Formulae [details]
• Friday, November 15, 1996, Mike Luby: Fast, Practical, Randomized Erasure-Resilient Codes [details]
• November 19, 1996, Christian Cachin: Smooth Entropy (Einfuehrung) [details]
• November 21, 1996, Christian Cachin: Smooth Entropy and Renyi Entropy [details]
• November 26, 1996, Jan Camenisch: Generalized Group Signatures [details]
• November 28, 1996, Johannes Blömer: Optimale Nichtapproximierbarkeitsresultate (J. Hastad: Some optimal in-approximibility results, submitted STOC'97) [details]

December

• December 03, 1996, Johannes Blömer: Optimale Nichtapproximierbarkeitsresultate (2.Teil) [details]
• December 05, 1996, Lutz Kettner: Hidden Surface Removal in Object Space for Terrains [details]
• December 12, 1996, Joachim Giesen: Quanteninformation [details]
• December 17, 1996, Ulrich Kortenkamp (TU Berlin): Extremale Eigenschaften von 0/1-Polytopen [details]

1997

January

• January 14, 1997, Dietmar Kühl: Implementation von Graphalgorithmen [details]
• January 16, 1997, Gabriele Neyer: Specification and implementation of range and segment trees in CGAL [details]
• January 28, 1997, Hans-Martin Will: Compositional grammars - Oder: Wieviel Theorie braucht man für die übersetzung Englisch-Holländisch? [details]
• January 30, 1997, Nora Sleumer: Polynomial-rate algorithms for constructung arrangements [details]

February

• February 04, 1997, Paul Callahan: Causing disasters efficiently: output-sensitive queries in discrete event simulation [details]
• Friday, February 07, 1997, Leonidas Guibas: Data structures for mobile data [details]
• February 20, 1997, Giovanni Cesari: Parallel algorithms for multiple-precision arithmetic [details]
• February 25, 1997, Victor Shoup: Lower bounds for discrete logarithms and related problems [details]

March

• March 04, 1997, Bernd Gärtner: Kleinste umschliessende Ellipsen [details]
• March 06, 1997, Beat Trachsler: Geburtsprozesse und Datenstrukturen [details]
• March 13, 1997, Bernhard von Stengel: Probability generating functions [details]
• March 20, 1997, Stephan Eidenbenz: Optimale Suchbäume [details]
• March 25, 1997, Günter Rote: Matching convex shapes with respect to the symmetric difference [details]

April

• April 08, 1997, Andreas Enge: Elliptic curves and their use in cryptography - an elementary introduction [details]
• April 10, 1997, Gyula Károlyi: On a graph coloring problem [details]
• April 15, 1997, Boris Aronov: Average cost of ray shooting and minimum-area triangulations [details]
• April 17, 1997, Ronald Cramer: Linear zero-knowledge [details]
• April 24, 1997, Bernhard von Stengel: Asymptotics of generating functions: Results of lookup 1 3 13 63 321 1683 8989 [details]
• April 29, 1997, Hans-Martin Will: Verifying Polytopes [details]

May

• May 06, 1997, Joachim Giesen: Curve reconstruction and the euclidean traveling salesman problem [details]
• May 13, 1997, Joachim Giesen: Curve reconstruction and the euclidean traveling salesman problem [details]
• May 15, 1997, Emo Welzl: An identity on the halving edges of a planar point set [details]
• Friday, May 16, 1997, Berry Schoenmakers: Basic security - aspects of the ecash(tm) system [details]
• May 20, 1997, Imre Bárány: Sylvester's question: the probability that n points are in convex position [details]
• May 22, 1997, Emo Welzl: An identity on the halving edges of a planar point set (Teil 2) [details]
• May 27, 1997, Nicola Santoro (Carleton University, Ottawa, Canada): Computing with a sense of direction [details]
• May 29, 1997, Ambros Marzetta: Primal-dual methods for vertex and facet enumeration [details]
• Friday, May 30, 1997, Mary Inaba (University of Tokyo): On geometric clustering problems [details]

June

• June 12, 1997, Marc van Kreveld (University of Utrecht): Label placement by maximum independent set in rectangles [details]
• June 24, 1997, Reto Kohlas: A mathematical theory of hints: One way to deal with uncertain information [details]
• June 26, 1997, Jürgen Richter-Gebert: Strange properties of arrangements of pseudohyperplanes [details]

July

• July 01, 1997, Johannes Blömer: Testen von Gleichungen [details]
• July 03, 1997, Hans-Martin Will: An efficient algorithm for hidden surface removal [details]
• July 10, 1997, Beat Trachsler: Superconcentrators of linear size [details]
• July 15, 1997, Nicola Galli: Compression of sparse matrices [details]
• July 17, 1997, Joachim Giesen: Minimal roughness property of the Delaunay triangulation [details]
• July 22, 1997, Artur Andrzejak: An arrangement of pseudolines with many median intersections [details]
• July 24, 1997, Beat Trachsler: Superconcentrators II: applications and recent results [details]
• July 29, 1997, Chantal Korostensky: Phylogenetic trees and multiple sequence alignments [details]

August

• August 12, 1997, Bernhard Seybold: Constraint solving: Einführung und Spezialfälle [details]
• August 14, 1997, Harald Meyer auf'm Hofe (DFKI Kaiserslautern): Hybride Suchalgorithmen und Constrainthierarchien [details]

September

• September 02, 1997, Johannes Blömer: Nulltests für Wurzelausdrücke [details]
• September 04, 1997, Bernd Gärtner: External Pivoting [details]
• Monday, September 08, 1997, Jakob Magun: Greedy Matching Algorithms, an Experimental Study [details]
• September 09, 1997, Bernhard von Stengel: Redundant variables in LP pivoting [details]
• September 11, 1997, Martin Müller: Report on IJCAI'97, RoboCup (computer soccer) and FOST Cup (Computer Go) [details]
• September 23, 1997, Torsten Thiele (Freie Universität Berlin): Three-dimensional grid drawings of graphs [details]

October

• October 02, 1997, Johannes Blömer: P = BPP ? [details]
• October 07, 1997, Artur Andrzejak: Local minima on k-levels [details]
• October 09, 1997, Gyula Károlyi: Ramsey-remainder for convex sets and the Erdős-Szekeres Theorem [details]
• October 14, 1997, Artur Andrzejak: Applications of the bound on local mimina of $k$-levels [details]
• October 16, 1997, Bernd Gärtner: A Simple(x) Algorithm for Smallest Enclosing Balls [details]
• October 21, 1997, Michael Hoffmann: Searching in Monotone Matrices [details]
• October 23, 1997, Lutz Kettner: Implementation of Convex-Hull Algorithms [details]
• October 28, 1997, Gustavo Alonso (Institute of Information Systems): Extensions of serializability theory to middleware environments [details]
• October 30, 1997, Lutz Kettner: Implementation of Convex-Hull Algorithms [details]

November

• November 04, 1997, Beat Trachsler: Tight bounds for depth-two superconcentrators [details]
• November 06, 1997, Gabriele Neyer: Singularities Make Spatial Join Scheduling Hard [details]
• November 11, 1997, Peter Widmayer: Allmähliches Balancieren von Suchbäumen: Wie sich Probleme manchmal durch Abwarten lösen lassen [details]
• November 13, 1997, Hans-Martin Will: Computing additively weighted Voronoi cells for applications in molecular biology [details]
• November 18, 1997, Roger Wattenhofer: Decentral Distributed Data Structures [details]
• November 20, 1997, Joachim Giesen: Calculating minimal surfaces [details]
• November 25, 1997, Christos Papadimitriou (UC Berkeley): Market Segmentation Problems [details]
• November 27, 1997, Bernd Gärtner: +1/-1 determinants [details]

December

• December 02, 1997, Bernhard von Stengel: Mathematical recreations by John Conway [details]
• December 04, 1997, Ulrich Kortenkamp: Fingerprinting of oriented matroids [details]
• Monday, December 08, 1997, David Bryant (University of Canterbury, New Zealand): Building trees, hunting for trees and comparing trees [details]
• December 09, 1997, Eljas Soisalon-Soininen (Helsinki University of Technology): Balanced distributed search tree [details]
• December 11, 1997, Stephan Eidenbenz: Lange Codes, oder wie man durch Lesen nur dreier Bits überprüft, ob eine Variablenbelegung einer k-SAT-Formel die Formel erfüllt [details]
• December 16, 1997, Alexander Schrijver (CWI and Universiteit van Amsterdam): Optimization at the Dutch Railway [details]
• December 18, 1997, Thomas Roos: Space filling curves for range queries -- all equal? [details]

1998

January

• January 06, 1998, Beat Trachsler: The Zarankiewicz problem and the size of dispersers [details]
• January 08, 1998, Alexander Below: On the space of realizable extensions of oriented matroids [details]
• January 13, 1998, Roland Ulber: How Polish Mathematicians Deciphered The Enigma [details]
• January 15, 1998, Thom Mulders: On using fraction-free methods in the simplex method [details]
• January 20, 1998, Alexander Below: The spaces of realizeable extensions of oriented matroids (II) [details]
• January 22, 1998, Nora Sleumer: Enumerating the cells of an arrangement [details]
• Wednesday, January 28, 1998, Ivan Damgaard (Aarhus University, Denmark): Theory and Practice of Zero-Knowledge Protocols [details]
• January 29, 1998, Ivan Damgaard (Aarhus University, Denmark): Secure multi-party computation [details]

February

• February 03, 1998, Bernd Gärtner: Abstract Objective Functions [details]
• February 05, 1998, Gyula Károlyi: Subpolytopes of cyclic polytopes [details]
• February 10, 1998, Ueli Maurer: Secure multi-party computation [details]
• February 19, 1998, Martin Hirt: Realizing Secure Multi-Party Computation [details]
• February 24, 1998, Matthias Fitzi: Why it Needs more than Three Women to Force a Presidential Resignation [details]
• February 26, 1998, Peter Remmele: Near-Quadratic Bounds for the L_1 Voronoi Diagram of Moving Points [details]

March

• March 05, 1998, Helmut Alt: Point sets with few k-sets [details]
• March 10, 1998, Helmut Alt: Nearest neighbor search in high dimensions [details]
• March 12, 1998, Jochen van den Bercken: Bulk Index Join: A Generic Approach to Processing Non-Equi Joins [details]
• March 17, 1998, Alexander Below: Computation of homology of a simplicial complex [details]
• March 19, 1998, Konrad Schlude: Kurzeinfuhrung in die Topologie [details]
• March 31, 1998, Johannes Blömer: Gitter, Geometrie, Kryptographie, Komplexitat [details]

April

• April 07, 1998, Frank Wagner (Freie Universität Berlin): Mimicking Networks [details]
• April 09, 1998, Gábor Fejes Tóth (Hungarian Academy of Science): Some open problems on packing and covering [details]
• April 14, 1998, Hans-Martin Will: Exakte Algorithmen für Kreise auf Kugeln [details]
• April 16, 1998, Bernd Gärtner: Abstract Objective Functions [details]
• April 21, 1998, Jack Snoeyink (INRIA Sophia-Antipolis & Univ. of British Columbia): On the primitives required for efficient segment intersection algorithms [details]
• April 23, 1998, Jack Snoeyink: An open problem on points and segments in the plane, and where it comes from [details]

May

• May 05, 1998, Johannes Blömer: Gitter, reduzierte Basen und Faktorisierungen von Polynomen [details]
• May 07, 1998, Jiří Matoušek: Noga Alon on the Shannon capacity of a disjoint union [details]
• May 12, 1998, Hans-Martin Will: Parsing English with a link grammar [details]
• May 14, 1998, Artur Andrzejak: The poset of regions of a hyperplane arrangement [details]
• May 19, 1998, Antoon van den Elzen (Department of Econometrics, Tilburg University): Introduction to simplicial algorithms and an application to game theory [details]
• May 26, 1998, Lutz Kettner: Designing a Data Structure for Polyhedral Surfaces [details]

June

• June 02, 1998, Jiří Matoušek: Graphs without small complete bipartite subgraphs (according to Kollar, Ronyai, Szabo, and Alon) [details]
• June 04, 1998, Beat Trachsler: An efficient loss-resilient code [details]
• June 09, 1998, Imre Bárány (Hungarian Academy of Sciences): Spiral in Geodesics [details]
• June 11, 1998, Jürgen Richter-Gebert: Cinderella's Cafe - Beta-Release Party [details]
• June 16, 1998, Günter Rote: Optimal logistics for expeditions - the jeep problem with complete refilling [details]
• June 18, 1998, Joachim Giesen: Fundamentals of Embeddings of 1-Manifolds [details]
• June 23, 1998, Joachim Giesen: Menger's Theorem and weak irregular embeddings [details]
• Friday, June 26, 1998, Artur Andrzejak: (j,i)-Facetten: Eine Verallgemeinerung von j-Facetten und k-Mengen [details]
• June 30, 1998, Christian Gut: Einweg-Funktionen und versteckte Bits (I) [details]

July

• July 02, 1998, Christian Gut: Einweg-Funktionen und versteckte Bits (II) [details]
• July 07, 1998, Mike Hallet: Really Really Big Reductions - Parameterized Complexity [details]
• Wednesday, July 08, 1998, Joachim Giesen: Kurven, Kurven ... [details]
• July 09, 1998, Joachim Giesen: ... und nochmals Kurven [details]
• July 14, 1998, Otfried Cheong: Hierarchische vertikale Zerlegungen [details]
• July 16, 1998, Otfried Cheong: Hierarchische vertikale Zerlegungen (Anwendungen) [details]
• July 21, 1998, Nicola Galli: Uniformity prefers irregularities: Some (open) problems in pattern matching (Teil 1) [details]
• July 23, 1998, Nicola Galli: Uniformity prefers irregularities: Some (open) problems in pattern matching (Teil 2) [details]

August

• August 04, 1998, Jean-Pierre Seifert: Komplexitat diophantischer Approximationen [details]
• August 11, 1998, Peter Remmele: Kinematische Voronoi-Diagramme und ihre Implementierung [details]
• August 20, 1998, Ulrike Stege: Analogs & Duals of the MAST Problem for Sequences & Trees [details]
• August 27, 1998, Christoph Ambühl: Towards New Lower Bounds for the List Update Problem [details]
• Friday, August 28, 1998, Frank Wagner: Ein systematischer Ansatz für die Landkartenbeschriftung [details]

September

• September 03, 1998, Maurice Herlihy (Brown University): :Theory and Practice of Lock-Free Synchronization [details]
• Monday, September 07, 1998, Stefan Felsner (FU Berlin): Graphs and Poset-Dimension [details]
• Friday, September 11, 1998, Stefan Felsner: Reduzierte Dekompositionen und Young Tableaux [details]
• September 15, 1998, Johannes Blömer: Kurze Gitterbasen und Ajtai's worst-case auf average-case Reduktion [details]
• September 17, 1998, Johannes Blömer: Arthur und Merlin unterhalten sich über Gitter - Wie schwer ist es kurze Gittervektoren zu berechnen? [details]
• Monday, September 21, 1998, Leonidas Guibas (Stanford University): Collision Detection [details]
• September 22, 1998, Bernd Gärtner: Ein Reinfall mit Pseudozufallsmatrizen [details]
• September 24, 1998, Emo Welzl: Applications of inversion formulas [details]
• September 29, 1998, Emo Welzl: Line entering j-facets [details]

October

• October 06, 1998, Johannes Blömer: Fast orthogonale Gitterbasen [details]
• October 13, 1998, Emo Welzl: On a simple sampling lemma [details]
• October 15, 1998, Beat Trachsler: k-Cores in a Random Graph: Demonstration of a New Analysis Tool [details]
• October 22, 1998, Emo Welzl: From d to n-d - the Gale transform (sort of) [details]
• October 27, 1998, Lutz Kettner: Designing a Data Structure for Polyhedral Surfaces with C++ Templates [details]
• October 29, 1998, Artur Andrzejak: Reverse search for k-sets [details]

November

• November 03, 1998, Ulrich Kortenkamp: Applications of Gale duality (sort of) [details]
• November 05, 1998, Falk Tschirschnitz: Random Simplex is exponential in the heigth [details]
• November 10, 1998, Christoph Ambühl: The Random Assignment Problem [details]
• November 12, 1998, Johannes Blömer: Makes uniqueness life easy? (Part I) [details]
• November 17, 1998, Jesus de Loera: The secondary polytope and Gale transforms [details]
• November 19, 1998, Joachim Giesen: A random bit-flipping method for seeking agreement [details]
• November 24, 1998, Joachim Giesen: A random bit-flipping method for seeking agreement (II) [details]
• November 26, 1998, Joachim Giesen: A random bit-flipping method for seeking agreement (III) [details]

December

• December 03, 1998, Bernd Gärtner: Directed Connectedness of polytope graphs [details]
• December 08, 1998, Ulrike Stege: On the Multiple Gene Duplication Problem [details]
• December 10, 1998, Artur Andrzejak: Segmentation problems - a novel genre of optimization problems [details]
• December 15, 1998, Michael Hoffmann: Path Coupling: A technique for proving rapid mixing in Markov chains (Part I) [details]

1999

January

• January 05, 1999, Ambros Marzetta (ICSI Berkeley): Computing the k best Euclidean spanning trees [details]
• January 07, 1999, Michael Hoffmann: Path Coupling: A technique for proving rapid mixing in Markov chains (Part II) [details]
• January 12, 1999, Beat Trachsler: Context Tree Weighting (I): Arithmetic Coding [details]
• January 14, 1999, Beat Trachsler: Context Tree Weighting (II): The CTW Method [details]
• January 19, 1999, Babak Vahdat: Randomisierte gierige Matchings (I) [details]
• January 21, 1999, Babak Vahdat: Randomisierte gierige Matchings (II) [details]
• January 26, 1999, Frans Wessendorp: Enumeration abstrakter Zielfunktionsgraphen (I) [details]
• January 28, 1999, Frans Wessendorp: Enumeration abstrakter Zielfunktionsgraphen (II) [details]

February

• February 02, 1999, Christoph Ambühl: Karp's Upper Bound on the Expected Cost of an Optimal Assignment [details]
• February 09, 1999, Falk Tschirschnitz: The Path of a Triangulation [details]
• February 11, 1999, Johannes Blömer: Makes uniqueness life easy? (II) [details]
• February 16, 1999, Bernd Gärtner: More on pseudo random number generators [details]
• February 18, 1999, Lutz Kettner: A fast point location structure for randomized incremental Delaunay triangulation [details]
• February 23, 1999, Michael Hoffmann: Counting with uniform generators [details]
• February 25, 1999, Jean-Pierre Seifert: Extending Wieners attack in the presence of many decrypting exponents [details]

March

• March 25, 1999, Bernhard von Stengel: Recursive Inspection Games [details]
• March 30, 1999, Bernhard von Stengel: Team-Max-Min Equilibria, or: if it's Bill Gates against the rest of the world - who would you like to be? [details]

April

• April 06, 1999, Bernd Gärtner: Primitives for smallest enclosing balls [details]
• April 08, 1999, Michael Hoffmann: The rectangular 3-center problem [details]
• April 13, 1999, Johannes Blömer: MDS-Codes für RAIDs [details]
• April 15, 1999, Joachim Giesen: Graphs on spheres or how tequila can stabilize [details]
• April 20, 1999, Johannes Blömer: MDS-Codes fü RAIDs (II) [details]
• Saturday, April 24, 1999, Udo Adamy: Planar Point Location [details]
• April 27, 1999, Ulrike Stege: Techniques for building FPT-algorithms on the example of vertex cover [details]
• April 29, 1999, Preda Mihailescu: Primheitsbeweise [details]

May

• May 04, 1999, Artur Andrzejak: NP-complete problems in arrangements of hyperplanes and in point configurations [details]
• May 06, 1999, Christoph Ambühl: Burrows-Wheeler transformations [details]
• May 11, 1999, Meir Katchalski: Common Transversals [details]
• May 18, 1999, Jesus de Loera: Two (strange?) phenomena in simplicial decompositions of polytopes [details]
• May 20, 1999, Falk Tschirschnitz: Linear Orientations on Polytopal Graphs [details]
• May 25, 1999, Jürgen Richter-Gebert: NP-hardness of finding minimal triangulations of boundaries of 4-Polytopes. [details]
• May 27, 1999, Jesus de Loera: Counting affine roots of zero-dimensional polynomial systems: why are algebraist suddenly so excited about computational geometry? [details]

June

• June 01, 1999, Pascal Junod: Kryptographisch sichere Zufallszahlen (I) [details]
• June 03, 1999, Pascal Junod: Kryptographisch sichere Zufallszahlen (II) [details]
• June 08, 1999, Jiří Matoušek: Embedding trees in Euclidean space [details]
• June 10, 1999, Bernd Gärtner: Stirling numbers - a close encounter of the first kind [details]
• June 15, 1999, Gregory Sutter: Determinantenberechnung ohne Dividieren [details]
• June 17, 1999, Martin Spörri: Das Tabellen-Layout Problem [details]
• June 22, 1999, Pascal Junod: Kryptographisch sichere Zufallszahlen (III) [details]
• June 24, 1999, David Bremner: Inner diagonals of convex polytopes [details]

July

• July 15, 1999, Maurice Rojas (Hong Kong City University): Some Faster Algorithms for Fewnomials [details]
• July 22, 1999, Bartosz Przydatek: A Fast Approximation Algorithm for the Subset-Sum Problem [details]

August

• August 05, 1999, Samarjit Chakraborty: Approximation Algorithms for 3-D Common Substructure Identification in Drug and Protein Molecules [details]

September

• Friday, September 24, 1999, Jean-Daniel Boissonat (INRIA Sophia Antipolis): Efficient algorithms for reporting monotone curve segment intersections using restricted predicates [details]

October

• October 12, 1999, Johannes Blömer: Quantenschaltkreise [details]
• October 14, 1999, Uli Wagner: Das Banach-Tarski-Paradox [details]
• October 19, 1999, Christoph Ambühl: Optimal projective list update algorithms (I) [details]
• October 21, 1999, Johannes Blömer: Speedups via quantum computers [details]
• October 26, 1999, Christoph Ambühl: Optimal projective list update algorithms (II) [details]
• October 28, 1999, Johannes Blömer: Asymptotic speedups via quantum computers [details]

November

• November 02, 1999, Alex May: Factoring p^r*q for large r [details]
• November 04, 1999, Alexander Below: Finding minimal triangulations of convex 3-polytopes is NP-hard [details]
• November 09, 1999, Matthias John: Power diagrams and regular triangulations - Definition [details]
• November 11, 1999, Samuele Pedroni: Enumeration of triangulation paths [details]
• November 16, 1999, Vanessa Kääb: Duality of Search Strategies on Planar Graphs [details]
• November 18, 1999, Matthias John: Power diagrams and regular triangulations - Computation [details]
• November 23, 1999, Samuele Pedroni: Enumeration of triangulation paths (II) [details]
• November 25, 1999, Artur Andrzejak: Corner cut polyhedra [details]
• November 30, 1999, Bernd Gärtner: Neues über LP-type problems [details]

December

• December 02, 1999, Johannes Blömer: Berechnung nächster Gittervektoren [details]
• December 09, 1999, Adrian Dumitrescu: On a lower bound construction [details]
• December 14, 1999, Rade Zivaljevic: Equipartitions of point sets and mass distributions by hyperplanes [details]
• December 14, 1999, Tibor Szabó: Norm-graphs: variants and applications [details]
• December 16, 1999, Tibor Szabó: On a Generalization of the Erdős-Szekeres Theorem [details]
• December 16, 1999, Bernhard von Stengel: Correlated equilibria and computational complexity [details]
• December 21, 1999, Udo Adamy: The SURE project - Theorie und Demo. [details]

2000

January

• January 13, 2000, Falk Tschirschnitz: Introduction to regression depth [details]
• January 18, 2000, Falk Tschirschnitz: Introduction to regression depth (II) [details]
• January 20, 2000, Andreas Fabri (ABB Corporate Research Ltd.): Remote Monitoring using internet technology [details]
• January 25, 2000, Andreas Fabri (ABB Corporate Research Ltd.): Remote Monitoring using internet technology [details]
• January 27, 2000, Johannes Blömer: Die Quanten-Nadel im Quanten-Heuhaufen [details]

February

• February 10, 2000, Alexander Below: Making love on a Swedish island is hard [details]

March

• March 28, 2000, Michael Hoffmann: Rectilinear 3-Covering: The Lower Bound in 3D [details]

April

• April 04, 2000, Christian Haase (TU Berlin): Perles at Bing's house [details]
• April 06, 2000, Christoph Ambühl: Offline list update is NP-hard [details]
• April 11, 2000, Christoph Ambühl: Offline list update is NP-hard [details]
• April 18, 2000, Micha Sharir (Tel-Aviv University): The k-set problem (I) [details]

May

• May 09, 2000, Christoph Ambühl: Offline list is NP-hard (II) [details]
• May 16, 2000, Michael Hoffmann: Pushing boxes is hard, even for infinite strength robots [details]
• May 23, 2000, Csaba Dávid Tóth: Illumination in the plane with line segment obstacles [details]
• May 23, 2000, Preda Mihailescu: Proving the Catalan conjecture [details]
• May 30, 2000, Uli Wagner: A continuous analogue of the upper bound theorem [details]

June

• June 06, 2000, Sven Schönherr: An efficient, exact, and generic quadratic programming solver for geometric optimization [details]
• Sunday, June 11, 2000, Tetsuo Asano (Japan Advanced Institute of Science & Technology): Digital Halftoning: From practice to theory [details]
• June 13, 2000, Matthias John: Using the Voronoi diagram to approximate normals of samples of curves and surfaces [details]
• June 27, 2000, Joachim Giesen: Sample-based modelling [details]

July

• July 04, 2000, Van Ha Vu (Microsoft): Separation of random points [details]
• July 06, 2000, Jiří Matoušek: Weak epsilon-nets in high dimensions [details]
• July 13, 2000, Udo Adamy: "Optimal triangulation and quadric-based surface simplification" by P. Heckbert and M. Garland [details]
• July 18, 2000, Marc van Kreveld (Utrecht University): Relaxed delaunay triangulations [details]

August

• August 08, 2000, Benny Chor (Technion, Israel): Constructing trees from quartets [details]

September

• September 28, 2000, Udo Adamy: New techniques for topologically correct surface reconstruction (joint work with Matthias John and Jochen Giesen) [details]

October

• October 12, 2000, Frank Vallentin: A Randomized (?) Algorithm for the Lattice Basis Problem [details]
• October 17, 2000, Hiroyuki Miyazawa: Numerical Methods for Pricing American Options [details]
• October 19, 2000, Alexander Below: Approximation for Minimum Triangulation of Convex Polyhedra (by F.Y.L.Chin, S.P.Y.Fung, C.A.Wang) [details]
• October 24, 2000, Micha Sharir (Tel Aviv University): New bounds on incidences [details]

November

• November 02, 2000, Tibor Szabó: Parity-town problems [details]
• November 14, 2000, Bernd Gärtner: Morris' Cube Orientations [details]
• November 16, 2000, Carsten Lange: Curvatures in Combinatorics? - A New Approach by Robin Forman [details]
• November 21, 2000, Christoph Ambühl: Fast Broadcastin and Gossiping in Radio Networks - Marek Chrobak, Leszek Gasieniec, Wojciech Rytter (FOCS 2000) [details]
• November 28, 2000, Falk Tschirschnitz: One graph and three conditions [details]
• November 30, 2000, Falk Tschirschnitz: One graph and three conditions (cont'd) [details]

December

• December 05, 2000, Matthias John: Algorithms for distance transformation [details]
• December 07, 2000, József Solymosi: Structure Theorems for Systems of Segments [details]
• December 12, 2000, Michael Hoffmann: More pushing blocks [details]

2001

January

• January 11, 2001, Gyula Károlyi (Eötvös University, Budapest): An  Erdős-Szekeres type problem in the plane [details]
• January 18, 2001, Udo Adamy: Randomized Greedy Hot-Potato Routing (Costas Busch, Maurice Herlihy, Roger Wattenhofer, SODA 00) [details]
• January 25, 2001, Sven Schönherr: "Brain-Matching" - A Medical Application [details]

February

• February 08, 2001, Johannes Blömer (Universität Paderborn): Security of Low Secret Key RSA [details]
• February 13, 2001, Jed Mihalisin (University of Washington): Polytopal Digraphs [details]
• February 22, 2001, Uli Wagner: News from Alon on Choice Numbers [details]
• Wednesday, February 28, 2001, Emo Welzl: Balanced Lines and Halving Triangles [details]

March

• Friday, March 02, 2001, Günter Rote (FU Berlin): Integer Programming in Low Dimensions [details]
• March 06, 2001, Lutz Kettner (Chapel Hill): 4D Voxel Data Visualizatio [details]
• March 08, 2001, Emo Welzl: Unique Sink Orientations of the Cube - Why? [details]
• March 13, 2001, Emo Welzl: Unique Sink Orientations of the Cube - Properties, and how to find the sink [details]
• March 15, 2001, Zsuzsanna Lipták: Broadcasting with Dynamic Byzantine Edge Faults [details]
• Friday, March 16, 2001, Bettina Speckmann: :Kinetic Collision Detection for Simple Polygons [details]
• March 20, 2001, Hiroyuki Miyazawa: A Randomized Algorithm for the Weighted Interval Selection Problem [details]
• March 22, 2001, Debjani Bhowmick (Regional Engineering College, Silchair, India): Inventory Modelling [details]
• March 27, 2001, Artur Andrzejak: Memory-Efficient Enumeration of Global States in a Distributed Computation (40 Minutes, no coffee-break) [details]

April

• April 03, 2001, Stefan Langerman (Rutgers University): Geometric Medians [details]
• April 05, 2001, Bernd Gärtner: Acyclic unique sink orientations [details]
• April 10, 2001, Joachim Giesen: :  Detecting Dimension from Discrete Data [details]
• Wednesday, April 11, 2001, Shmuel Onn (Technion - Israel Institute of Technology): Corner Cut Polyhedra and Groebner Bases of Point Configurations [details]
• April 12, 2001, Uli Wagner: Counting Corner Cuts [details]
• April 19, 2001, Falk Tschirschnitz: :Testing Extendability for Partial Chirotopes is NP-complete [details]
• April 24, 2001, György Elekes (Eötvös University, Budapest): Combinatorial Geometry and Additive Number Theory (Joint work with Imre Z. Ruzsa.) [details]
• April 26, 2001, Krzysztof Pietrzak: $opt=\overline{opt}$ is NP-complete; an $O(mn!n^3)$ Algorithm for the list update problem [details]

May

• May 03, 2001, György Elekes (Eötvös University, Budapest): Many Collinear Triples on Algebraic Curves (Joint work with Endre Szabó.) [details]
• May 08, 2001, Mirjam Tolksdorf: The Small World Phenomenon -- An Algorithmic Perspective (Jon Kleinberg, STOC 2000) [details]
• May 10, 2001, Zsuzsanna Lipták: Combinatorics of Weighted Sequences or: How to Identify Proteins without Sequencing Them [details]
• May 17, 2001, Pankaj Agarwal (Duke University): On the Number of Congruent Simplices in a Point Set [details]
• May 22, 2001, Oleg Pikhurko (Cambridge University): Size Ramsey Numbers and Integer Programming [details]
• May 29, 2001, Ingo Schurr: How model theory could help answering $P\neq NP$ [details]
• May 31, 2001, Lukas Finschi: Complete Combinatorial Generation of Small Point Configurations and Hyperplane Arrangements [details]

June

• June 07, 2001, Christoph Ambühl: Mean Payoff Games [details]
• June 12, 2001, Csaba Dávid Tóth: Binary Space Partitions for Line Segments with a Limited Number of Directions [details]
• June 14, 2001, József Solymosi: On a Generalization of Roth's Theorem [details]
• June 19, 2001, Vladlen Koltun (Tel Aviv University): Segment Intersection Searching Problems in General Settings [details]
• June 21, 2001, Matthias John: Power Crust - A New Surface Reconstruction Algorithm [details]
• June 26, 2001, Marc van Kreveld (Utrecht University): Smooth Generalization for Continuous Zooming [details]
• June 28, 2001, Marc van Kreveld (Utrecht University): Cutting and packing a country [details]

July

• July 03, 2001, Jürgen Richter-Gebert: Cinderella - The Next Generation. New Features and New Problems [details]
• July 05, 2001, Michel Stöcklin (with Philipp Gehr): Feature Detection from Samples [details]
• July 10, 2001, Michael Hoffmann: An Adaptable and and Extensible Geometry Kernel [details]
• July 12, 2001, Tibor Szabó: Triangle factors in pseudorandom graphs [details]
• July 17, 2001, Udo Adamy: Competitive Concurrent Distributed Queuing (M. Herlihy, S. Tirthapura, R. Wattenhofer, ACM Symposium on Principles of Distributed Computing) [details]

September

• September 11, 2001, Michael Krivelevich (Tel Aviv University): Deciding k-colorability in expected polynomial time [details]

October

• October 11, 2001, Tibor Szabó: Unique Sink Orientations of Cubes [details]
• October 16, 2001, Bettina Speckmann: Tight Degree Bounds for Pseudo-triangulations of Points [details]
• October 18, 2001, Bettina Speckmann: Kinetic Data Structures for Collision Detection [details]
• October 23, 2001, Michael Hoffmann: Segment Endpoint Visibility Graphs are Hamiltonian [details]
• October 30, 2001, Carsten Lange: On diameters of some simple polytopes - an approach by Robin Forman [details]

November

• November 06, 2001, Arnold Wassmer: Cyclic Polytopes and Their Symmetries [details]
• November 15, 2001, Pablo A. Parrilo (Institut für Automatik, ETH): Polynomial Optimization and Semidefinite Programming [details]
• November 20, 2001, Katharina Langkau (TU Berlin): Introduction to Dynamic Network Flows [details]
• November 27, 2001, Noga Alon (Tel Aviv University): Polynomials in Discrete Mathematics [details]

December

• December 04, 2001, Irene Müller: On Corner Cut Polytopes [details]
• December 11, 2001, Matthias Dreier: Univeral classes of hash functions (J. L. Carter and M. N. Wegman, J. Compt. Syst. Sci., 18 (1979) 143-154) [details]
• December 13, 2001, Juraj Skripsky: Kinetic Data Structures [details]
• December 18, 2001, Ingo Wegener (Universität Dortmund): Approximations by OBDDs [details]

2002

January

• January 08, 2002, Robert Simons: A very simple algorithm for estimating the number of k-colourings of a low-degree graph (Mark Jerrum, Random Struct. Algorithms 7, No.2, 157-165 (1995)) [details]
• January 10, 2002, Michael Balmer: Stable Husbands [details]
• January 15, 2002, Florian Schneider: Storing a Sparse Table with O(1) Worst Case Access Time (M.L.Fredman, J. Komlós and E. Szemerédi, J. ACM 31(3), 1984) [details]
• January 17, 2002, Heiko Vogler (Technische Universität Dresden): Tree Transducer with cost functions [details]
• January 22, 2002, Gábor Tardos: Distinct sums and distinct distances [details]
• January 24, 2002, Gyula Károlyi: Balanced 2-Colorings of Paths in Trees [details]
• January 29, 2002, Stefan Hilzinger: Resource augmentation for online bounded space bin packing (János Csirik and Gerhard J. Wöginger, ICALP 2000) [details]
• January 31, 2002, Miloš Stojaković: Limit Shape of Optimal Convex Lattice Polygons in the Sense of Different Metrics [details]

February

• February 07, 2002, Jaroslav Nesetril (Charles University, Prague): Ordering of Flows and Tensions [details]
• Friday, February 08, 2002, Susanne Albers (Freiburg University): Caching in Large Networks [details]
• Monday, February 11, 2002, Bernhard von Stengel (Department of Mathematics, London School of Economics and Political Science): Coordination in Game Trees [details]
• February 14, 2002, Ingo Schurr: Finding the Sink Takes Some Time [details]
• February 28, 2002, Joachim Giesen: Spectral Voronoi Clustering Works for Smooth Curve Reconstruction (Diploma Thesis of Papik Meli) [details]

March

• March 12, 2002, Michael Hoffmann: Alternating paths among disjoint line segments [details]
• March 14, 2002, Alexander Below: Prescribing Shapes of Faces of Polytopes [details]
• March 26, 2002, Micha Sharir (Tel Aviv University): Incidences between Points and Circles in Higher Dimensions and Their Applications [details]
• Wednesday, March 27, 2002, Marc van Kreveld (Utrecht University): Sweeping nicely through polyhedra and polygons [details]
• March 28, 2002, Micha Sharir (Tel Aviv University): What Vladlen and I were working on in Zurich last year [details]

April

• April 02, 2002, Csaba Dávid Tóth: From Distinct Distances to Isosceles Triangles [details]
• April 04, 2002, Joachim Giesen: Flow Diagrams - A Data Structure for Geometric Modeling - Part I [details]
• Friday, April 05, 2002, Alexander Below: Prescribing Shapes of Faces of Polytopes - The Saga Continues [details]
• April 09, 2002, Joachim Giesen: Flow Diagrams - A Data Structure for Geometric Modeling - Part II [details]
• April 11, 2002, Matthias John: Flow Diagrams - A Data Structure for Geometric Modeling - Part III [details]
• April 16, 2002, Matthias John: Flow Diagrams - A Data Structure for Geometric Modeling - Part IV [details]
• April 18, 2002, Udo Adamy: Call Control in Chains (joint work with Christoph Ambühl, R. Sai Anand, and Thomas Erlebach) [details]
• Friday, April 19, 2002, Christoph Ambühl: Call Control in Rings (joint work with Udo Adamy, R. Sai Anand, and Thomas Erlebach) [details]
• April 25, 2002, Bettina Speckmann: Allocating Vertex pi-guards in Simple Polygons via Pseudo-Triangulations. [details]
• Friday, April 26, 2002, Falk Tschirschnitz: Admissible grid orientations as example for extendable partial chirotopes. [details]

May

• Friday, May 03, 2002, Günter Rote (Freie Universität Berlin): Locked linkages and rigidity of self-touching frameworks. [details]
• May 07, 2002, Uli Wagner: The CLIQUE Problem in Intersection Graphs of Ellipses [details]
• May 14, 2002, Alex Brodsky (University of British Columbia): On the Complexity of Buffer Allocation in Message Passing Systems (45 min) [details]
• Wednesday, May 15, 2002, Josep Diaz (Universitat Politecnica de Catalunya): Bisection of Random Cubic graphs [details]
• May 21, 2002, Tibor Szabó: Transversals with Bounded Components, I [details]
• May 28, 2002, Michael Hoffmann: PushPush [details]
• May 30, 2002, Tibor Szabó: Transversals with Bounded Components, II [details]

June

• June 04, 2002, Yoshio Okamoto: Traveling salesman games with the Monge property [details]
• June 06, 2002, Aaron Zollinger: Towards a Theory of Peer-to-peer Computability [details]
• June 11, 2002, Uli Wagner: On Rectilinear Crossing Numbers of Complete Graphs [details]
• June 18, 2002, Friedhelm Meyer auf der Heide (Universität Paderborn): The randomized z-buffer algorithm [details]
• June 20, 2002, Emil Müller: RUSH HOUR is PSPACE-complete [details]
• June 25, 2002, Res Völlmy: Point set surfaces [details]
• June 27, 2002, Lisa von Boehmer: Squashed Cubes [details]

July

• July 02, 2002, Christof Marti: Improved Sorting Networks [details]
• July 04, 2002, Miloš Stojaković: On restricted min-wise independence of permutations [details]
• Friday, July 05, 2002, Mordecai J. Golin (Hong Kong University of Science and Technology): The Probabilistic Complexity of the Voronoi Diagram of Points on a Polyhedron [details]
• July 23, 2002, Komei Fukuda (McGill University): From the Zonotope Construction to the Minkowski Addition of Convex Polytopes [details]

August

• August 22, 2002, Ingo Schurr: Not enough boxes for all the colors [details]
• August 29, 2002, Bernd Gärtner: Linear Programming via Unique Sinks [details]

September

• September 03, 2002, Uli Wagner: On weak epsilon-nets for convex sets [details]
• September 05, 2002, József Solymosi: On structures of point-line systems with many incidences [details]
• September 12, 2002, Bettina Speckmann: Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons [details]
• September 17, 2002, Pavel Valtr (Charles University, Prague): On the maximum number of unit distances among n points on a sphere. [details]
• September 19, 2002, Pavel Valtr (Charles University, Prague): The maximum number of unit distances for planar point sets in convex position, and extremal questions for convex geometric graphs [details]

October

• October 01, 2002, Dmitry Kozlov (KTH Stockholm/Universität Bern): The geometry of coin-weighing problems [details]
• October 03, 2002, Péter Csorba: Notes on the Index of the Join of Topological Spaces [details]
• October 15, 2002, Emo Welzl: Sorting in a mesh (or what Adi Shamir told me), I [details]
• October 17, 2002, Emo Welzl: Sorting in a mesh (or what Adi Shamir told me), II [details]
• October 22, 2002, Bettina Speckmann: Convexity minimizes pseudotriangulations [details]
• October 24, 2002, Michael Farber (Tel Aviv University): Algebraic Topology and Robot Motion Planning [details]
• October 29, 2002, Yoshio Okamoto: Matroid Representation of Clique Complexes [details]
• October 31, 2002, Kaspar Fischer: MINIBALL and the distance to the convex hull [details]

November

• November 05, 2002, Yoshio Okamoto: Submodular-type optimization on abstract convex geometries [details]
• November 07, 2002, Uli Wagner: Convex Quadrilaterals and j-Edges, Part I [details]
• November 12, 2002, Uli Wagner: Convex Quadrilaterals and j-Edges, Part II [details]
• November 14, 2002, Martin Kutz (FU Berlin): News from Angel and Devil [details]
• November 19, 2002, Falk Tschirschnitz: The Holt-Klee condition is insufficient for LP-cubes. (W. Morris), Part I [details]
• November 21, 2002, Ferdinando Cicalese (University of Salerno): For Pinocchio La Vita NON e' Bella [details]
• November 26, 2002, Falk Tschirschnitz: The Holt-Klee condition is insufficient for LP-cubes. (W. Morris), Part II [details]
• November 28, 2002, Tibor Szabó: Turan's Theorem in sparse random graphs [details]

December

• December 03, 2002, Ingo Schurr: Nearly no linear programs on cubes [details]
• December 05, 2002, Fabio Roncoroni: Similarity Search in High Dimensions via Hashing [A.Gionis, P.Indyk, and R.Motwani] [details]
• December 10, 2002, Fabian Chudak (IFOR): Approximation algorithms for facility location problems [details]
• December 12, 2002, Péter Csorba: Chromatic Number and Simplicial Complexes [details]
• December 17, 2002, Diana Senn: A Combinatorial Proof of Kneser's Conjecture [details]

2003

January

• January 09, 2003, Yoshio Okamoto: The affine representation theorem for abstract convex geometries [details]
• January 14, 2003, Melanie Raemy: PRIMES is in P, Part 1 [details]
• January 16, 2003, Melanie Raemy: PRIMES is in P, Part 2 [details]
• January 21, 2003, Ron Aharoni (Technion): Independent Systems of Representatives [details]
• January 23, 2003, Victor Götsch: Efficient Partition Trees [details]
• January 28, 2003, József Beck (Rutgers University/ETH): A geometric problem: How to represent a complicated picture on a small square-lattice? [details]

February

• February 04, 2003, Thomas Tscherrig: The Van den Berg-Kersten Conjecture [details]
• February 06, 2003, Marc van Kreveld (Utrecht University): Composable Art and Combinatorics [details]
• Friday, February 07, 2003, Jiří Matoušek (Charles University, Prague): Crossing Number and Small Nonplanar Subgraphs [details]
• February 11, 2003, Michael Krivelevich (Tel Aviv University): Turan Numbers of Bipartite Graphs and Related Questions [details]
• February 13, 2003, Oswin Aichholzer (TU Graz): Playing with Triangulations [details]
• February 25, 2003, Joachim Giesen: Support Vector Machines - Hype or Halleluja? [details]
• February 27, 2003, Ingo Schurr: All linear programs on cross polytopes in one talk [details]

March

• March 06, 2003, Riko Jacob (LMU München): Amortized Optimal Dynamic Planar Convex Hull by Querying [details]
• March 11, 2003, Emo Welzl: 3-Coloring of Graphs by Educated Guesses [details]
• March 13, 2003, Michael Hoffmann: Semi-Dynamic Planar Convex Hull [details]
• March 18, 2003, Udo Adamy: The Local Ratio Technique [details]
• March 20, 2003, Gyula Károlyi (Eötvös University, Budapest): The Erdős-Heilbronn Problem in Abelian Groups [details]
• March 25, 2003, David Basin: Automated Complexity Analysis Based on Ordered Resolution [details]
• March 27, 2003, Csaba Dávid Tóth (University of California, Santa Barbara): Total latency and selfish behavior in P2P data-sharing [details]

April

• April 01, 2003, Tibor Szabó: Independent transversals in r-partite graphs [details]
• April 03, 2003, Arnold Wassmer: The Hom Complex [details]
• April 08, 2003, Yoshio Okamoto: A short introduction to the fair cost allocation from combinatorial optimazation problems [details]
• April 10, 2003, Kaspar Fischer: Smallest enclosing balls in high dimensions [details]
• April 17, 2003, Falk Tschirschnitz: One line and n points in 3D [details]
• April 22, 2003, Penny Haxell (University of Waterloo): Strong coloring and related problems [details]
• April 24, 2003, Zvi Lotker (Tel Aviv University): Conflict-free coloring of simple geometric regions [details]
• Friday, April 25, 2003, Zvi Lotker (Tel Aviv University): Distributed MST for Constant Diameter Graphs [details]
• April 29, 2003, Heiner Ackermann: A simple approximation algorithm for the weighted matching problem [details]

May

• May 06, 2003, Grzegorz Rozenberg (Leiden Center for Natural Computing, The Netherlands): Models of Molecular Computing - Formal Models for Gene Assembly [details]
• May 08, 2003, Carsten Lange (TU Berlin): Anisotropic Fairing of Point Sets [details]
• May 15, 2003, Miloš Stojaković: Games on Random Graphs [details]
• Monday, May 19, 2003, Baruch Awerbuch (Johns Hopkins University): Reducing Truth-telling Online Mechanisms to Online Optimization [details]
• May 20, 2003, Tommi Lindgren: Linear Programming, the Simplex Algorithm, and Simple Polytopes
  (Gil Kalai, Math. Prog. (Ser. B) 79 (1997), 217-234) [details]
• May 22, 2003, Matthias John: Contour Trees [details]
• May 27, 2003, Péter Csorba: On the n-in-a-row game [details]

June

• June 03, 2003, Uli Wagner: Shape Dimension and Intrinsic Metric from Samples of Manifolds [details]
• June 05, 2003, Johannes Schneider: Segmentation Problems [details]
• June 12, 2003, Thomas Bietenhader: An easy way to teach interior-point methods (Tamas Terlaky, European Journal of Operational Research 130 (2001) pp. 1-19.) [details]
• Monday, June 16, 2003, Jiří Matoušek (Charles University, Prague): A Briefing on Dimension Reduction [details]
• June 17, 2003, Hagit Attiya (Technion): Distributed Algorithms that Adapt to Contention [details]
• Wednesday, June 18, 2003, Dmitry Kozlov (KTH Stockholm/Universität Bern): Topological obstructions to graph colorings [details]
• June 19, 2003, Nina Amenta (University of California, Davis): Incremental constructions con BRIO [details]
• Monday, June 23, 2003, Nina Amenta (University of California, Davis): Voronoi Diagrams of Balls [details]
• June 24, 2003, Walter Morris (George Mason University, Fairfax, Virginia): Regular crosspolytope-subdivisions and LP-orientations of cubes [details]

July

• July 03, 2003, József Solymosi (UC San Diego): Products and Incidences [details]
• July 15, 2003, Csaba Dávid Tóth (UC Santa Barbara): Alternating Paths along Orthogonal Segments [details]
• July 17, 2003, Subhash Suri (UC Santa Barbara): A Peer Matching Game [details]

September

• September 02, 2003, Dirk Nowotka (Turku University, Finland): Periodicity and Unbordered Words [details]
• September 09, 2003, Johannes Fischer (Albert-Ludwigs-Universität Freiburg): Version Spaces in Constraint-Based Data Mining [details]
• September 16, 2003, Heiko Vogler (TU Dresden): A Kleene Theorem for Weighted Tree Automata [details]
• September 23, 2003, Vinayak Pandit (IBM India): Local Search Heuristics for k-median, and facility location problems [details]

October

• October 07, 2003, Yoshio Okamoto: Tetris is Hard, even to Approximate [details]
• October 09, 2003, Sonoko Moriyama (The University of Tokyo): Analyze the Structure of all Shellings by h-Assignments [details]
• October 14, 2003, Michael Krivelevich (Tel Aviv University): List Coloring of Graphs [details]
• October 21, 2003, Tibor Szabó: Maker/Breaker games on the complete graph [details]
• October 23, 2003, Yoshio Okamoto: Local topology of the free complex of a two-dimensional generalized convex shelling [details]
• October 28, 2003, Ingo Schurr: Coloring the Plane and the Axiom of Choice [details]
• October 30, 2003, Udo Adamy: On-line Coloring of Intervals with Bandwidths [details]

November

• November 04, 2003, Udo Adamy: Maximum Weight Independent Set of Axis-parallel Rectangles [details]
• November 06, 2003, Stefanie Gerke: Random Planar Graphs [details]
• November 11, 2003, Kaspar Fischer: Khachiyan's method to approximate the smallest enclosing ellispoid [details]
• November 13, 2003, Ingo Schurr: Linear Programming via Unique Sinks - The Business Class [details]
• November 18, 2003, Werner Unterhofer: Effiziente Berechnung von gewichtsminimalen perfekten Matchings in bipartiten Graphen [details]
• November 20, 2003, Markus Bläser: The Multicast Cost-Sharing Problem [details]
• November 25, 2003, Michael Hoffmann: Pointed Encompassing Trees [details]
• November 27, 2003, Nico Kruithof (Uni Groningen): Approximation by Skin Surfaces [details]

December

• December 02, 2003, Patrick Jenny (ETH Zürich): Joint Probability Density Function Modeling for Turbulent Flow [details]
• December 04, 2003, Eva Schuberth (Universität Passau): Formale Spezifikation von Software-Architektur [details]
• December 09, 2003, Simone Croci: Approximate Local Search in Combinatorial Optimization [details]
• December 16, 2003, Péter Csorba: Coloring Graphs and Stiefel Manifolds? [details]
• December 18, 2003, Alex Souza-Oftermatt: Job Scheduling [details]

2004

January

• January 13, 2004, Dieter Mitsche: The Hidden Cluster Problem [details]
• January 15, 2004, Simon Spalinger: Supervised Learning of Preference Relations [details]
• January 20, 2004, Miloš Stojaković: Positional Games on Random Graphs [details]
• January 22, 2004, Julian Lorenz: Geometric Clustering Problems [details]
• January 27, 2004, Bettina Speckmann (TU Eindhoven): The Zigzag Path of a Pseudo-Triangulation [details]
• January 29, 2004, Leo Rüst: Unique Sink Orientations on Grids [details]

February

• February 03, 2004, Sandra Roost: Seventeen lines and one-hundred-and-one points [details]
• February 05, 2004, Jan Rihak: Normalized Cuts and Image Segmentation [details]
• February 10, 2004, Robert Berke: Graphs with the Turan Property [details]
• February 12, 2004, Yoshio Okamoto: A solution to the Furedi-Hajnal conjecture by Marcus & Tardos [details]
• February 17, 2004, Alexander Hall: Flows over Time [details]
• February 19, 2004, Shankar Ram Lakshminarayanan: On the Number of Minimum Cuts in a Graph [details]
• February 24, 2004, Konstantinos Panagiotou: Vector Quantization [details]

March

• March 04, 2004, Shakhar Smorodinsky: On Locally Delaunay Geometric Graphs [details]
• March 11, 2004, Jan Remy: Online Construction of Minimum Spanning Trees in Random Weighted Graphs [details]
• March 16, 2004, Uli Wagner (Charles University, Prague): On Halving Simplices in 4 Dimensions (Part I) [details]
• March 18, 2004, Uli Wagner (Charles University, Prague): On Halving Simplices in 4 Dimensions (Part II) [details]
• Friday, March 19, 2004, Marc Nunkesser: An algorithmic view on OVSF code assignment [details]
• March 23, 2004, Zsolt Katona (Eötvös Lorand University, Budapest): Width of a scale-free tree [details]
• March 30, 2004, Ingo Schurr: Height of bottom-antipodal trees [details]

April

• April 01, 2004, Christian Wenz: Mick Might Get Some (But You Can't Always Get What You Want) [details]
• April 06, 2004, Yoshio Okamoto: The traveling salesman problem with few inner points [details]
• April 13, 2004, Andreas Paffenholz (TU Berlin): New Polytopes derived from Products [details]
• April 15, 2004, Markus Bläser: Approximation algorithms for Max-ATSP with distances zero and one [details]
• April 20, 2004, Michael Hoffmann (2) (University of Leicester): Efficient Update Strategies for Geometric Computing with Uncertainty [details]
• April 22, 2004, Simon Spalinger: Support Vector Clustering [details]
• April 27, 2004, Anusch Taraz (HU Berlin): Large planar subgraphs in dense graphs [details]
• April 29, 2004, Gyula Károlyi (Eötvös University): Erdős-Szekeres theorem with forbidden order types [details]

May

• May 04, 2004, Andreas Weissl: On the number of labelled planar graphs with n nodes and qn edges [details]
• May 06, 2004, Justus Schwartz: Average case complexity of the shortest path problem in sparse graphs [details]
• May 11, 2004, Stefanie Gerke: Sparse epsilon-regular pairs [details]
• May 13, 2004, Martin Marciniszyn: Ramsey games [details]
• May 18, 2004, Johann A. Makowsky (Technion, Haifa and ETH Zürich): Algorithms for SAT and #SAT for formulas of bounded tree width and clique width [details]
• May 27, 2004, Pavel Valtr (Charles Univ., Prague): Strictly convex norms allowing many unit distances [details]
• Friday, May 28, 2004, Carsten Lange (TU Berlin): On generalised Kneser colouring theorems [details]

June

• June 01, 2004, Pavel Valtr (Charles Univ., Prague): Open caps and cups in planar point sets [details]
• June 03, 2004, Yoshio Okamoto: Core Stability of Minimum Coloring Games [details]
• June 08, 2004, Andreas Meyer: An Introduction to Bilinear Complexity Theory and on a new Approach using Geometric Invariant Theory [details]
• June 10, 2004, Petr Škovroň (Charles Univ.): Abstract Models of Optimization Problems [details]
• June 15, 2004, Dieter Mitsche: Reconstructing a Large Clique in a Random Graph [details]
• June 17, 2004, Stefano Tessaro: Fast Integer Programming in Fixed Dimension [details]
• Friday, June 18, 2004, Jiří Matoušek (Charles Univ.): Simplex Reptiles Could Help the Net Police, But Probably They Do Not Exist [details]
• June 22, 2004, Moshe Lewenstein (Bar Ilan Univ.): Peeling Codes with Applications to Finding Witnesses [details]
• June 24, 2004, Takeaki Uno (National Institute of Informatics (NII): Efficient Maximal Clique Enumeration and its Application to Frequent Set Mining Problem [details]
• June 29, 2004, Nagabhushana Prabhu (Purdue University): :The Hirsch Conjecture [details]

July

• July 01, 2004, Csaba Dávid Tóth (U. of California at Santa Barbara): Binary space partitions of orthogonal subdivisions [details]
• July 06, 2004, Julian Lorenz: Concise Representations for Frequent Itemsets [details]
• July 13, 2004, Shakhar Smorodinsky: On Conflict-Free Colorings [details]
• July 15, 2004, Moritz Maaß (TU München): An Average-Case Analysis of Trie Searching with Mismatches [details]
• July 20, 2004, Alessandro Panconesi (La Sapienza, U. di Roma): How to Distribute ConDoms Cheaply [details]
• July 27, 2004, Volker Kaibel (TU Berlin): Low-dimensional faces of random 0/1-polytopes [details]

August

• August 17, 2004, Peter Bürgisser (Univ. Paderborn): The complexity of counting in semialgebraic geometry [details]
• August 31, 2004, József Balogh (The Ohio State Univ.): The Klee-Minty random edge chain moves with linear speed [details]

September

• September 23, 2004, Micha Sharir (Tel Aviv Univ.): On Empty Convex Polygons in a Planar Point Set [details]
• September 28, 2004, Michael Hoffmann: Chordless Paths and Cycles [details]

October

• October 12, 2004, Alex Souza-Oftermatt: Recent Progress in Stochastic Knapsack [details]
• October 14, 2004, Alexander Gloye (FU Berlin): FU FIGHTERS - An Adaptive Multilayered Platform for Soccer Playing Autonomous Mobile Robots [details]
• October 19, 2004, Gabor Szabó: Joint Base Station Scheduling [details]
• October 21, 2004, Alexander Engström (KTH Stockholm): Evasive Graph Properties [details]
• October 26, 2004, Sonja Čukić (KTH Stockholm): Topological Properties of Complexes of Graph Homomorphisms [details]
• October 28, 2004, Shakhar Smorodinsky: A Survey about Geometric Permutations [details]

November

• November 02, 2004, Kazuhisa Makino (Osaka Univ.): On Computing all Abductive Explanations from a Propositional Horn Theory [details]
• November 04, 2004, Gyula Károlyi (Eötvös Lorand Univ.): Squares in arithemtic progressions [details]
• November 09, 2004, Michael Krivelevich (Tel Aviv Univ.): Sphere packing in Rⁿ through Graph Theory [details]
• November 11, 2004, Tibor Szabó: RandomEdge can be Mildly Exponential on Abstract Cubes [details]
• November 16, 2004, Dirk Schlatter: Spanning subgraphs of random graphs [details]
• Wednesday, November 17, 2004, László Lovász (Microsoft Corporation and Eötvös Univ.): The distance of two graphs [details]
• November 18, 2004, Yoshio Okamoto: Brief introduction to the submodular function minimization problem [details]
• November 23, 2004, Leo Rüst: Ladders [details]
• Wednesday, November 24, 2004, Yoshio Okamoto: Brief introduction to the submodular function minimization problem (Part II) [details]
• November 25, 2004, Miloš Stojaković: Coloring Octrees [details]
• November 30, 2004, Robert Berke: Relaxed Two-Coloring on Graphs [details]

December

• December 02, 2004, Georgios Mertzios (TU München): The Fixed-Parameter Cluster-Detecting Problem and applications [details]
• December 07, 2004, Konstantinos Panagiotou: Coloring the Random Graph [details]
• December 09, 2004, Péter Csorba: On box complexes [details]
• December 14, 2004, Mihyun Kang (HU Berlin): The Asymptotic Number of Outerplanar Graphs [details]
• December 16, 2004, Kaspar Fischer: More convex programs in subexponential time [details]
• December 21, 2004, Claudia Käppeli: Maximum Matchings via Gaussian Elimination [details]

2005

January

• January 11, 2005, Christopher Portmann: Maximum satisfiability: How good is tabu search in the worst-case? [details]
• January 13, 2005, Mathias Schacht (HU Berlin): Discrepancy and Eigenvalues of Cayley Graphs [details]
• January 18, 2005, Dejan Dukaric: The Pancake Problem [details]
• January 20, 2005, Raphael Meyer: Cooperative Facility Location Games [details]
• Friday, January 21, 2005, Erik D. Demaine (MIT): Origami, Polyhedra, and Linkages: Folding with Algorithms [details]
• Monday, January 24, 2005, Nir Halman (Technion, Haifa): On the Power of Discrete Helly Theorems and Lexicographic Helly Theorems [details]
• January 25, 2005, Raphael Boog: An Approximation Scheme for Makespan Scheduling with Capacity Constraints [details]
• January 27, 2005, Andreas Streich: A new short proof of Kneser's conjecture [details]

February

• February 01, 2005, Eva Schuberth: What colors have to do with geometry: the gamut mapping project [details]
• February 03, 2005, Penny Haxell (Univ. of Waterloo): Ramsey numbers for hypergraph cycles [details]
• Monday, February 07, 2005, Jochen Abhau (Univ. Bonn): The Homology of Moduli Spaces of Riemann Surfaces - Calculations for Genus g [details]
• February 08, 2005, Johann A. Makowsky (Technion, Haifa): What did Tarski mean with "elementary Geometry is decidable"? [details]
• February 10, 2005, Christoph Ambühl (Istituto Dalle Molle di Studi sull' Intelligenza Artificiale, Lugano): Minimum spanning trees in the unit disk [details]
• February 15, 2005, Bartosz Przydatek: Solving Medium-Density Subset Sum Problems in Expected Polynomial Time [details]
• February 17, 2005, Reto Spöhel: Online graph avoidance games in random graph [details]
• February 22, 2005, Abraham Flaxman (Carnegie Mellon Univ.): Two stage stochastic programming on average: Minimum Spanning Trees [details]

March

• March 01, 2005, Johann A. Makowsky (Technion, Haifa): Iteration Graphs and their Polynomials [details]
• March 08, 2005, Lars Engebretsen (KTH Stockholm): Some of Håstad's optimal inapproximability results [details]
• March 10, 2005, Jan Remy: Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems [details]
• March 17, 2005, Nikolay Dichev (TU München): Nonadaptive Search With a Lie [details]
• March 22, 2005, Shankar Ram Lakshminarayanan: Metric Traveling Salesman Games [details]
• March 24, 2005, Elias Vicari: Off-Diagonal Ramsey Numbers [details]
• March 29, 2005, Tibor Szabó: The Discrepancy Game [details]
• March 31, 2005, Michael Hoffmann: Degree Bounds for Constrained Pseudo-Triangulations [details]

April

• April 05, 2005, Piotr Krysta (Univ. Dortmund): Approximate Utilitarian Mechanism Design via Primal-Dual Method [details]
• April 07, 2005, Kevin Buchin (FU Berlin): Incremental Construction along Space-Filling Curves [details]
• April 12, 2005, Maike Buchin (FU Berlin): Semi-Computability of the Fréchet Distance between Surfaces [details]
• April 14, 2005, Justus Schwartz: Fast Algorithms for Weighted Bipartite Matching [details]
• April 19, 2005, Dan Hefetz (Tel Aviv Univ.): Avoider-Enforcer games [details]
• Wednesday, April 20, 2005, Nick Wormald (Univ. of Waterloo): Birth control for giants [details]
• April 21, 2005, Uwe Schöning (Univ. Ulm): Quest for the fastest SAT algorithm [details]
• Friday, April 22, 2005, Uli Wagner (Einstein Inst. of Mathematics, The Hebrew Univ. of Jerusalem): k-Sets and Topological Invariants of Plane Curves [details]
• April 28, 2005, Emo Welzl: On the Number of Crossing-Free Geometric Graphs (Triangulations) [details]

May

• May 03, 2005, Jozef Skokan (Univ. of Illinois at Urbana-Champaign and Univ. de São Paulo): On a theorem of Luczak [details]
• Friday, May 06, 2005, Shakhar Smorodinsky (Courant Inst., New York Univ.): On the Chromatic Number of Some Geometric Hypergraphs [details]
• May 10, 2005, János Barát (TU Lyngby): The slope parameter of graphs [details]
• Wednesday, May 11, 2005, Leonhard Vogt: A Tabu Search Algorithm for the Single Vehicle Routing Allocation Problem [details]
• May 12, 2005, Martin Aigner (FU Berlin): Pancake Problems [details]
• May 17, 2005, Malwina Luczak (London School of Economics and Political Science): On the maximum queue length and asymptotic distributions in the supermarket model [details]
• May 19, 2005, Leo Rüst: Simple Stochastic Games via P-matrix Linear Complementarity Problems [details]
• Monday, May 23, 2005, Marc Noy (Univ. Politècnica de Catalunya): The number of planar graphs and properties of random planar graphs [details]
• May 24, 2005, András Recski (Budapest Univ. of Technology and Economics): Some applications of combinatorial optimization in statics [details]
• May 26, 2005, Gyula Károlyi (Eötvös Lorand University): Set addition in noncommutative groups [details]
• May 31, 2005, Stefan Birrer: Tutte's Spring Theorem [details]

June

• June 02, 2005, Emo Welzl: On the Number of Crossing-Free Geometric Graphs [details]
• June 07, 2005, Andreas Meyer: Geometric Complexity Theory: The Bilinear Case [details]
• June 09, 2005, Christian Borgs (Microsoft Research & Univ. of Washington): Proof of the local REM conjecture for number partitioning [details]
• June 14, 2005, Ron Aharoni (Technion, Haifa): The Erdős-Menger Conjecture [details]
• Wednesday, June 15, 2005, Edgar Ramos (Univ. of Illinois at Urbana-Champaign): Manifold Reconstruction from Point Samples [details]
• Wednesday, June 15, 2005, Pankaj Agarwal (Duke University): Optimal Coresets for Approximating the Extent of Shallow Levels [details]
• June 16, 2005, Vijay Victor D'Silva: The Topological Structure of Asynchronous Computability [details]
• June 21, 2005, Csaba Dávid Tóth (MIT): A vertex-face assignment for plane graphs [details]
• Wednesday, June 22, 2005, Patrick Müller: General lexicographic shellability [details]
• June 23, 2005, Jiří Matoušek (Charles Univ.): New badly embeddable spaces (presenting work of Subhash Khot and Assaf Naor) [details]
• June 28, 2005, Manuel Huber: Algorithmic Aspects of Szemerédi's Regularity Lemma [details]
• Wednesday, June 29, 2005, Vera Vértesi: Identities in Algebras [details]
• June 30, 2005, Florin Oswald: Popular Matchings [details]

July

• Wednesday, July 06, 2005, Bettina Speckmann (TU Eindhoven): On Rectangular Cartograms [details]
• July 07, 2005, Maike Buchin (FU Berlin): Minimizing the Total Absolute Gaussian Curvature in a Terrain is Hard [details]
• July 07, 2005, Kevin Buchin (FU Berlin): The Flow Complex: General Structure and Algorithm [details]
• July 07, 2005, Yoshio Okamoto (Toyohashi University of Technology): All-pairs shortest paths with real weights in O(n³ /log n) time [details]
• July 12, 2005, Florian Block: Tropical Convexity via Cellular Rsolutions [details]
• July 14, 2005, Shankar Ram Lakshminarayanan: Approximation algorithm for Maximum 3-Cycle cover problem [details]
• July 19, 2005, Hans-Martin Will: Challenges and Opportunities in the Post-Genome Era - An Introduction to Functional Genomics and Proteomics [details]
• July 21, 2005, Masashi Kiyomi (National Institute of Informatics (NII): Efficient Algorithms for the Electric Power Transaction Problem [details]
• July 26, 2005, Takeaki Uno (National Institute of Informatics (NII): Tree Enumeration Algorithms [details]

August

• August 04, 2005, L. Shankar Ram: The Traveling Salesman Problem with Distances One and Two [details]
• August 11, 2005, Martin Marciniszyn: A Probabilistic Counting Lemma for Complete Graphs [details]
• August 18, 2005, Mutsunori Yagiura (Kyoto University): Exact Algorithms for Two-Dimensional Strip Packing Problems [details]
• Monday, August 22, 2005, Naveen Garg (IIT New Delhi): A faster algorithm for computing the Held-Karp bound [details]
• August 23, 2005, Karl Lieberherr (Northeastern Univ., Boston): Algorithmic Problems Related to the Tyranny of the Dominant Decomposition [details]

September

• September 01, 2005, Dominik Scheder (Univ. of Colorado at Boulder): Finding highly connected subgraphs of low weight [details]
• September 15, 2005, Elias Vicari: Communication Complexity in the Algebraic Model [details]
• September 20, 2005, Volker Roth: Feature Selection in Unsupervised Clustering: Applications in Computer Vision and Bioinformatics [details]
• Wednesday, September 21, 2005, Michael Krivelevich (Tel Aviv Univ.): Property testing in graphs of general density [details]
• September 22, 2005, József Beck (Rutgers Univ.): Every finite point set in the plane is a Weak Winner! [details]
• September 27, 2005, Florian Jug: Computer aided information processing in the Structuralism [details]

October

• October 04, 2005, Joshua Cooper (Courant Institute, NYU and ETH Zürich): What keeps me up at night [details]
• October 06, 2005, Joachim Giesen: Critical Point Theory of the Distance to a Point Sample and Applications in Geometric Modeling [details]
• Friday, October 07, 2005, Mitsuo Motoki (Japan Advanced Institute for Science and Technology): Test Instance Generation for MAX 2SAT [details]
• October 11, 2005, Ken Satoh (National Institute of Informatics, Japan): Enumerating Minimally Revised Specifications using Dualization [details]
• Wednesday, October 12, 2005, Micha Sharir (Tel Aviv Univ.): On the ICP algorithm [details]
• October 13, 2005, Bodo Manthey (Univ. Lübeck): Restricted cycle covers [details]
• October 18, 2005, Berit Johannes: Earliest Start Time Scheduling in AND/OR-graphs - An Introduction [details]
• October 20, 2005, Joshua Cooper (Courant Inst., NYU and ETH Zürich): Missing induced subgraphs [details]
• October 25, 2005, Ryuhei Uehara (Japan Advanced Institute of Science and Technology): Efficient Algorithms for the Longest Path Problem [details]
• October 27, 2005, Jozef Skokan (Univ. of Illinois at Urbana-Champaign and Univ. de São Paulo): Generalized Turán Theorem [details]

November

• November 01, 2005, Alexander Engström: Playing with independent sets [details]
• November 03, 2005, Ulrike von Luxburg (Fraunhofer IPSI, Darmstadt): Convergence of random graph Laplacians [details]
• November 08, 2005, Konstantinos Panagiotou: Performance Measures for Paging [details]
• November 10, 2005, Alex Souza-Oftermatt: A New Lower Bound for Paging [details]
• November 15, 2005, Andreas Razen: Counting satisfying 2SAT Assignments [details]
• November 17, 2005, Dirk Schlatter (HU Berlin): The random planar graph process [details]
• November 17, 2005, Leonidas Guibas (Stanford Univ.): Structure from Proximity in Point Data [details]
• November 22, 2005, Graham Brightwell (London School of Economics): Non-transitive sets of dice [details]
• November 24, 2005, Emo Welzl: Random Triangulations of Point Sets [details]
• November 29, 2005, Rüdiger Schultz (Univ. Duisburg): Risk Aversion in Stochastic Integer Programming: Models and Algorithms [details]

December

• December 01, 2005, Takeaki Uno (National Institute of Informatics (NII): Enumerating Dense Subgraphs [details]
• December 06, 2005, Andreas S. Schulz (MIT and ETH Zürich): How many diamonds can be packed in a Chinese checkerboard? [details]
• December 08, 2005, Patrick Müller: Map coloring and the vector cross product [details]
• December 13, 2005, Rahul Savani (London School of Economics): Hard-to-Solve Bimatrix Games [details]
• December 15, 2005, Bernhard von Stengel (London School of Economics): Strategic characterization of the index of an equilibrium [details]
• December 20, 2005, Robert Berke: Testing Relaxed Two-Colorability [details]
• December 22, 2005, Florian Walpen: Boosted Sampling: Approximation Algorithms for Stochastic Optimization [details]

2006

January

• January 10, 2006, Maria Chudnovsky (Princeton Univ./CMI): Testing for a theta [details]
• January 12, 2006, Samuel Zürcher: On 0-1-matrices and small excluded submatrices [details]
• Monday, January 16, 2006, Kiyohito Nagano (Univ. of Tokyo): A strongly polynomial algorithm for line search in submodular polyhedra [details]
• January 17, 2006, Eric Fusy (Ecole Polytechnique, Palaiseau Cedex): Random generation of combinatorial structures using Boltzmann samplers [details]
• January 19, 2006, Mirco Fröhlicher: An Algorithm for Segment-Dragging [details]
• January 24, 2006, Christian Balderer: A simple approximation algorithm for Connected Facility Location [details]
• January 26, 2006, Thomas Bruderer: Comparing Top k Lists [details]
• January 31, 2006, Takeaki Uno (National Institute of Informatics (NII): Maximization Problem of Intersection of Polytopes [details]

February

• February 02, 2006, Andreas S. Schulz (MIT and ETH Zürich): Sometimes some NP-hard problems can be solved in polynomial time [details]
• February 07, 2006, Joachim Giesen: Conformal Alpha Shapes [details]
• February 09, 2006, Michael Mascagni (The Florida State Univ. and ETH Zürich): Random Number Generation: A Practitioner's Overview [details]
• February 14, 2006, Eva Schuberth (with Dieter Mitsche): Collaborative Sorting [details]
• February 16, 2006, Patrick Traxler (TU Wien): Recognizing Transversal Hypergraphs [details]
• Monday, February 20, 2006, Martin Skutella (Univ. Dortmund): Computing earliest arrival flows with multiple sources [details]
• February 21, 2006, Leo Rüst: Violator spaces [details]
• Wednesday, February 22, 2006, Satoru Iwata (Tokyo University): Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems [details]
• February 23, 2006, Masashi Kiyomi (National Institute of Informatics (NII): Enumerating Chordal Graphs [details]
• February 28, 2006, Eva Schuberth: Approximate Sorting [details]

March

• March 02, 2006, Joshua Cooper (Courant Inst., NYU and ETH Zürich): Deterministic Random Walks on the Integers [details]
• March 07, 2006, Konstantinos Panagiotou: Extremal Subgraphs of Random Graphs [details]
• March 09, 2006, Julian Lorenz: Optimal Execution of Portfolio Transactions [details]
• March 16, 2006, Tobias Müller (Univ. of Oxford): Two-point concentration in random geometric graphs [details]
• March 21, 2006, Takeaki Uno (National Institute of Informatics, Japan (NII): Constructing canonical form of Distance Hereditary Graphs [details]
• March 23, 2006, Joshua Cooper (Courant Inst., NYU and ETH Zürich): Random Linear Extensions of Grids [details]
• March 30, 2006, Andreas Weissl: Properties and Sampling of Tree-like Structures with Blocks of Higher Connectivity [details]

April

• April 06, 2006, Sofya Raskhodnikova (Weizmann Institute of Science): Sublinear Algorithms for String Compressibility and the Distribution Support Size [details]
• April 11, 2006, Jan Remy: A Quasi-Polynomial Time Approximation Scheme for Minimum Weight Triangulation [details]
• April 13, 2006, Tibor Szabó: Turan's Theorem in the hypercube [details]
• April 18, 2006, Philipp Zumstein: Fourier Analysis in Computer Science and Combinatorics (Part I) [details]
• April 20, 2006, Dominik Scheder: Fourier Analysis in Computer Science and Combinatorics (Part II) [details]
• Friday, April 21, 2006, Akiyoshi Shioura (Tohoku Univ., Japan and Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB): Algorithms for M-convex Function Minimization [details]
• April 25, 2006, Jiří Matoušek (Charles Univ., Prague): Zone diagrams [details]

May

• May 02, 2006, Gábor Fejes Tóth (Hungarian Academy of Sciences): A short, unconventional introduction to packing and covering [details]
• May 04, 2006, Jiří Matoušek (Charles Univ., Prague): On the Johnson-Lindenstrauss flattening lemma [details]
• May 09, 2006, Miloš Stojaković (Univ. u Novom Sadu): The game of planarity [details]
• May 11, 2006, Dan Hefetz (Tel Aviv Univ.): Minor games on the complete graph [details]
• May 16, 2006, Pavel Valtr (Charles Univ., Prague): Traversing the cube [details]
• May 23, 2006, Jakub Cerny (Charles Univ., Prague): Geometric and Topological Graphs with No Forbidden Subgraphs [details]
• May 30, 2006, Stefan Geisseler: Overhang [details]

June

• June 01, 2006, Reto Spöhel: Online Ramsey Games in Random Graphs [details]
• June 06, 2006, Robin Moser: How good is the information theory bound in sorting? [details]
• June 08, 2006, Robin Künzler: Optimal Search and One-Way Trading Online Algorithms [details]
• June 13, 2006, Dominic Meier: On Enumerating Minimal Dicuts and Strongly Connected Subgraphs [details]
• June 15, 2006, Björn Steffen: Closest-point problems simplified on the RAM [details]
• June 20, 2006, Bettina Speckmann (Department of Mathematics and Computer Science, TU Eindhoven): Kinetic Collision Detection for Convex Fat Objects [details]
• June 22, 2006, Eran Nevo (Department of Mathematics, Hebrew University): Combinatorial embedding obstructions for simplicial complexes [details]
• June 27, 2006, Tetsuo Asano (School of Information Science, JAIST (Japan Advanced Institute of Science and Technology): Angular and Aspect-Ratio Voronoi Diagram with Applications [details]
• Wednesday, June 28, 2006, Yoshio Okamoto (Toyohashi University of Technology): Enumeration Algorithmics for Multi-Criteria Optimization [details]
• June 29, 2006, Shuji Kijima (The University of Tokyo): Perfect Sampler for Closed Jackson Networks [details]
• Friday, June 30, 2006, Carsten Lange (University of Washington, Seattle): Realisations for the associahedron and the cyclohedron [details]

July

• Wednesday, July 05, 2006, Csaba Dávid Tóth (Massachusetts Institute of Technology): Spanning Trees and Cuttings across Disks and Axis-Aligned Rectangles in Three-Space [details]
• Wednesday, July 05, 2006, József Solymosi (Department of Mathematics, University of British Columbia,Vancouver, Canada): Examples of when number theory and incidence geometry intertwine [details]
• July 11, 2006, Stefanie Gerke: Sequences with changing dependencies [details]
• July 20, 2006, Felix Fischer (Univ. of Munich): Symmetries and the complexity of pure Nash equilibrium [details]
• July 25, 2006, Yoshiharu Kohayakawa (Univ. de São Paulo): The size-Ramsey number of short subdivisions [details]
• July 27, 2006, Marek Sulovský (Charles Univ., Prague): T-paths and Related Packing Problems [details]

August

• August 29, 2006, Pavel Valtr (Charles Univ., Prague): Paths with no small angles [details]

September

• September 07, 2006, Gregory B. Sorkin (IBM T.J. Watson Research Center): Faster solving, counting, and sampling [details]
• September 19, 2006, Michael Krivelevich (Tel Aviv University): Packing Hamilton cycles in random graphs [details]
• September 21, 2006, Venkatesan Guruswami (Univ. of Washington): Error-correction when Noise Overwhelms Correct Data [details]

October

• October 03, 2006, Amin Coja-Oghlan (HU Berlin): Graph Partitioning via Adaptive Spectral Techniques [details]
• October 05, 2006, Torsten Mütze (TU Dresden): Switch-Setting Games [details]
• October 24, 2006, Emo Welzl: Encoding Lattice Triangulations [details]
• October 26, 2006, Lars Engebretsen (Google Switzerland, Zurich): Computing in Unstable Environments [details]
• October 31, 2006, Dominik Scheder: Fast deterministic algorithms for 3-SAT [details]

November

• November 02, 2006, Andreas Razen: On the Number of Crossing-Free Partitions [details]
• November 07, 2006, Riko Jacob: Optimal Randomized Comparison Based Algorithms for Collision [details]
• November 09, 2006, Uli Wagner: Set pairs (and, time permitting, quadrupels) [details]
• November 14, 2006, Fabian Kuhn (Microsoft Research Silicon Valley, California): Reconstructing Approximate Tree Metrics [details]
• November 16, 2006, Philipp Zumstein: Satisfiability With Exponential Families [details]
• November 21, 2006, Jan Remy: Prize-Collecting Point Sets [details]
• November 23, 2006, Reto Spöhel: Asymmetric Ramsey Properties of Random Graphs [details]
• November 28, 2006, Stefanie Gerke: Connectivity of random instances of addable graph classes [details]
• November 30, 2006, Joachim Giesen (Max-Planck-Institut für Informatik, Saarbrücken): Medial Axis Approximation and Unstable Flow Complex [details]

December

• December 05, 2006, Justus Schwartz: The Santa Claus Problem in a Probabilistic Setting [details]
• December 07, 2006, Rico Zenklusen: A bound on the collection of edges in MST's of fixed-size subgraphs [details]
• December 12, 2006, Michael Hoffmann: Maximizing Angles in Plane Straight Line Graphs (Part I) [details]
• December 14, 2006, Tibor Szabó: Polychromatic edge-colorings of the hypercube (Part I) [details]
• December 19, 2006, Paul Balister (Department of Mathematical Sciences, Univ. of Memphis): Cycle Decompositions [details]
• December 21, 2006, Tibor Szabó: Polychromatic edge-colorings of the hypercube (Part II) [details]

2007

January

• January 04, 2007, Johann A. Makowsky (Technion IIT, Haifa): Why is the chromatic polynomial a polynomial [details]
• Friday, January 05, 2007, Boris Aronov (Department of Computer and Information Science, Polytechnic Univ., Brooklyn NY): Sparse geometric graphs with small dilation [details]
• January 09, 2007, Martin Marciniszyn: Resilience of Random Graphs [details]
• January 11, 2007, Julian Lorenz: Optimal Competitive Algorithms for the k-Search Problem with Application in Robust Valuation of Lookback Options [details]
• January 16, 2007, Leslie Valiant (Division of Engineering and Applied Sciences, Harvard Univ.): Robust Logics [details]
• January 18, 2007, Tobias Christ: An Introduction to Homogenization Theory [details]
• January 23, 2007, Jan Hladky (Charles Univ., Prague): Maximum matching in graphs: an algebraic approach [details]
• January 25, 2007, Robert Berke: The Morphism Chromatic Number - Between Layouts and Colorings [details]
• January 30, 2007, Bernd Gärtner: Random Walks on Polytope Digraphs - Episode I [details]

February

• February 06, 2007, Alexander Engström (KTH Stockholm): A proof of a conjecture of Björner on simplicial polytopes [details]
• February 08, 2007, Dan Hefetz (Tel Aviv Univ.): Fast winning strategies in positional games [details]
• Friday, February 09, 2007, Kiyohito Nagano (Univ. of Tokyo): Efficient solutions to relaxations of combinatorial problems with submodular penalties via the Lovasz extension and non-smooth convex optimization [details]
• February 13, 2007, Miloš Stojaković (Univ. u Novom Sadu): Slow losing strategies in positional games [details]
• February 15, 2007, Patrick Traxler: Unique Satisfiability [details]
• February 20, 2007, Florian Zickfeld (TU Berlin): Counting Graph Orientations with Fixed Out-Degrees [details]
• February 27, 2007, Marc Noy (Univ. Politècnica de Catalunya): Growth of minor-closed families [details]

March

• March 01, 2007, Anusch Taraz (TU München): An Erdős-Stone type theorem for spanning subgraphs [details]
• March 08, 2007, Dominik Scheder: Partial Satisfaction [details]
• March 15, 2007, Marek Sulovský: Lower bounds for the rectilinear crossing number [details]
• March 20, 2007, Elias Vicari: The Fascinating World of Micro-Robots [details]
• March 22, 2007, Andreas Razen: Transforming Spanning Trees [details]
• March 27, 2007, Leo Rüst: The Hidden-K-Matrix Linear Complementarity Problem [details]
• March 29, 2007, Yves Brise: LP-type problems, a linear time algorithm further simplified [details]

April

• April 03, 2007, Micha Sharir (Tel Aviv Univ.): Weak epsilon nets in convex position: (inverse) Ackermann strikes again [details]
• April 05, 2007, Penny Haxell (Univ. of Waterloo): On stable paths [details]
• April 10, 2007, Jack Snoeyink (Univ. of North Carolina at Chapel Hill): Questions for graph rigidity from modeling allostery [details]
• April 17, 2007, Eva Schuberth: Measuring the Perceived Quality of Visualization Algorithms using Conjoint Analysis [details]
• April 19, 2007, Rahul Savani (Department of Computer Science, Univ. of Warwick, UK): From discounted payoff games to P-matrix linear complementarity problems [details]
• April 24, 2007, Dominik Scheder: Unsatisfiable Linear k-CNF Formulas [details]
• April 26, 2007, Petr Škovroň (Charles Univ., Prague): Removing degeneracy may require unbounded dimension increase [details]

May

• May 03, 2007, Jiří Matoušek (Charles Univ., Prague): How many points can be reconstructed from k projections? [details]
• May 08, 2007, Fabian Kuhn: On the Complexity of Distributed Graph Coloring [details]
• May 15, 2007, Julian Lorenz: Observational Learning in Random Networks [details]
• May 22, 2007, Joachim Giesen (Max-Planck-Institut für Informatik, Saarbrücken): Total Absolute Gaussian Curvature of a surface mesh [details]
• May 24, 2007, Nicla Bernasconi: Properties of Random Graphs via Boltzmann Samplers [details]
• May 29, 2007, Jack Snoeyink (Univ. of North Carolina at Chapel Hill): Convex hulls of intersections of line segments and planes [details]
• May 31, 2007, Jiří Matoušek (Charles Univ., Prague): Large Monochromatic Components in Two-colored Grids [details]

June

• June 05, 2007, Martin Dietzfelbinger (Technische Univ. Ilmenau): Blind search on the integers [details]
• June 07, 2007, Hossein Hajiabolhassan (Shahid Beheshti Univ., Tehran): Graphs homomorphisms and spectral conditions [details]
• June 12, 2007, Bernd Gärtner: Exactly solving linear and quadratic programs in CGAL [details]
• June 14, 2007, Michał Karoński (Univ. of Poznań, Poland): Irregular assignments [details]
• June 19, 2007, Reto Spöhel: Euclidean Vehicle Routing with Allocation [details]
• June 26, 2007, Subir Ghosh (Tata Institute of Fundamental Research, Mumbai, India): Computing the maximum clique in visibility graphs [details]
• Friday, June 29, 2007, Jared Saia (Computer Science Department, Univ. of New Mexico): Attack-Resistant Algorithms for Massive Networks [details]

July

• Friday, July 13, 2007, Torsten Mütze: Understanding Radio Irregularity in Wireless Networks [details]
• July 17, 2007, Tobias Christ: On Dinur's Proof of the PCP Theorem - Part I [details]
• Wednesday, July 18, 2007, Sonja Čukić (Binghamton University, USA): Why topology is fun. Sometimes... [details]
• Wednesday, July 18, 2007, Karl Lieberherr (Northeastern Univ., Boston): The Evergreen Game: The Promise of Polynomials to Boost Boolean MAX-CSP Solvers [details]
• July 19, 2007, Tobias Christ: On Dinur's Proof of the PCP Theorem - Part II [details]

August

• August 07, 2007, Trung Nguyễn (INRIA Sophia Antipolis Research Unit, France): A disk-covering problem with application in optical interferometry [details]
• August 14, 2007, Eric Fusy (Laboratoire d'Informatique, LIX, France): On a family of plane triangulations: combinatorial study, straight-line drawing, and analysis [details]
• August 21, 2007, Walter Morris (George Mason Univ., Virginia): Good Hidden P-matrix Sandwiches [details]

September

• September 25, 2007, Rico Zenklusen: High-Confidence Estimation of Small s-t Reliabilities in Acyclic Networks [details]
• September 27, 2007, Michael Hoffmann: Maximizing Angles in Plane Straight Line Graphs (Part II) [details]

October

• October 02, 2007, Michael Krivelevich (Tel Aviv Univ.): Avoiding small subgraphs in Achlioptas processes [details]
• October 04, 2007, Penny Haxell (Univ. of Waterloo): Independent dominating sets and Hamilton cycles [details]
• October 09, 2007, Yves Brise: On the Autocorrelation of Sets of Disks [details]
• October 11, 2007, Philipp Zumstein: On the Minimum Degree of Ramsey Minimal Graphs [details]
• October 16, 2007, Dominik Scheder: Saving Space -- Two Classical Results from Complexity Theory [details]
• October 18, 2007, Andreas Razen: Transforming Perfect Matchings [details]
• October 23, 2007, Marek Sulovský: Curves and Arrangements [details]
• October 25, 2007, Konstantinos Panagiotou: On the Chromatic Number of Random Graphs [details]
• October 30, 2007, Patrick Traxler: Constraint Systems and the Number of their Solutions [details]

November

• November 01, 2007, Gabriel Katz: Jenga [details]
• November 06, 2007, Justus Schwartz: Computation of Lower Bounds for Steiner Trees in Road Network Design [details]
• November 08, 2007, Jan Foniok: Generating Tree Duality: A Quest for Deltas and Sproinks [details]
• November 15, 2007, Lorenz Klaus: k-Sets in Three Dimensions [details]
• November 20, 2007, Dan Hefetz: Antimagic graphs via the Combinatorial Nullstellensatz [details]
• November 22, 2007, Herbert Edelsbrunner (Arts and Sciences Professor of Computer Science and Mathematics, Duke Univ.): Measuring Periodicity in Gene Expression with Persistence [details]
• November 27, 2007, Divesh Aggarwal: The Angel of Power 2 wins [details]
• November 29, 2007, Heidi Gebauer: On the Number of Hamilton Cycles in 3-regular Graphs [details]

December

• December 04, 2007, Reto Spöhel: On Von Neumann Poker with Community Cards [details]
• December 06, 2007, Andreas Razen: On the Number of Crossing-Free Geometric Graphs (Part I) [details]
• December 11, 2007, Tibor Szabó: On the rules of avoiding [details]
• Wednesday, December 12, 2007, Anna Hanulová: A short list color proof of Grötzsch's Theorem [details]
• December 13, 2007, Julian Lorenz: Adaptive Execution of Portfolio Transactions [details]
• December 18, 2007, Micha Sharir (Tel Aviv Univ.): On Lines Meeting Convex Polyhedra - Ray Shooting and Transversals [details]
• December 20, 2007, Jörg Priewasser: Exact and approximative algorithms for coloring G(n,p) [details]

2008

January

• January 08, 2008, Tobias Christ: A Lower Bound Example for the Wireless Localization Problem [details]
• January 15, 2008, Fedor Fomin (Univ. of Bergen, Norway): Parameterized Algorithms for Directed Maximum Leaf Problems [details]
• January 24, 2008, Philipp Zumstein: Polychromatic Colorings of Plane Graphs [details]
• January 29, 2008, Dominik Scheder: Hardness, Pseudo-Randomness and Derandomization (Part I) [details]
• January 31, 2008, Dominik Scheder: Hardness, Pseudo-Randomness and Derandomization (Part II) [details]

February

• February 05, 2008, Miloš Stojaković (Univ. u Novom Sadu): Slow losing again [details]
• February 07, 2008, Viola Mészáros (Univ. of Szeged, Charles Univ. Prague): Alternating Paths in Bicolored Point Sets [details]
• February 12, 2008, Joachim Giesen (Max-Planck-Institut für Informatik, Saarbrücken): The solution path of the slab SVM [details]
• February 19, 2008, Bernd Gärtner: Can you get drunk on unique sink orientations? [details]
• February 21, 2008, Uli Wagner: Van Kampen's Obstruction and Embeddability of Skeleta of Spheres [details]
• February 26, 2008, Michael Hoffmann: An improved upper bound for wireless localization [details]
• February 28, 2008, Martin Jaggi: Geometry of Support Vector Machines [details]

March

• March 04, 2008, Marek Sulovský: Circle containment problem and centerpoints [details]
• March 06, 2008, Matthew Cook (Institute of Neuroinformatics): The Correspondence between Closed Sets of Functions and Closed Sets of Relations (Part I) [details]
• March 11, 2008, Imre Bárány (Alfréd Rényi Mathematical Institute, Hungarian Academy of Sciences): Paths with no small angle [details]
• March 13, 2008, Dominik Scheder: How many conflicts does it need to be unsatisfiable? [details]
• March 18, 2008, Robert Berke: Matching Transversals in Multipartite Graphs [details]
• March 20, 2008, Matthew Cook (Institute of Neuroinformatics): The Correspondence between Closed Sets of Functions and Closed Sets of Relations (Part II) [details]

April

• April 01, 2008, Yves Brise: Lipschitzian Optimization, DIRECT Algorithm, and Applications [details]
• April 03, 2008, Nicla Bernasconi: Quadratic exact-size and linear approximate-size random generation of planar graphs [details]
• April 08, 2008, Joel Spencer (Courant Institute, New York Univ.): Neuron Firing [details]
• April 10, 2008, Lutz Warnke: Asymptotic Packing via A Branching Process [details]
• April 15, 2008, Robert Almgren (Courant Institute, New York Univ.): Portfolios from sorts [details]
• April 17, 2008, Jesús Jerónimo Castro (Univ. Autónoma de Guerrero, Acapulco, México): Shaken Rogers's Theorem [details]
• April 22, 2008, Fabian Kuhn: Tight Bounds for Distributed Selection [details]
• April 24, 2008, Torsten Mütze: Antimagic Labellings of Graphs [details]
• April 29, 2008, Henning Thomas: Balanced Online Ramsey Games in Random Graphs [details]

May

• May 06, 2008, Martin Tancer (Charles Univ., Prague): On the complexity of recognition of d-collapsible complexes [details]
• May 08, 2008, Jiří Matoušek (Charles Univ., Prague): On the difficulty of removing degeneracy in LP-type problems: The way of topology [details]
• May 13, 2008, Alexandru Tomescu (Univ. of Bukarest): Minimal Graphs with respect to the Degree Distance [details]
• Wednesday, May 14, 2008, Sándor Kovács (University of Washington): Algebra=Geometry [details]
• May 20, 2008, Anastasios Sidiropoulos (MIT): Circular Partitions with Applications to Visualization and Embeddings [details]
• May 22, 2008, Eran Nevo (Cornell Univ., Ithaca): A characterization of simplicial polytopes with g₂=1 [details]
• May 27, 2008, Jiří Matoušek (Charles Univ., Prague): Low-distortion embeddings in R^d [details]
• May 29, 2008, Gábor Fejes Tóth (Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, Budapest, Hungary): Shortest path among circles [details]

June

• June 05, 2008, Piotr Sankowski (ETH Zurich): Stochastic Analyses for Combinatorial Optimization Problems [details]
• June 12, 2008, Dirk Nowotka (Univ. Stuttgart): When the Maximum Intersection Problem Is Easy: On the Use of Threshold Phenomena in Randomized Graph Models [details]

July

• July 08, 2008, Karl Lieberherr (Northeastern University, Boston, USA): Using Artificial Markets to Teach Computer Science Through Trading Robots [details]
• Monday, July 14, 2008, Jiří Matoušek (Charles Univ., Prague): Blocking visibility for points in general position [details]
• July 17, 2008, Jeong Han Kim (Yonsei Univ., South Korea): Random Graphs, Random Regular Graphs and Couplings [details]
• July 22, 2008, Jeong Han Kim (Yonsei Univ., South Korea): Optimal Query Complexity Bounds for Finding Graphs [details]

August

• August 21, 2008, Philipp Zumstein: Analytic Methods in Extremal Graph Theory [details]

September

• September 04, 2008, Bernd Gärtner: Nests, Whirls, and Twists [details]
• September 11, 2008, Thomas Rast: On the Degree Sequence of 3-connected Planar Maps [details]
• September 16, 2008, Stefanie Gerke (Royal Holloway, Univ. of London): Uniform Random Intersection Graph [details]
• September 18, 2008, Robin Moser: Derandomizing the Lovász Local Lemma more Effectively [details]
• September 23, 2008, Luca Gugelmann: Balanced Online Vertex-Coloring Games in Random Graphs [details]
• September 25, 2008, Dominik Scheder: Almost Disjoint Formulas and Almost Tight Bounds [details]
• September 30, 2008, Emo Welzl: Triangulations of Convex Polygons - A Historical Note [details]

October

• October 02, 2008, Tobias Christ: NP-Hardness of the Wireless Localization Problem [details]
• October 07, 2008, Raimund Seidel (Univ. des Saarlandes): Making the Inverse Ackermann Function Appear Natural(ly) [details]
• October 09, 2008, Martin Jaggi: Core-sets for polytope distance [details]
• October 14, 2008, Gabriel Katz: Tropical Centerpoints and Tverberg Points [details]
• October 16, 2008, Michael Krivelevich (Tel Aviv Univ.): Perfectly balanced partitions of smoothed graphs [details]
• October 21, 2008, Uli Wagner: Hardness of Embedding Simplicial Complexes in R^d (Part I) [details]
• October 23, 2008, Uli Wagner: Hardness of Embedding Simplicial Complexes in R^d (Part II) [details]
• October 28, 2008, Peter Sanders (Univ. Karlsruhe): Improving Kruskal's Algorithm [details]
• October 30, 2008, Heidi Gebauer: Unsatisfiable CNF-Formulas with Small Neighborhoods [details]

November

• November 04, 2008, Andreas Razen: Counting Crossing-Free Geometric Graphs with Exponential Speed-Up (Part I) [details]
• November 06, 2008, Andreas Razen: Counting Crossing-Free Geometric Graphs with Exponential Speed-Up (Part II) [details]
• November 11, 2008, Tom Rackham (Mathematical Institute, Oxford Univ.): Methods of distance-constraint precolouring [details]
• November 13, 2008, Dominik Scheder: Bollobás' and Riordan's Proof of the Harris-Kesten Theorem [details]
• November 18, 2008, Robin Künzler: The Power of Interactive Proofs, IP = PSPACE [details]
• November 20, 2008, Marek Sulovský: Circle containment problem [details]
• November 25, 2008, Torsten Mütze: Small subgraphs in random graphs and the power of multiple choices: The online case [details]
• November 27, 2008, Reto Spöhel: Small subgraphs in random graphs and the power of multiple choices: The offline case [details]

December

• December 02, 2008, Christian Lorenz Müller (Mosaic Group, ETH Zürich): Stochastic search and randomized algorithms for energy landscapes (Part I) [details]
• December 04, 2008, Yves Brise: Covering Spheres with Spheres [details]
• December 09, 2008, Dan Hefetz: Weighted colorings and Alon-Tarsi choosability (Part I) [details]
• December 11, 2008, Dan Hefetz: Weighted colorings and Alon-Tarsi choosability (Part II) [details]
• December 16, 2008, Rom Pinchasi (Technion, Israel): Some new results related to the 'halving lines problem' [details]
• December 18, 2008, Zhen Hao (Univ. Heidelberg, Research Group Combinatorial Optimization): Construction of a PTAS for the Steiner tree problem with neighborhoods in the plane [details]

2009

January

• January 13, 2009, Richard Královič: An Exponential Gap between Linear and Exponential Expected Time in Probabilistic Sweeping Finite Automata [details]
• January 20, 2009, Konstantinos Panagiotou (Max-Planck-Institut für Informatik, Saarbrücken): Random Graphs from Classes with Constraints [details]
• January 22, 2009, Panagiotis Cheilaris (City Univ. of New York and Rényi Institute): Online conflict-free coloring for geometric hypergraphs [details]
• January 27, 2009, Christian Lorenz Müller (Mosaic Group): Stochastic search and randomized algorithms for energy landscapes (Part II) [details]

February

• February 03, 2009, Sonny Ben-Shimon (Tel Aviv Univ.): Local resilience of regular graphs [details]
• February 05, 2009, Birte Schrader (Mosaic Group): Diffusion operators in particle methods - constructing problem-independent kernel choice criteria [details]
• February 10, 2009, Robin Moser: A Constructive Proof of the Lovász Local Lemma [details]
• February 17, 2009, Andreas Razen: How to move a chair through a door (Part I) [details]
• February 19, 2009, Michael Hoffmann: Happy points [details]
• February 24, 2009, Kenya Ueno (The Univ. of Tokyo): A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints [details]
• February 26, 2009, Viola Mészáros (Charles Univ., Prague): The Pizza Problem [details]

March

• March 03, 2009, Patrick Traxler: Hashing techniques in exponential time complexity [details]
• March 05, 2009, Rolf Harren (Max-Planck-Institut für Informatik, Saarbrücken): An Absolute 2-Approximation for Two-dimensional Bin Packing [details]
• March 10, 2009, Philipp Zumstein: On Polychromatic 3- and 4-Colorings of Plane Graphs [details]
• March 12, 2009, Michael Belfrage: Online Ramsey games involving trees [details]
• March 17, 2009, Yves Brise: Disjoint Covering Number [details]
• March 19, 2009, Anna Huber (Max-Planck-Institut für Informatik, Saarbrücken): Quasirandom Rumour Spreading [details]
• March 24, 2009, Jo Helmuth (Mosaic Group): Analysis of Spatial Point Patterns in Live Cells [details]
• March 26, 2009, Martin Jaggi: Kernels, Margins, Coresets and The Fight of High- vs. Low-Dimensional Spaces [details]
• March 31, 2009, Rajesh Ramaswamy (Mosaic Group): A new class of highly efficient exact stochastic simulation algorithm for chemical reaction networks [details]

April

• April 02, 2009, Sabrina Wiedersheim: Spanning Trees, Spiders and Snowflakes [details]
• April 07, 2009, Florian Jug: Factor Fields [details]
• Wednesday, April 08, 2009, David Belius (Univ. of Cambridge): Discrete Harmonic Analysis and the Divisible Sandpile [details]
• April 14, 2009, Tobias Christ: How to Move a Chair Through a Door (Part II) [details]
• April 16, 2009, Shai Ben-David (Univ. of Waterloo, Canada): New Theoretical Challenges emerging from Machine Learning applications [details]
• April 21, 2009, Boris Bukh (Princeton Univ.): Geometric selection theorems [details]
• April 23, 2009, Benny Sudakov (UCLA): Triangle packings and 1-factors in oriented graphs [details]
• April 28, 2009, David Avis (McGill Univ., Montreal): The shelling property for polytopal digraphs [details]
• April 30, 2009, Bernd Gärtner: K-Matrix Linear Complementarity Problems and Unique Sink Orientations [details]

May

• May 05, 2009, Christian Helbling: Sokoban is PSPACE-complete [details]
• May 07, 2009, Andrea Francke: The Euclidean Degree-4 Minimum Spanning Tree Problem is NP-hard [details]
• May 12, 2009, Jiří Matoušek (Charles Univ., Prague): Kakeya's conjecture over finite fields according to Zeev Dvir [details]
• Friday, May 15, 2009, Nathan Linial (Hebrew Univ. of Jerusalem, Israel): Topology meets the probabilistic method [details]
• May 19, 2009, Marek Krčál (Charles Univ., Prague): Graph balancing [details]
• Wednesday, May 20, 2009, Martin Tancer (Charles Univ., Prague): Non-representability of finite projective planes by convex sets [details]
• May 26, 2009, Angelika Steger: Synchrony and Asynchrony in Neural Networks [details]
• May 28, 2009, Robert E. Tarjan (Princeton Univ. and HP Labs): Rank-Balanced Trees [details]

June

• June 02, 2009, Bálint Miklós (Applied Geometry Group): The Scale Axis Transform [details]
• June 04, 2009, Gabriel Nivasch (Tel Aviv Univ., Israel): Encounters with the inverse Ackermann function [details]
• June 09, 2009, Jan Foniok: Interlacing adjoints on directed graphs [details]
• June 11, 2009, Micha Sharir (Tel Aviv Univ., Israel): Sharing joints, in moderation: A groundshaking clash between algebraic and combinatorial geometry [details]
• June 16, 2009, Akitoshi Kawamura (Univ. of Toronto, Canada): Computational Complexity of Ordinary Differential Equations [details]
• June 25, 2009, Rico Zenklusen: A Flow Model Based on (Poly-)Linking Systems [details]
• June 30, 2009, Otfried Cheong (Korea Advanced Institute of Science and Technology - KAIST, Daejeon, South Korea): Lines pinning lines [details]

July

• July 02, 2009, Lorenz Klaus: On the Number of Unique-Sink Orientations Arising from Pivoting in Linear Complementarity [details]
• July 02, 2009, József Solymosi (Univ. British Columbia, Canada): Corners in Cartesian products [details]
• July 14, 2009, Eran Nevo (Cornell Univ., Ithaca): Missing faces and generalized lower bounds on face numbers [details]
• Monday, July 27, 2009, Shantanu Roy (Univ. of Basel): Towards Biomolecular Structure Prediction using Minima Hopping Algorithm [details]
• July 28, 2009, Henning Thomas: Avoiding Monochromatic Giants in Edge-Colorings of Random Graphs [details]

August

• August 27, 2009, Efi Fogel (Tel Aviv Univ., Israel): Polyhedral Assembly Partitioning with Infinite Translations or The Importance of Being Exact [details]

September

• September 01, 2009, Monique Teillaud (INRIA Sophia Antipolis - Méditerranée): Computing 3D Periodic Triangulations [details]
• Monday, September 07, 2009, Lutz Warnke: On the Evolution of K_{\ell+1}-free Graphs [details]
• September 10, 2009, Dominik Scheder: Two-Coloring the Odd Cycle - A Short Introduction To Parallel Repetition [details]
• September 15, 2009, Pietro Oliveto (Univ. of Birmingham, UK): Analysis of Diversity-preserving Mechanisms for Global Exploration [details]
• Wednesday, September 16, 2009, Per Kristian Lehre (Univ. of Birmingham, UK): Runtime analysis of population-based EAs using non-selective family trees [details]
• September 17, 2009, Luca Gugelmann: Random walks and electrical networks [details]
• September 22, 2009, Tobias Müller (Tel Aviv Univ., Israel): Hamiltonicity of the random geometric graph [details]
• September 24, 2009, Primoz Skraba (INRIA Saclay, France): Persistent Homology and Clustering [details]
• September 29, 2009, Anna Gundert (FU/TU Berlin): An Extremal Problem for Embeddable Simplicial Complexes [details]

October

• October 01, 2009, Thomas Rast: Positive and negative correlation [details]
• October 06, 2009, Martin Jaggi: Approximate SDP solvers, Matrix Factorizations, the Netflix Prize, and PageRank [details]
• October 08, 2009, Tobias Christ: Wireless Localization with Vertex Guards is NP-hard [details]
• October 13, 2009, Heidi Gebauer: The Traveling Salesman Problem in Bounded Degree Graphs [details]
• October 15, 2009, Uli Wagner: Complete Minors of Hypergraphs & Simplicial Complexes (Part 1. Definitions & Motivation) [details]
• October 20, 2009, Jan Foniok: A combinatorial characterization of K-matrices [details]
• October 22, 2009, Stefan Schneider: The Stable Marriage Problem (student talk, 45 min.) [details]
• October 27, 2009, Torsten Mütze: The Search for Simple Symmetric Venn Diagrams [details]
• October 29, 2009, Thomas Liphardt: Finding a Heaviest Triangle is not Harder than Matrix Multiplication (student talk, 45 min.) [details]

November

• November 03, 2009, Yves Brise: C++ Templates are Turing complete [details]
• November 05, 2009, Dan Hefetz: Playing to retain the advantage [details]
• November 10, 2009, Andrei Giurgiu: Random Walk Algorithms for SAT (master thesis presentation) [details]
• November 12, 2009, Jan Foniok: A combinatorial characterization of K-matrices (Part 2) [details]
• November 17, 2009, Christoph Krautz: Sharpening Projections [details]
• November 19, 2009, Marek Sulovský: A few words about continuous motion in geometry [details]
• November 24, 2009, Andrea Francke: A simple proof of the upper bound theorem (student talk, 45 min.) [details]
• November 26, 2009, Uli Wagner: Complete Minors of Hypergraphs & Simplicial Complexes (Part 2.) [details]

December

• December 01, 2009, Gabriel Nivasch: On the Sprague-Grundy function for Wythoff's game [details]
• December 03, 2009, Reto Spöhel: Upper bounds for asymmetric Ramsey properties of random graphs [details]
• December 08, 2009, Miloš Stojaković (University of Novi Sad): Convex lattice polygons with small perimeter [details]
• December 10, 2009, Konstantinos Panagiotou (MPI Saarbrücken): Sharp Load Thresholds for Cuckoo Hashing [details]
• December 15, 2009, Robin Moser: Vectors in the Box [details]
• December 17, 2009, Lutz Warnke (University of Oxford): A deletion method for local subgraph counts [details]

2010

January

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

February

• February 04, 2010, Heidi Gebauer: Game Theoretic Ramsey Numbers [details]
• February 23, 2010, Michael Hoffmann: Min and Max with k Lies [details]
• February 25, 2010, Anna Gundert: Lattice paths and Lagrangian matroids [details]

March

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

April

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

May

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

June

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

July

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

August

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

September

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

October

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

November

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

December

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

2011

January

• January 20, 2011, Reto Spöhel (MPI Saarbrücken): Creating small subgraphs in the Achlioptas process. [details]
• January 25, 2011, Robin Künzler: The Equivalence of the Random Oracle Model and the Ideal Cipher Model. [details]

February

• Friday, February 11, 2011, József Solymosi (Univ. of British Columbia): Incidences and singularities [details]
• February 15, 2011, Miloš Stojaković (Univ. of Novi Sad): A threshold for the Maker-Breaker clique game [details]
• February 22, 2011, Uli Wagner: An elementary construction of expanders [details]
• February 24, 2011, Dominik Scheder: Mahaney's Theorem: A Complexity Theory Classic [details]

March

• March 01, 2011, Jan Foniok: On Ramsey classes of structures [details]
• March 03, 2011, Martin Jaggi: Convex Optimization with a Parameter, and Regularization Paths for Matrix Factorizations [details]
• March 08, 2011, Michael Farber (Univ. of Durham): Random Complexes [details]
• March 10, 2011, Yury Person (FU Berlin): (Hyper-)graph quasi-randomness [details]
• March 15, 2011, Tobias Christ: How to describe an orthogonal polyhedron by cones. [details]
• March 17, 2011, Aris Anagnostopoulos (Univ. of Rome): Algorithms on Dynamic Data [details]
• March 22, 2011, Kenneth Clarkson (IBM Research Almaden): Sublinear Optimization for Machine Learning [details]
• Wednesday, March 23, 2011, Ramamohan Paturi (UC San Diego): Sparsification lemma [details]
• March 24, 2011, Ramamohan Paturi (UC San Diego): Complexity of Evaluating Quantified k-CNFs [details]
• March 29, 2011, Yves Brise: Hypergraph Matching by Linear and Semidefinite Programming [details]
• March 31, 2011, Frank Staals (TU Eindhoven): Geographic Grid Embeddings [details]

April

• April 05, 2011, Henning Thomas: Explosive Percolation: Defused and Reignited [details]
• April 07, 2011, Gabriel Nivasch: Lower bounds for epsilon-nets [details]
• April 12, 2011, Micha Sharir (Tel Aviv University): From joints to distinct distances and beyond: The dawn of an algebraic era in combinatorial geometry I [details]
• Wednesday, April 13, 2011, Micha Sharir (Tel Aviv University): From joints to distinct distances and beyond: The dawn of an algebraic era in combinatorial geometry II [details]
• April 14, 2011, Pankaj Agarwal (Duke University): Euclidean Bipartite Matching, Old and New Results [details]
• April 19, 2011, Christoph Krautz: Firing-Rate Analysis in Feedforward-Inhibition Networks [details]
• April 21, 2011, Emo Welzl: Kasteleyn and the Number of Crossing-Free Matchings and Cycles on a Planar Point Set [details]
• April 26, 2011, Edward D. Kim (TU Delft): Polyhedral graph abstractions and weaker versions of the Hirsch Conjecture [details]
• April 28, 2011, Lutz Warnke (University of Oxford): Achlioptas process phase transitions are continuous [details]

May

• May 03, 2011, Anna Gundert: Counting "hypertrees": A generalization of Cayley's formula [details]
• May 05, 2011, Adarsh Amirtham: Sperner's Lemma in Fair Division (student talk, 45 min.) [details]
• Friday, May 06, 2011, József Solymosi (Univ. British Columbia, Canada): Pseudoline-Point Incidences [details]
• Monday, May 09, 2011, Carsten Lange (FU Berlin): Optimal topological simplification of discrete functions on surfaces [details]
• May 10, 2011, Torsten Mütze: Explicit matchings in the middle levels graph [details]
• May 12, 2011, Luca Gugelmann: A Randomized Version of Ramsey's Theorem [details]
• May 17, 2011, Robin Moser: Introduction to the PPSZ Algorithm [details]
• May 19, 2011, Timon Hertli: 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General [details]
• May 24, 2011, Arnau Padrol (UPC Barcelona): Constructing Gale duals of neighborly polytopes [details]
• May 26, 2011, Thomas Rast: Buffon machines [details]
• May 31, 2011, Hanna Sumita: Simple Stochastic Games are LP-type problems (student talk, 45 min.) [details]

June

• June 07, 2011, Jiří Matoušek (Charles Univ.): Discrepancy, Bansal's algorithm and the determinant bound [details]
• June 09, 2011, Zuzana Safernová (Charles Univ.): On the nonexistence of k-reptile simplices in R^3 and R^4 [details]
• June 21, 2011, Eric Sedgewick (DePaul Univ.): Recognition of a knot complement [details]
• Wednesday, June 22, 2011, Martin Tancer (Charles Univ.): Good covers are algorithmically unrecognizable [details]
• June 23, 2011, Boris Aronov (NYU Poly): Algebra can do amazing things [details]
• June 28, 2011, Andrea Francke: A Metric Embedding: Ulam Metric into l_1 [details]

July

• July 19, 2011, Chandrajit Bajaj (Univ. of Texas at Austin): Octrees Revisited: Efficient Energetic Calculations and Neighborhood Maintenance for Molecular Simulations [details]
• July 28, 2011, in ML J37.1, Dominik Scheder: A very different algorithm for k-SAT [details]

August

• August 09, 2011, Chandan Dubey: Approximating the Closest Vector Problem Using an Approximate Shortest Vector Oracle [details]
• August 11, 2011, Shakhar Smorodinsky (Ben-Gurion University): Hitting Sets Online and Vertex Ranking [details]

September

• September 01, 2011, Joseph O'Rourke (Smith College, Northampton, MA, USA): New Methods for Unfolding Convex Polyhedra [details]
• September 13, 2011, in ML J37.1, Yoshio Okamoto (Japan Advanced Institute of Science and Technology): Vertex Angle and Crossing Angle Resolution of Leveled Tree Drawings [details]
• September 15, 2011, in ML J37.1, Philipp Hupp (TU München): On the I/O Complexity of Stencil Computations on 2 Dimensional Grids [details]
• September 20, 2011, Dominik Scheder (Aarhus University): Truthful Mechanisms for Facility Location [details]
• September 22, 2011, Thomas Dueholm Hansen (Aarhus University): Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor [details]
• September 27, 2011, Heidi Gebauer: A Doubly Exponentially Crumbled Cake [details]
• September 29, 2011, Sebastian Stich: The Johnson-Lindenstrauss Lemma [details]

October

• October 04, 2011, Christoph Krautz: Interacting Maps for Fast Visual Interpretation [details]
• October 06, 2011, Elad Hazan (Technion): Learning in the game of investing [details]
• Monday, October 10, 2011, Amir Shpilka (Technion): Tight lower bounds for 2-query LCCs over finite fields [details]
• October 13, 2011, Frank Mousset: Rainbow Paths in Proper Edge Colorings of Complete Graphs [details]
• October 18, 2011, Sandro Bosio: A time extension of combinatorial optimization problems [details]
• October 20, 2011, Tomasz Łuczak (Adam Mickiewicz University, Poznań, Poland): On a generalization of VC-dimension [details]
• Friday, October 21, 2011, Tibor Szabó (Freie Universität Berlin): Sharp threshold for bounded degree spanning trees with many leaves or a long bare path [details]
• October 25, 2011, Yves Brise: Range Assignment Problems [details]
• October 27, 2011, Anastasios Zouzias (University of Toronto): A Matrix Hyperbolic Cosine Algorithm and Applications [details]

November

• November 01, 2011, Vincent Kusters: Characterizing graphs with a sliceable rectangular dual [details]
• November 03, 2011, Bernd Gärtner: Back to the Future - Computer Science for Kids [details]
• November 08, 2011, Andreas Bärtschi: Conflict-free art gallery coverage (master's thesis) [details]
• November 10, 2011, Martin Jaggi: Structured Sparsity [details]
• November 15, 2011, Timon Hertli: Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains [details]
• November 17, 2011, Thomas Rast: Pancake flipping is NP-hard [details]
• November 22, 2011, József Balogh (University of Illinois at Urbana-Champaign): On the Ramsey-Turan numbers of graphs and hypergraphs [details]
• November 24, 2011, Henning Thomas: The Game Chromatic Number of Random Graphs [details]
• November 29, 2011, Tobias Christ: Rational Tangles [details]

December

• December 01, 2011, Isabelle Hurbain-Palatin: Sorting by placement and shift [details]
• December 06, 2011, Gabriel Nivasch (EPFL): Upper bounds for centerflats [details]
• December 08, 2011, Ueli Peter: The Degree Sequence of Hyperbolic Random Graphs [details]
• December 13, 2011, Luca Gugelmann: Exponentially Many Matchings in Cubic Bridgeless Graphs [details]
• December 15, 2011, Florian Jug: Neural Computation - Measurements and Models [details]
• December 20, 2011, Christian Lorenz Müller: The Lovasz-Vempala algorithm for computing the volume of a convex body in O*(n⁴) - Theory and Implementation [details]

2012

January

• January 05, 2012, Jan Foniok (Queen's University): Some Ramsey applications [details]

February

• February 21, 2012, Yury Person (FU Berlin): Powers of Hamilton Cycles in Pseudorandom Graphs [details]
• February 23, 2012, Michael Hoffmann: Counting Plane Graphs: Pseudo-Flippability and Applications [details]

March

• March 06, 2012, Johannes Lengler: Evolutionary Algorithms on Quantum Computers [details]
• March 15, 2012, Dominik Scheder (Aarhus University): A 29 Minutes Intro to Communication Complexity (Plus 1 Minute of Questions) [details]
• Friday, March 16, 2012, in CAB G61, David Cimasoni (Université de Genève): Counting perfect matchings on graphs [details]
• March 20, 2012, Yves Brise: Low Rank Updating of Matrix Factorizations [details]
• March 22, 2012, Ueli Peter: How Random Is The Web? [details]
• March 27, 2012, Vincent Kusters: Cinderella and the Wicked Stepmother [details]

April

• April 03, 2012, Sebastian Stich: The Heavy Ball Method [details]
• April 05, 2012, Henning Thomas: Mastermind [details]
• April 17, 2012, Boris Bukh (University of Cambridge): Generalized Erdős-Szekeres theorems [details]
• April 19, 2012, Komei Fukuda: Revisiting the polyhedral redundancy removal problem [details]
• Monday, April 23, 2012, Hemant Tyagi (EPFL): Learning multi ridge functions in high dimensions via low rank matrix recovery [details]
• April 24, 2012, Daniel Johannsen (Tel Aviv University): Embedding spanning trees in random graphs [details]
• April 26, 2012, Matias Korman (Universitat Politècnica de Catalunya): Geometric problems in Ad-Hoc Networks [details]

May

• May 03, 2012, Jean Cardinal (Université Libre de Bruxelles): The Clique Problem in Ray Intersection Graphs [details]
• Friday, May 04, 2012, in CAB G11, Carsten Lange (Freie Universität Berlin): Posets and Polytopes [details]
• Monday, May 07, 2012, Benny Sudakov (University of California, Los Angeles): The phase transition in random graphs -- a simple proof [details]
• May 08, 2012, Ola Svensson (EPFL): Approximating Graphic TSP by Matchings [details]
• May 10, 2012, Stephan Kollmann: Topology Learning in Spiking Recurrent Competitive Networks (Master thesis) [details]
• May 15, 2012, Akaki Mamageishvili: The Unsatisfiability Threshold of Random Formulas [details]
• May 22, 2012, Joshua Zahl (University of California, Los Angeles): A Szemerédi-Trotter theorem in R⁴ [details]
• Wednesday, May 23, 2012, in CAB G61, Hang Zhou (ENS Paris): Approximation for Maximum Surjective Constraint Satisfaction Problems [details]
• May 24, 2012, Anna Gundert: Expansion for 2-complexes [details]
• May 29, 2012, Luca Gugelmann: Sharp thresholds and hypergraph 2-colorability [details]
• May 31, 2012, Trinh Huynh: The Communication Complexity and Block Sensitivity of Search Problems [details]

June

• June 12, 2012, in HG D5.2, Andrea Roth (INRIA Sophia-Antipolis): On Discrete Morse-Smale Decompositions and Bifurcations Diagrams [details]
• June 14, 2012, in HG D5.2, Francis Sergeraert (Inst. Fourier, Grenoble): The Eilenberg-Zilber Combinatorial Contraction [details]
• Friday, June 15, 2012, Reto Spöhel (MPI Saarbrücken): PAC learning and genetic programming [details]
• June 19, 2012, Rajko Nenadov: On Counting Lemma for sparse graphs (Master thesis) [details]
• June 21, 2012, Uri Zwick (Tel Aviv University): Lower bounds for randomized pivoting rules [details]

July

• July 03, 2012, József Solymosi (University of British Columbia): On the Sum-Product Problem [details]
• July 05, 2012, Peter Chvojka (Slovak University of Technology in Bratislava, Slovakia): Secret sharing schemes on nonstandard structures [details]
• Friday, July 06, 2012, Daniel Tschudi: Complexity of Multi-Party Computations Secure Against General Adversaries [details]
• July 10, 2012, Gerald Weber (University of Auckland): The Centroid is a Reference Point for the Symmetric Difference in d Dimensions [details]
• July 12, 2012, Vissarion Fisikopoulos (National and Kapodistrian University of Athens): Constructing Polytopes via a Vertex Oracle [details]
• Monday, July 16, 2012, Jan Foniok (Queen's University): Ramsey Classes Defined by Forbidden Homomorphisms [details]
• July 17, 2012, Anton Krohmer (MPI Saarbrücken): Finding Cliques in Scale-Free Networks [details]

August

• August 07, 2012, Micha Sharir (Tel Aviv University): Waiting for the ceiling to fall: On the longest path in the randomized incremental point-location DAG [details]
• August 16, 2012, in HG D5.2, Otfried Cheong (Korea Advanced Institute of Science and Technology (KAIST), South Korea): Fan-Crossing Free Graphs and other edge crossing properties [details]
• August 30, 2012, Andreas Noever: Online Ramsey Games for Triangles in Random Graphs [details]

September

• September 11, 2012, Gábor Tardos (Alfréd Rényi Institute of Mathematics): Tight lower bounds for geometric epsilon nets [details]
• September 11, 2012, in NO C44, Uwe Schöning (Universität Ulm): Probability Distributions for Local Search and Make versus Break [details]
• Wednesday, September 12, 2012, in NO C44, Ignaz Rutter (Karlsruhe Institute of Technology (KIT)): Cubic Augmentation of Planar Graphs [details]
• September 13, 2012, in NO C44, Friedrich Eisenbrand (EPFL): Subdeterminants and the Diameter of Polyhedra [details]
• September 18, 2012, Robin Künzler: Does SAT have a Checker? [details]
• September 20, 2012, Christian Sommer (MIT): Simple Cycle Separators and Recursive Decompositions for Planar Graphs [details]
• September 25, 2012, Alexander Pilz (Graz University of Technology): Flip Distance Between Triangulations of a Simple Polygon is NP-Complete [details]
• Wednesday, September 26, 2012, Raimund Seidel (Saarland University): An Aggregative Counting Algorithm for the Triangulations of a Planar Point Set [details]
• September 27, 2012, Alexander Souza (Apixxo AG): Approximation Algorithms for Generalized and Variable Sized Bin Covering [details]

October

• October 02, 2012, Jan Hazla: Concentration Bounds using Bayes' Rule [details]
• October 04, 2012, Timon Hertli: Using Integrals to Compute Probabilities on Permutations [details]
• October 09, 2012, Mihai Stupariu (University of Bucharest): Algorithms for curvature calculation in Digital Terrain Modelling [details]
• October 16, 2012, Noga Alon (Tel Aviv University): On graphs and communication [details]
• October 18, 2012, Robin Moser: Towards a Generalization of the PPSZ Algorithm to Larger Domains, Part I [details]
• October 23, 2012, Sonoko Moriyama (Tohoku University): Holt-Klee condition on SEB cubes [details]
• October 25, 2012, Sebastian Millius: Towards a Generalization of the PPSZ Algorithm to Larger Domains, Part II [details]
• October 30, 2012, Hafsteinn Einarsson: One shot learning [details]

November

• November 01, 2012, Federico Padua: Search for CP violation in the charm decays with the BaBar experiment [details]
• November 13, 2012, Francisco Valero-Cuevas (University of Southern California): Applications of vertex enumeration to understanding the neural control of musculature [details]
• November 15, 2012, in HG D5.2, Ueli Peter: Compressing Separable Graphs [details]
• Friday, November 16, 2012, in HG D3.2, Dominik Scheder (Aarhus University): Exponential Lower Bounds for the PPSZ k-SAT Algorithm [details]
• November 20, 2012, Johannes Lengler: Black Box Complexities [details]
• November 22, 2012, Gerth Stølting Brodal (Aarhus University): Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree [details]
• Friday, November 30, 2012, Michael Kaufmann (Universität Tübingen): On Partial Edge Drawings [details]

December

• December 04, 2012, Sebastian Stich: Variable Metric Random Pursuit [details]
• December 06, 2012, Henning Thomas: Dependent Random Choice [details]
• December 11, 2012, Anna Gundert: The Containment Problem for Random 2-Complexes [details]
• December 13, 2012, Carla Michini: The Hirsch Conjecture for the Fractional Stable Set Polytope [details]
• December 18, 2012, Wolfgang Woess (Graz University of Technology): On the duality between jump processes on ultrametric spaces and random walks on trees [details]
• December 20, 2012, Bernd Gärtner: Semiproduct Unique Sink Orientations [details]

2013

January

• Monday, January 07, 2013, Christof Lutteroth (University of Auckland): Constraint-based User Interfaces - Specification and Solving [details]
• January 10, 2013, Jan Foniok (Queen's University): Adjoint functors in graph theory [details]
• January 15, 2013, Hemant Tyagi: Tangent space estimation for smooth embeddings of manifolds [details]
• January 17, 2013, Vincent Kusters: On Universal Point Sets for Planar Graphs [details]
• January 29, 2013, Emo Welzl: Upward Planar Orientations of Maximal Planar Graphs [details]

February

• February 07, 2013, Daniel Graf: The Cops and Robbers Problem [details]
• February 14, 2013, Matthias Mnich (Universitaet des Saarlandes): Max-Cut Parameterized above the Edwards-Erdos Bound [details]
• February 19, 2013, Andrea Francke: On Perfect Matchings, Counting, Sampling, and Self-Reducibility [details]
• February 21, 2013, Johannes Lengler: Drift Analysis - with applications to Yet Another Random Decline [details]
• February 26, 2013, Yann Disser (TU Berlin): Stealing with Unknown Knapsack [details]
• February 28, 2013, Pascal Schweitzer: Aspects of the Graph Isomorphism Problem [details]

March

• March 05, 2013, Anna Gundert: A Cheeger Inequality in Dimension 2 [details]
• March 07, 2013, Ueli Peter: Fast Simulation of the IDLA Process [details]
• March 12, 2013, Torsten Mütze: Scheduling with few changes [details]
• March 14, 2013, Asaf Ferber (Tel Aviv University): Counting and packing Hamilton cycles in dense graphs and oriented graphs [details]
• Friday, March 15, 2013, in CAB G11, Christoph Lenzen (Massachusetts Institute of Technology): Early-deciding Consensus is Expensive [details]
• March 19, 2013, Benjamin Doerr (MPI Saarbruecken): Mastermind With Many Colors [details]
• Friday, March 22, 2013, in CAB G11, Jan Vondrak (IBM Almaden Research Center): Online Algorithms for Welfare Maximization in Allocation Problems [details]
• March 26, 2013, Konstantinos Panagiotou (LMU Muenchen): Catching the k-NAESAT Threshold [details]
• Wednesday, March 27, 2013, Dominik Scheder (Aarhus University): After Traxler and Amano: The relationship between average sensitivity, clause size, and solution density [details]
• March 28, 2013, Heuna Kim (Korea Advanced Institute of Science and Technology): On the Numbers of Edges of a Fan-Crossing Free Graph [details]

April

• April 02, 2013, Nemanja Skoric: On Stack Implementations on Turing Machines [details]
• April 04, 2013, Antonis Thomas (University of Edinburgh): Pure Nash Equilibria and Treewidth [details]
• April 09, 2013, Gianpaolo Oriolo (Università degli Studi di Roma): Large decomposition methods for independent sets in claw-free graphs [details]
• April 11, 2013, Michel Verlinden: Sublinear-time algorithms for support vector machines [details]
• April 16, 2013, Matias Korman (Universitat Politècnica de Catalunya): On the Complexity of Barrier Resilience for Fat Regions [details]
• April 18, 2013, Yoichi Iwata (University of Tokyo): Linear Time FPT Algorithms [details]
• April 23, 2013, Thilo Weghorn: Program Extraction in Constructive Analysis with the Proof Assistant MINLOG [details]
• April 25, 2013, Michal Adamaszek (Universität Bremen): Extremal graph theory and flag manifolds [details]
• April 30, 2013, József Solymosi (University of British Columbia): On Erdos' unit distances problem [details]

May

• May 02, 2013, Uli Wagner (Institute of Science and Technology Austria): Helly vs. Betti [details]
• Friday, May 03, 2013, in CAB G11, Nathan Linial (Hebrew University of Jerusalem): Simplicial complexes - A combinatorial perspective [details]
• May 07, 2013, Manuel Wettstein: Algorithms for Counting and Enumerating Crossing-free Perfect Matchings on a Planar Point Set and Related Problems. [details]
• May 14, 2013, Hafsteinn Einarsson: A short survey on bootstrap percolation [details]
• May 16, 2013, Tillmann Miltzow (Freie Universität Berlin): Counting Exchange Stable Matchings [details]
• May 21, 2013, Frank Mousset: Hypergraph Containers [details]
• Wednesday, May 22, 2013, Marc Noy (Universitat Politècnica de Catalunya): Zero-one laws for minor-closed classes of graphs [details]
• May 23, 2013, Komei Fukuda: Searching for a simplex region [details]
• May 28, 2013, Vincent Kusters: Planar Packing of Binary Trees [details]
• May 30, 2013, Sebastian Stich: The Stochastic Bandit Problem [details]

June

• June 04, 2013, Zuzana Safernová (Charles University): Helly vs. Betti II [details]
• June 06, 2013, Timon Hertli: Strong ETH Holds for Regular Resolution [details]
• June 11, 2013, Katarzyna Mieczkowska (Adam Mickiewicz University): On Erdos' conjecture on matchings in hypergraphs [details]
• June 13, 2013, Imre Bárány (Alfréd Rényi Mathematical Institute): Jarnik's convex lattice n-gon for non-symmetric norms [details]
• June 18, 2013, Marek Elias (Charles University): Some Ramsey questions in discrete geometry [details]
• June 20, 2013, Chandan Dubey: Search to Decision Reduction of Unique Shortest Vector Problem [details]

July

• July 02, 2013, Edgardo Roldan-Pensado (University College London): An almost dual of Erdős-Szekeres [details]
• July 04, 2013, Benjamin Matschke: The width of 5-dimensional prismatoids [details]
• July 16, 2013, Hemant Tyagi: Continuum armed bandit problem of few variables in high dimensions [details]
• Wednesday, July 17, 2013, in CAB G11, Mert Saglam (University of Washington): On the communication complexity of sparse set disjointness and exists-equal problems [details]
• July 18, 2013, Julia Pap: Complexity of Hilbert bases, TDL-ness and g-polymatroids [details]
• July 30, 2013, Ralph Keusch: The game chromatic number of dense random graphs [details]
• Wednesday, July 31, 2013, Gal Kronenberg (Tel Aviv University): Random-turn Maker-Breaker games [details]

August

• Wednesday, August 14, 2013, Mathias Schacht (Universität Hamburg): On the structure of dense graphs with small clique number [details]
• August 15, 2013, Chengzhe Tian: Extending Network Motifs by Monotone Systems (Master Thesis) [details]
• August 20, 2013, Sandro Feuz: Conjectured Lower Bounds for Dynamic Problems with a Communication Complexity Advice Model [details]
• August 22, 2013, Christoph Schwirzer: Learning object classification fast [details]
• August 27, 2013, May Szedlák: On the Cheeger Inequality for Simplicial Complexes [details]

September

• September 03, 2013, Stefan Schneider (UC San Diego): A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits [details]
• September 17, 2013, Humberto Naves: The maximum number of q-colorings in graphs [details]
• September 19, 2013, Micha Sharir (Tel Aviv University): Recent progress on incidences and distinct distances: Variants of the Elekes-Ronyai problem [details]
• September 24, 2013, Po-Shen Loh (Carnegie Mellon University): Anarchy is free in network creation [details]
• Wednesday, September 25, 2013, Matan Harel (Courant Institute of Mathematical Sciences): Localization in Random Geometric Graphs with Too Many Edges [details]
• September 26, 2013, Mike Molloy (University of Toronto): Frozen vertices in colourings of a random graph [details]
• Friday, September 27, 2013, in CAB G61, Raimund Seidel (Universität des Saarlandes): Estimating the Number of Triangulations of a Planar Point Set [details]

October

• October 01, 2013, Torsten Mütze: Binary Decision Diagrams - A general-purpose toolkit for combinatorial problems [details]
• October 08, 2013, Johannes Lengler: The (F)utility of Choices [details]
• October 10, 2013, Andreas Noever: A mixed density embedding lemma [details]
• October 15, 2013, Miloš Stojaković (University of Novi Sad): Maker-Breaker games on random geometric graphs [details]
• October 17, 2013, Sebastian Stich: Natural Gradient in Evolution Strategies [details]
• October 22, 2013, Timon Hertli: A Faster Algorithm For Unique 3-SAT [details]
• October 24, 2013, Roman Glebov: Finitely forcible graphons [details]
• October 29, 2013, Felix Weissenberger: Two-Prover Games for Parallel Repetition [details]
• October 31, 2013, Antonis Thomas: Using SETH to prove lower bounds for graph problems with bounded treewidth. [details]

November

• November 05, 2013, Rajko Nenadov: On the threshold for the Maker-Breaker H-game [details]
• November 07, 2013, Kerstin Weller (Univesity of Oxford): Connectivity of relatively bridge-addable classes of graphs [details]
• November 12, 2013, Alexander Pilz (TU Graz): Combinatorial Algorithms for Combinatorial Problems: Selection of Extreme Points [details]
• November 14, 2013, Nemanja Skoric: Hard problems imply efficient derandomization [details]
• Monday, November 18, 2013, Noga Alon (Tel Aviv University and IAS, Princeton): The geometry of majority sequences [details]
• November 19, 2013, Bernd Gärtner: Fourier-Motzkin Elimination [details]
• November 21, 2013, Michael Farber (University of Warwick): Geometry and topology of random 2-dimensional complexes [details]
• Friday, November 22, 2013, in CAB G11, Uli Wagner (Institute of Science and Technology Austria): Can a balloon be shrunk to a point in the presence of obstacles? --- An Introduction to Computational Homotopy Theory [details]
• November 26, 2013, Hafsteinn Einarsson: Controlled Explosions: Restraining Bootstrap Percolation [details]
• November 28, 2013, Frank Mousset: Counting graphs without large cliques [details]

December

• December 03, 2013, Choongbum Lee (MIT): Two approaches to Sidorenko's conjecture [details]
• December 05, 2013, Chandan Dubey: Counting solutions of Quadratic equations over quotient rings [details]
• December 10, 2013, Nick Spooner: Edge-Based Representation Beats Vertex-Based Representation in Shortest-Path Problems [details]
• December 12, 2013, David Conlon (University of Oxford): Cycle Packing [details]
• December 19, 2013, Hemant Tyagi: The adversarial multi-armed bandit problem [details]

2014

January

• January 21, 2014, in CAB G11, Bartosz Walczak (EPFL): On-line coloring games and the chromatic number of geometric intersection graphs [details]
• January 28, 2014, Karl Bringmann (MPI Saarbrücken): Succinct Sampling from Discrete Distributions [details]

February

• February 25, 2014, Wenying Gan: Maximize the number of independent sets of a fixed size [details]
• February 27, 2014, Sonoko Moriyama (Tohoku University): Minimal non-orientable matroids of rank three [details]

March

• March 04, 2014, Peter Allen (London School of Economics): Tight cycles and regular slices in dense hypergraphs [details]
• March 06, 2014, Shai Ben-David (University of Waterloo): Theoretical foundations of clustering - few results and many challenges [details]
• March 11, 2014, Dennis Clemens (Freie Universität Berlin): On the threshold bias of the Oriented-cycle game [details]
• March 13, 2014, Yann Disser (TU Berlin): In defense of Simplex’ worst-case behavior [details]
• March 18, 2014, Chandan Dubey: Peering through the local-to-global lense at Lattices [details]
• March 20, 2014, Ueli Peter: Universality of random graphs [details]
• March 25, 2014, Dávid Kunszenti-Kovács (ELTE University Budapest): Multigraph limits and Banach space labeled graphs [details]
• March 27, 2014, Anita Liebenau (University of Warwick): What is Ramsey-equivalent to the clique? [details]

April

• April 01, 2014, Shagnik Das: Supersaturation for Intersecting Families [details]
• April 03, 2014, Mathias Ermatinger: Generic Algorithms for Scheduling Problems with Changeover Costs [details]
• April 08, 2014, Richard Montgomery (University of Cambridge): Spanning Trees in Random Graphs [details]
• April 10, 2014, Dániel Korándi: K_s,t-saturated bipartite graphs [details]
• April 15, 2014, Micha Sharir (Tel Aviv University): Algebraic techniques for incidence problems [details]
• April 17, 2014, Torsten Mütze: Proof of the middle levels conjecture [details]
• April 24, 2014, Rajko Nenadov: Anti-Ramsey properties of Random Graphs [details]
• April 29, 2014, Isabelle Hurbain-Palatin: Towards the derandomization of the PPSZ algorithm for the multiple satisfying assignments case [details]
• Wednesday, April 30, 2014, Antonis Thomas: Recognizability & Long Cycles in USOs [details]

May

• May 06, 2014, Andreas Noever: Online Ramsey Games in Random Graphs [details]
• May 08, 2014, May Szedlák: Discrete Higher Dimensional Cheeger Inequalities [details]
• Wednesday, May 14, 2014, Hemant Tyagi: Interpolation with cubic splines [details]
• May 15, 2014, Malte Milatz (RWTH Aachen): Methods for Khovanov homology [details]
• Friday, May 16, 2014, in CAB G61, Carola Doerr (Laboratoire d'Informatique de Paris 6): Computing Point Sets of Low Star Discrepancy with Genetic Algorithms [details]
• May 20, 2014, Stephan Seebacher: Simple Wriggling is Hard unless You Are a Fat Hippo [details]
• May 22, 2014, Lothar Narins (FU Berlin): The Connectedness of the Independence Complex of Line Graphs [details]
• May 27, 2014, Nemanja Skoric: Finding an oriented Hamilton cycle in a pseudorandom digraph [details]

June

• June 03, 2014, Hong Liu (University of Illinois at Urbana-Champaign): The typical structure of graphs with no large cliques [details]
• June 05, 2014, Michelle Delcourt (University of Illinois at Urbana-Champaign): Infinite Families of Ramanujan Hypergraphs [details]
• June 10, 2014, Zuzana Safernová (Charles University): Bounds for Pach's selection theorem [details]
• June 17, 2014, in CAB G11, Martin Jaggi: A Short Tutorial on Frank-Wolfe Algorithms for Sparse Convex Optimization [details]
• June 24, 2014, Timon Hertli: Randomized k-SAT counting [details]
• June 26, 2014, Manuel Wettstein: A Census of Planar Triangulations by W. T. Tutte [details]

July

• July 10, 2014, Alexandra Kolla (University of Illinois at Urbana-Champaign): Bottlenecks and Approaches for Refuting the Unique Games Conjecture [details]
• Friday, July 11, 2014, Christian Mueller (New York University): Sparse model estimation and selection with the LASSO and the TREX in systems biology applications [details]
• July 29, 2014, Robin Künzler: A Protocol for Generating Random Elements with their Probabilities [details]

August

• August 26, 2014, in LFW C4, Konstantinos Panagiotou (Mathematisches Institut der Universität München): Scaling Limits for Random Graphs [details]
• August 28, 2014, in LFW C4, Benjamin Doerr (Ecole Polytechnique de Paris): Randomized Rumor Spreading: Easier and More Precise [details]

September

• September 16, 2014, Luis Barba (Carleton University / Université Libre de Bruxelles): Detecting intersections between convex polyhedra [details]
• September 18, 2014, Dániel Korándi: Decomposing random graphs into few cycles and edges [details]
• September 23, 2014, Jan Volec: Subcubic triangle-free graphs have fractional chromatic number at most 14/5 [details]
• September 25, 2014, Florian Meier: Towards Bio-Plausibility of Deep Learning [details]
• September 30, 2014, Pedro Vieira: Almost-Fisher Families [details]

October

• October 02, 2014, Jean Cardinal (Université Libre de Bruxelles): General Position Subsets in d-space [details]
• October 07, 2014, Vincent Kusters: Column Planarity and Partial Simultaneous Geometric Embedding [details]
• October 09, 2014, Jan Hazla: Parallel Repetition from Fortification [details]
• October 14, 2014, Matias Korman (National Institute of Informatics Tokyo): Computing extremal distances in polygonal domains [details]
• October 16, 2014, Antonis Thomas: The Complexity of Searching for a Solution [details]
• October 21, 2014, Michael Krivelevich (Tel Aviv University): Contagious sets in random graphs [details]
• October 23, 2014, May Szedlák: Combinatorial Redundancy Detection [details]
• October 28, 2014, Hemant Tyagi: Efficient sampling for learning SPAMs in high dimensions [details]
• October 30, 2014, Stoyan Dimitrov (University of Sofia): New bounds for the Vertex Folkman number $F(2_{7};5)$ [details]

November

• November 04, 2014, Malte Milatz: Towards better bounds for link homology [details]
• November 06, 2014, Michael Hoffmann: Arc Diagrams, Flip Distances, and Hamiltonian Triangulations [details]
• November 11, 2014, Lenny Fukshansky (Claremont McKenna College): On the Frobenius problem and its generalization [details]
• November 13, 2014, Pál András Papp: 5-edge-weight vertex colorings [details]
• Friday, November 14, 2014, in CAB G11, Matthias Mnich (Universität Bonn): A faster algorithm for parity games [details]
• November 18, 2014, Marvin Künnemann (Max Planck Institute for Informatics): On the Smoothed Approximation Performance of the 2-OPT heuristic [details]
• November 20, 2014, Gal Kronenberg (Tel Aviv University): Maker-Breaker games with one random player [details]
• November 25, 2014, Choongbum Lee (MIT): A lower bound on Grid Ramsey problem [details]
• November 27, 2014, Hafsteinn Einarsson: Towards more efficient one shot learning using inhibition in cell assemblies [details]

December

• December 02, 2014, Frank Mousset: Packing a randomly edge-colored random graph with rainbow k-outs [details]
• December 04, 2014, Rajko Nenadov: Almost-spanning universality in random graphs [details]
• December 09, 2014, Roman Glebov: A probem of Erdos and Sos on 3-graphs [details]
• December 11, 2014, Georg Nührenberg: Improved pruning of large data sets for the minimum enclosing ball problem (Linus Källberg, Thomas Larsson) [details]
• December 16, 2014, Kazuo Iwama (Kyoto University): Read-Once Branching Programs for Tree Evaluation Problems [details]
• December 18, 2014, Nick Spooner: Fixed-Budget Performance of the (1+1)-EA on Linear Functions [details]

2015

January

• January 06, 2015, Otfried Cheong (KAIST): Approximating Convex Shapes to Minimize the Symmetric Difference [details]
• January 20, 2015, Kenneth Clarkson (IBM Research): A Unified Approach to Robust Regression [details]

February

• February 17, 2015, Marcelo Gauy: Erdős-Ko-Rado in Random Families [details]
• February 19, 2015, Jozef Skokan (London School of Economics): An Extension of Dirac's Theorem [details]
• February 24, 2015, Alexander Scott (University of Oxford): Colouring graphs without odd holes [details]
• February 26, 2015, Robert Hildebrand: Complexity of Polynomial Minimization Over Integer Points in Polyhedra [details]

March

• March 03, 2015, Yasuyuki Tsukamoto (Kyoto University): Objects with projection images just like a cube [details]
• March 05, 2015, Bernd Gärtner: Randomly climbing a ladder [details]
• March 10, 2015, Hidefumi Hiraishi (University of Tokyo): Excluded Minors of Rank 3 for Orientable and Representable Matroids [details]
• March 12, 2015, Ralph Keusch: Colorability saturation games [details]
• March 17, 2015, Nina Kamcev: Rainbow Connectivity [details]
• March 19, 2015, Hanna Sumita (University of Tokyo): The Linear Complementarity Problem: Sparsity and Integrality [details]
• March 24, 2015, Matthew Kwan: Cycles and matchings in randomly perturbed digraphs and hypergraphs [details]
• March 26, 2015, Karl Bringmann: Quadratic-Time Hardness for Similarity Measures on Strings and Curves [details]
• March 31, 2015, May Szedlák: Combinatorial Redundancy Detection Algorithm [details]

April

• April 02, 2015, Malte Milatz: The evasiveness conjecture [details]
• April 07, 2015, Frank Mousset: The probability that G(n,p) is triangle-free [details]
• April 09, 2015, Alexandra Maximova: Combinatorial algorithms for Boolean Matrix Multiplication [details]
• April 14, 2015, Andreas Noever: A tight Erdős-Pósa function for long cycles [details]
• April 16, 2015, Jerri Nummenpalo: Extension Complexity of Polytopes - Some Recent Advances [details]
• April 21, 2015, Per Kristian Lehre (University of Nottingham): Level-based Analysis of Evolutionary Algorithms [details]
• April 23, 2015, Rajko Nenadov: Upper bounds for asymmetric Ramsey properties of random hypergraphs [details]
• April 28, 2015, Stephen Chestnut: Streaming space complexity of nearly all functions of one variable [details]
• April 30, 2015, Dániel Korándi: A random triadic process [details]

May

• May 05, 2015, Hafsteinn Einarsson: A learning rule for local homeostatic plasticity [details]
• May 07, 2015, Pedro Vieira: Economically finding structures in random graphs [details]
• May 12, 2015, Luis Barba (Carleton University / Université Libre de Bruxelles): Linear time algorithms for geodesic problems on simple polygons [details]
• May 19, 2015, Brian Cohn (USC Viterbi): Hit-and-Run sampling of neuromechanical polytopes [details]
• May 21, 2015, Antonis Thomas: The Reachability of Unique Sink Orientations [details]
• May 26, 2015, Raúl Penaguião: Non-repetitive sequences and games in paths and graphs [details]
• May 28, 2015, Vincent Kusters: The Complexity of Simultaneous Geometric Graph Embedding [details]

June

• June 09, 2015, Jan Hazla: Same-set expansion on correlated probability spaces [details]
• June 11, 2015, Manuel Wettstein: Vertical Visibility, Upward Triangulations, and 3-dimensional Catalan Numbers [details]
• Monday, June 15, 2015, Annamalai Chidambaram (EPF Lausanne): Combinatorial Algorithm for Restricted Max-Min Fair Allocation [details]
• June 16, 2015, Christof Lutteroth (University of Auckland): Tiling Algebra for Constraint-based Layout Editing [details]
• June 18, 2015, Felix Weissenberger: Bootstrap Percolation with Inhibition: the Role of Edge Delays [details]

July

• July 16, 2015, Andres Ruiz-Vargas (EPF Lausanne): Disjoint edges and empty triangles in topological graphs [details]
• July 21, 2015, Micha Sharir (Tel Aviv University): A new look at rigidity [details]

August

• Wednesday, August 05, 2015, Dominik Scheder (Shanghai Jiaotong University): Decycling Directed Graphs [details]
• August 18, 2015, Andrew Winslow (Université Libre de Bruxelles): Tiling Isohedrally with a Polyomino [details]
• August 25, 2015, Patrick Schnider: Partitions with Plane Spanning Double Stars [details]
• August 27, 2015, Gerald Weber (University of Auckland): Total order is not always best - notes on topological sorting [details]

September

• September 03, 2015, Helmut Alt (FU Berlin): An Approximation Algorithm for Packing Planar Convex Objects [details]
• September 10, 2015, in CAB G61, Jerri Nummenpalo: Efficient computation of middle levels Gray codes [details]
• September 15, 2015, Emo Welzl: Order on Order Types [details]
• September 17, 2015, Alexander Pilz (TU Graz): Good Drawings: Enumeration and Pseudo-Linearity [details]
• September 22, 2015, Yoshio Okamoto (University of Electro-Communications Tokyo): Minimum-Cost b-Edge Dominating Sets on Trees [details]
• September 24, 2015, Frank Mousset: Packing bounded-degree spanning graphs from minor-closed [details]
• September 29, 2015, Jan Volec: Rainbow triangles in 3-edge-colored graphs [details]

October

• October 01, 2015, Pascal Pfister: Strong games played on random graphs [details]
• October 06, 2015, Emo Welzl: Crossing-Free Perfect Matchings in Wheel Configurations [details]
• October 08, 2015, Vincent Kusters: Simultaneous embeddings with few bends and crossings [details]
• October 13, 2015, Christoph Koch (TU Graz): Bootstrap percolation on random hypergraphs [details]
• October 15, 2015, Antonis Thomas: Unique Sink Orientations on the Grid [details]
• October 20, 2015, Nemanja Skoric: On the subgraphs of minimum degree 3 [details]
• October 22, 2015, Elchanan Mossel (U.C. Berkeley and University of Pennsylvania): Shotgun Assembly of Graphs [details]
• October 27, 2015, Felix Weissenberger: On a One-Shot Model for Sequence Learning [details]
• October 29, 2015, Alexey Pokrovskiy: Covering coloured graphs by cycles [details]

November

• November 03, 2015, Lazar Todorovic: Local Search Insertion for k-ways Cuckoo Hashing [details]
• November 05, 2015, Hemant Tyagi: Learning SPAMs with pairwise interaction terms [details]
• November 10, 2015, Johannes Lengler: Geometric Inhomogeneous Random Graphs [details]
• November 12, 2015, Ralph Keusch: Small-world phenomena on Geometric Inhomogeneous Random Graphs [details]
• November 17, 2015, Luis Barba (Carleton University / Université Libre de Bruxelles): Dynamic Graph Coloring [details]
• November 19, 2015, Vitor Bosshard: Pseudo Unique Sink Orientations [details]
• November 24, 2015, Christian Elsholtz (TU Graz): Hilbert cubes in arithmetic sets - or the complexity of squares [details]
• November 26, 2015, Dániel Korándi: Saturation in random graphs [details]

December

• December 01, 2015, Rajko Nenadov: Large degenerate subgraphs of expanding graphs [details]
• Friday, December 04, 2015, in CAB G11, Michael Kaufmann (Universität Tübingen): Book Embedding Problems from a SAT-Solving Perspective [details]
• December 08, 2015, Yann Disser (TU Berlin): Undirected Graph Exploration with Θ(log log n) Pebbles [details]
• December 10, 2015, Rico Zenklusen (IFOR): An O(1)-Approximation for Minimum Spanning Tree Interdiction [details]
• December 15, 2015, Emo Welzl: Embracing Triangles and Simplices [details]
• December 17, 2015, Vincent Kusters: The planar tree packing theorem [details]

2016

January

• January 26, 2016, Pascal Su: Bipartite Kneser graphs are Hamiltonian [details]
• January 28, 2016, Zur Luria (ITS): Discrepancy in high-dimensional permutations [details]

February

• February 23, 2016, Alexander Pilz: Deciding Monotonicity of Good Drawings of the Complete Graph [details]
• February 25, 2016, Marcelo Matheus Gauy: Optimal Densities for Local Synapses in Associative Memories [details]
• Monday, February 29, 2016, Torsten Mütze (TU Berlin): A new combinatorial Gray code for balanced combinations [details]

March

• March 01, 2016, Martin Nägele: Refuting a Conjecture of Goemans on Minimum Bounded Degree Spanning Trees [details]
• March 03, 2016, Rajko Nenadov: Size-Ramsey numbers of bounded-degree triangle-free graphs [details]
• March 08, 2016, Andrea Baggio (IFOR): Firefighting on Trees Beyond Integrality Gaps [details]
• March 10, 2016, Nina Kamcev: Bounded colorings of multipartite graphs [details]
• March 15, 2016, Tomasz Łuczak (Adam Mickiewicz University): Yet another problem concerning Hamiltonian cycles in random graphs [details]
• March 17, 2016, Jared Tanner (University of Oxford): Parallel-l0, a fully parallel algorithm for combinatorial compressed sensing [details]
• March 22, 2016, May Szedlák: Random Sampling with Removal [details]
• March 24, 2016, Jan Hazla: Parallel Repetition and Density Hales-Jewett Theorem [details]
• March 31, 2016, Pascal Pfister: A threshold for the identifiability of the $n \times n$ random jigsaw puzzle [details]

April

• April 05, 2016, Dániel Korándi: Domination in 3-tournaments [details]
• April 07, 2016, Igor Balla: Equiangular Lines [details]
• April 12, 2016, Christian Schneebeli: Randomized algorithms to sample from the boundary of convex polytopes [details]
• April 14, 2016, Matthew Kwan: Counting spanning trees in random regular graphs [details]
• April 19, 2016, Asier Mujika: Practical Algorithms for Generating a Random Ordering of the Elements of a Weighted Set [details]
• April 21, 2016, Alexey Pokrovskiy : Ramsey goodness of paths [details]
• April 26, 2016, Frank Mousset: Lower bounds for online graph exploration [details]
• April 28, 2016, Manuel Wettstein: Crossing-free Geometric Graphs on Wheel Sets [details]

May

• May 03, 2016, Malte Milatz: What is an abstract linear program? [details]
• May 10, 2016, Marko Kabic: Random runners are very lonely [details]
• May 12, 2016, Christian Wieser: Online Ramsey Game for Bow-tie Graphs (Master Thesis) [details]
• May 17, 2016, Ahad N. Zehmakan: Color War on Grid [details]
• May 19, 2016, Asaf Ferber (Yale University): Iterated Log Law for various graph parameters [details]
• Friday, May 20, 2016, in CAB G11, Carsten Lange (TU München): Cayley gaphs of finite Coxeter groups, Colin de Verdiere matrices and convex polytopes [details]
• May 31, 2016, Ralph Keusch: Greedy routing on real-world networks [details]

June

• June 02, 2016, Stephen Chestnut (IFOR): Beating CountSketch for heavy hitters in insertion streams [details]
• June 07, 2016, Annika Heckel (University of Oxford): The chromatic number of dense random graphs [details]
• June 16, 2016, Jerri Nummenpalo: Constant time algorithm for middle levels Gray codes [details]
• Friday, June 17, 2016, in CAB G11, Robert E. Tarjan (Princeton University): Concurrent Disjoint Set Union [details]
• June 21, 2016, Patrick Schnider: A Generalization of Crossing Families [details]
• June 23, 2016, Jan Volec: Minimum number of edges that occur in odd cycles [details]
• June 30, 2016, Florian Meier: How do brains scale? [details]

July

• July 05, 2016, in CAB G11, Miloš Trujić: An extension of Dirac's theorem for sparse graphs (Master Thesis) [details]
• July 12, 2016, in CAB G11, Hafsteinn Einarsson: Fast cell assembly formation [details]

September

• September 06, 2016, in CAB G11, Efi Fogel (Tel Aviv University): Exact Minkowski Sums of Polygons With Holes [details]
• September 08, 2016, in CAB G61, Monique Teillaud (INRIA Nancy - Grand Est): Delaunay triangulations on orientable surfaces of low genus [details]
• September 15, 2016, in CAB G11, Przemek Uznański: Round-Robin Token Propagation: Additive Combinatorics Meets Distributed Load Balancing [details]
• September 20, 2016, Andreas Noever: Smaller subgraphs of minimal degree k [details]
• September 22, 2016, Lazar Todorovic: Size of Separators in GIRGs Depends on Underlying Geometry [details]
• September 27, 2016, Miloš Stojaković (University of Novi Sad): Faster bottleneck non-crossing matchings [details]
• September 29, 2016, Nemanja Skoric: Covering sparse graphs by monochromatic cycles [details]

October

• October 04, 2016, Nina Kamcev: Anagram-free Colourings of Graphs [details]
• October 06, 2016, Matias Korman (Tohoku University): Time-Space Trade-offs for Computing (High Order) Voronoi Diagrams [details]
• October 11, 2016, Chidambaram Annamalai: Finding Perfect Matchings in Bipartite Hypergraphs [details]
• October 13, 2016, Joel Spencer (New York University): The Long Journey of R(3,k) [details]
• October 18, 2016, Felix Dräxler: Spherical Codes in Euclidean Space [details]
• October 20, 2016, Micha Sharir (Tel Aviv University): Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, point location, and a very long title [details]
• October 25, 2016, May Szedlák: Redundancies in Linear Systems with two Variables per Inequality [details]
• October 27, 2016, Antonis Thomas: Exponential paths for history-based pivot rules on abstract cubes [details]

November

• November 01, 2016, Pedro Vieira: Eventowns for multiple intersections [details]
• November 03, 2016, Gregory Gutin (Royal Holloway University of London): A Multivariate Approach for Checking Resiliency in Access Control [details]
• November 08, 2016, Daniel Graf: 2-Reachability is Almost as Easy as Transitive Closure [details]
• November 10, 2016, Ola Svensson (EPFL): Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms [details]
• November 15, 2016, Ralph Keusch: Lower and Upper Bounds for the general Colorability Saturation Game [details]
• November 17, 2016, Amar Vutha (University of Toronto): Three Big Mysteries [details]
• Friday, November 18, 2016, in CAB G11, Jan Foniok (Manchester Metropolitan University): Hereditary graph classes, Bell numbers, and well quasi-ordering [details]
• November 22, 2016, Matthew Kwan: Resilience for the Littlewood-Offord problem [details]
• November 24, 2016, Jonathan Noel: Supersaturation in Posets and Applications Involving the Container Method [details]
• Wednesday, November 30, 2016, Angelika Steger: Deep learning - should you care? [details]

December

• December 01, 2016, Florian Meier: Rumor spreading: Push is fast on sparse random graphs [details]
• December 06, 2016, Fabio Banfi: Ant-Inspired Density Estimation via Random Walks [details]
• December 08, 2016, Miloš Trujić: Local resilience of an almost spanning k-cycle in sparse random graphs [details]
• December 13, 2016, Michal Svagerka: The Power of Two Choices in Distributed Voting [details]
• December 15, 2016, Ahad N. Zehmakan: Biased Majority Cellular Automata [details]
• December 20, 2016, Felix Weissenberger: Fast Rate-Based Plasticity [details]

2017

January

• January 05, 2017, Bernhard Haeupler (Carnegie Mellon University): Synchronization Strings: Optimal Coding for Insertions and Deletions [details]
• January 12, 2017, David Steurer (Cornell Univ., Ithaca, and Inst. of Advanced Study, Princeton): Efficient algorithms for tensor decomposition and their applications [details]
• January 24, 2017, Rajko Nenadov (Monash University): Optimal induced universal graphs for bounded-degree graphs [details]

February

• February 02, 2017, Rati Gelashvili (MIT): Time-Space Trade-Offs in Population Protocols [details]
• February 07, 2017, Dan Alistarh: The Power of Choice in Priority Scheduling [details]
• February 09, 2017, Stefan Weltge (IFOR): Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank [details]
• Friday, February 10, 2017, in CAB G11, Ioannis Emiris (University of Athens): Dimensionality reduction for search in general dimension [details]
• February 14, 2017, Zur Luria (ITS): Hamiltonian spheres in random hypergraphs [details]
• February 16, 2017, Jukka Suomela (Aalto University): Understanding computation with computation [details]
• February 21, 2017, Mohsen Ghaffari: LOCAL Algorithms: The Chasm Between Randomized and Deterministic [details]
• February 23, 2017, Penny Haxell (University of Waterloo): Stability for matchings in regular hypergraphs [details]
• February 28, 2017, Jerri Nummenpalo: Finding One of Many Needles in a Haystack: Searching and Sampling SAT [details]

March

• March 02, 2017, Pascal Pfister: Asymptotically Optimal Amplifiers for the Moran Process [details]
• March 07, 2017, David Adjiashvili (IFOR): Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs [details]
• March 09, 2017, Daniel Kral (University of Warwick): Graph limits and extremal combinatorics [details]
• March 14, 2017, Jara Uitto: Lower Bounds for the Ants Nearby Treasure Search (ANTS) Problem [details]
• March 16, 2017, Shoham Letzter (ITS): Long monochromatic paths in 2-coloured random tournaments [details]
• March 21, 2017, Torsten Mütze (TU Berlin): Trimming and gluing Gray codes [details]
• March 23, 2017, Richard Montgomery (Trinity College, Cambridge): Subdivisions in $C_4$-free graphs [details]
• March 28, 2017, Matija Bucic: Directed Ramsey number for trees [details]
• March 30, 2017, Patrick Schnider: How to share a pizza [details]

April

• April 04, 2017, Malte Milatz: Linear Programs, Violators, and Random Walks [details]
• April 06, 2017, Alexey Pokrovskiy: Fast draws in strong games [details]
• April 11, 2017, Frank Mousset: Minimum degree conditions for large trees [details]
• April 13, 2017, Nemanja Skoric: Bootstrapping graph packing [details]
• April 25, 2017, Manuel Wettstein: An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings [details]
• April 27, 2017, Pascal Su: Labeling Schemes for Rooted Trees [details]

May

• May 02, 2017, Kenneth Clarkson (IBM Research Almaden): Low-rank PSD Approximation in Input-Sparsity Time [details]
• May 04, 2017, Ralph Keusch: Routing in internet-like graphs by using only local information [details]
• May 09, 2017, Miloš Trujić: Local resilience of sparse random graph properties at the threshold [details]
• May 11, 2017, Kilian Risse: Phases of Unique Sink Orientations and Their Role in Finding the Sink [details]
• May 16, 2017, Manuela Fischer: Deterministic Distributed Matching via Rounding [details]
• May 18, 2017, Luis Barba: Subquadratic Algorithms for Algebraic Generalizations of 3SUM [details]
• May 23, 2017, Roger Wattenhofer: Online Matching [details]
• May 30, 2017, Vytautas Gruslys (University of Cambridge): Tilings of high-dimensional spaces [details]

June

• June 01, 2017, Ahad N. Zehmakan: Opinion spreading in random geometry [details]
• June 06, 2017, Mohsen Ghaffari: (Blackboard Talk) Improved LOCAL Algorithms for the Lovasz Local Lemma, with Ramifications on LOCAL Complexities [details]
• June 08, 2017, Jason Li (Carnegie Mellon University): Shortcuts in Excluded Minor Graphs [details]
• Monday, June 26, 2017, Asaf Ferber (MIT): Counting H-free graphs [details]
• June 27, 2017, József Balogh (University of Illinois): An improved lower bound for Folkman's theorem [details]
• Wednesday, June 28, 2017, Marlo Eugster (Master's thesis): Vertex covering by monochromatic cycles [details]
• June 29, 2017, Christoph Koch (University of Warwick): How to (re-)establish a brand: bootstrap percolation in social networks [details]

July

• July 06, 2017, Jara Uitto: Tight Lower Bounds for the Cops and Robbers Game (Practice Talk) [details]
• July 11, 2017, Anders Martinsson (Chalmers University): Edge-orderings and long increasing paths in graphs [details]

August

• August 03, 2017, Peter Davies (University of Warwick): Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks [details]
• August 10, 2017, Christiana Lymouri: Simple and Near-Optimal Distributed Coloring for Sparse Graphs [details]

September

• Monday, September 11, 2017, in CAB G11, Haris Angelidakis (Toyota Technological Institute at Chicago): Algorithms for Stable and Perturbation-Resilient Problems [details]
• September 19, 2017, Emo Welzl: Lower Bounds for Searching Robots, some Faulty [details]
• September 21, 2017, Manuela Fischer: Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching [details]
• September 26, 2017, Alexander Pilz: Arrangements of Approaching Pseudo-Lines [details]
• September 28, 2017, Jakub Tarnawski (EPFL): Matching is in Quasi-NC [details]

October

• October 03, 2017, Ralph Keusch: Edge-coloring graphs against an adversary [details]
• October 05, 2017, Dániel Korándi (EPFL): On the Turán number of ordered forests [details]
• October 10, 2017, Malte Milatz: Random walks on polytopes [details]
• October 12, 2017, Nina Kamcev: Zero forcing in random and pseudorandom graphs [details]
• October 17, 2017, Luis Barba: Convex hulls in the presence of obstacles [details]
• October 19, 2017, Igor Balla: Equiangular Subspaces [details]
• October 24, 2017, Thomas Dueholm Hansen (Aarhus University): Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made [details]
• October 26, 2017, Jara Uitto: Distributed Degree Splitting and Edge Coloring [details]
• October 31, 2017, Omri Ben-Eliezer (Tel Aviv University): The ordered graph removal lemma [details]

November

• November 02, 2017, Dan Alistarh: Computing with Soup: New Results and Techniques in Population Protocols [details]
• November 07, 2017, Dmitry Shabanov (Lomonosov Moscow State University): On the chromatic number of a sparse random hypergraph [details]
• November 09, 2017, Patrick Schnider: Measures of depth for multiple points [details]
• November 14, 2017, Natasha Morrison (University of Oxford): Bootstrap Percolation in the Hypercube [details]
• November 16, 2017, Asier Mujika: Fast-Slow Recurrent Neural Networks [details]
• November 21, 2017, Ahad N. Zehmakan: Majority Model on Random Regular Graphs [details]
• November 23, 2017, Tuan Tran: Erdos-Rothschild problem for intersecting families [details]
• November 28, 2017, Nina Corvelo Benz: Black and White Bin Packing [details]
• November 30, 2017, Charlotte Knierim: Clique coloring of dense random graphs [details]

December

• December 05, 2017, Aleksandr Efremov: Homomorphisms Are a Good Basis for Counting Small Subgraphs [details]
• December 07, 2017, Torsten Mütze: Rainbow cycles in flip graphs [details]
• December 12, 2017, Jerri Nummenpalo: Sparse Kneser graphs are Hamiltonian [details]
• December 14, 2017, Shoham Letzter: Path partitions of regular graphs [details]

2018

January

• January 16, 2018, Olaf Parczyk (Goethe University Frankfurt): Randomly perturbed graphs [details]
• January 30, 2018, Karim Labib: Hamming Distance Completeness & Sparse Matrix Multiplication [details]

February

• February 20, 2018, Anders Martinsson: Segregating Markov chains [details]
• February 22, 2018, Antoine Deza (McMaster University and Université Paris Sud): On lattice polytopes, convex matroid optimization, and degree sequences of hypergraphs [details]
• February 27, 2018, Matija Bucic: Minimum saturated families of sets [details]

March

• March 01, 2018, Alexey Pokrovskiy: Rainbow trees and their applications [details]
• March 06, 2018, Istvan Tomon (EPFL): On the size of k-cross-free families [details]
• March 08, 2018, Florian Meier: Even flying cops should think ahead [details]
• March 13, 2018, Boris Bukh (Carnegie Mellon University): Nearly orthogonal vectors and small antipodal spherical codes [details]
• March 15, 2018, David Steurer: Improved clustering and robust moment estimation via sum-of-squares [details]
• March 20, 2018, Malte Milatz: Random pivoting revisited [details]
• March 22, 2018, Matthew Kwan: Induced subgraphs of Ramsey graphs [details]
• March 27, 2018, Wojciech Samotij (Tel Aviv University): Subsets of posets minimising the number of chains [details]
• March 29, 2018, Sebastian Brandt: A Speed-up Technique for Lower Bounds in the LOCAL Model [details]

April

• April 10, 2018, Pavel Valtr (Charles University): On the maximum crossing number [details]
• April 12, 2018, Thatchaphol Saranurak (KTH Royal Institute of Technology): Dynamic Spanning Forest: Techniques and Connections to Other Fields [details]
• April 17, 2018, Oren Luidor (Technion): How many ants does it take to find some food? [details]
• April 19, 2018, Chih-Hung Liu: A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon [details]
• April 24, 2018, Michael Hoffmann: Two-Planar Graphs Are Quasiplanar [details]
• April 26, 2018, Michael Krivelevich (Tel Aviv University): Getting a prescribed number of edges in a subgraph is polynomially unlikely [details]

May

• May 03, 2018, Bernhard Haeupler (Carnegie Mellon University): Near Optimal Deterministic Document Exchange and Binary Codes for Small Number of Insertions and Deletions [details]
• Friday, May 04, 2018, in CAB G11, Nati Linial (The Hebrew University of Jerusalem): Random simplicial complexes [details]
• May 08, 2018, Nemanja Draganic: Blockers for non-crossing spanning trees in complete geometric graphs [details]
• May 15, 2018, Ahad N. Zehmakan: Bootstrap Percolation [details]
• May 17, 2018, Aaron Potechin (KTH Stockholm): Sum of Squares Lower Bounds from Symmetry and a Good Story [details]
• May 22, 2018, Daan Nilis: An inductive construction for Hamilton cycles in Kneser graphs [details]
• May 24, 2018, Manuela Fischer: Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Sublinear Memory per Machine [details]
• May 29, 2018, Pascal Pfister: H-bootstrap percolation [details]
• May 31, 2018, Manuel Broechin: Counting Triangulations in Subexponential Time [details]

June

• June 05, 2018, Charlotte Knierim: Resilience of triangle factors in random graphs [details]
• June 12, 2018, Tselil Schramm (Harvard): (Nearly) Efficient Algorithms for the Graph Matching Problem in Correlated Random Graphs [details]
• June 14, 2018, Rajko Nenadov: On a Ramsey-Turán variant of the Hajnal-Szemerédi theorem [details]
• June 19, 2018, Johannes Lengler: Evolutionary Algorithms on Monotone Functions [details]
• June 26, 2018, in CHN C 14, Pavel Valtr (Charles University): The exact chromatic number of the convex segment disjointness graph [details]

July

• July 26, 2018, Uli Wagner (IST Austria): Shellability is NP-complete [details]

August

• Wednesday, August 22, 2018, Ulysse Schaller: The (1+1)-EA on Noisy Linear Functions with Random Positive Weights [details]
• August 30, 2018, Sebastian Stich (EPFL): Communication Efficient SGD through Quantization with Memory [details]

September

• September 18, 2018, Pascal Pfister: Optimal strategies for patrolling fences [details]
• September 20, 2018, in CAB G61, Bernd Gärtner: Emo 60 [details]
• September 25, 2018, Manuela Fischer: Local Glauber Dynamics [details]
• September 27, 2018, Jara Uitto: Sparsifying Distributed Algorithms in the Low-Memory Massively Parallel Computation Model [details]

October

• October 02, 2018, Shoham Letzter: Lagrangians of hypergraphs [details]
• October 04, 2018, Johannes Lengler: The univariate marginal distribution algorithm [details]
• October 09, 2018, Mykhaylo Tyomkyn (Tel Aviv University): Two Erdős-Hajnal-type theorems in hypergraphs [details]
• October 11, 2018, Rajko Nenadov: Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties [details]
• October 16, 2018, Jozsef Solymosi (The University of British Columbia): Sums, products and ratios along the edges of a graph [details]
• October 18, 2018, Tuan Tran: Subgraph statistics [details]
• October 23, 2018, Matija Bucic: Nearly-linear monotone paths in edge-ordered graphs [details]
• October 25, 2018, Lenny Fukshansky (Claremont McKenna College): An algebraic perspective on integer sparse recovery [details]
• October 30, 2018, Miloš Trujić: Randomness doubles the power [details]

November

• November 01, 2018, Jerri Nummenpalo: A simple proof of the middle levels theorem [details]
• November 06, 2018, Stefanie Gerke (Royal Holloway University of London): Successive minimal paths in complete graphs with random edge weights [details]
• November 08, 2018, Micha Sharir (Tel Aviv University): Radial isotropic position: Theory, algorithms, and applications [details]
• November 13, 2018, Michael Hoffmann: On Planar Graphs, Books, and Hamiltonian Cycles [details]
• November 15, 2018, Adam Zsolt Wagner: An extremal problem concerning projective cubes [details]
• November 20, 2018, Luis Barba: Testing if V-polytopes and H-polytopes intersect [details]
• November 22, 2018, Justin Dallant: A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings [details]
• November 22, 2018, in CAB G 15.2, Rozhon Vaclav: Approximating edit distance [details]
• November 27, 2018, Patrick Schnider: Ham Sandwich Cuts in Subspaces [details]
• November 29, 2018, Johannes Obenaus: Trapping Games on Random Boards [details]

December

• December 04, 2018, Raphael Kübler: Online Bipartite Matching with Amortized O(log²n) Replacements [details]
• December 06, 2018, Sergey Avvakumov (IST Austria): Convex fair partitions into an arbitrary number of pieces [details]
• December 11, 2018, Miloš Stojaković (University of Novi Sad): Bottleneck bichromatic non-crossing matchings using orbits [details]
• December 13, 2018, Vaggos Chatziafratis (Stanford): Hierarchical Clustering better than Average-Linkage [details]
• December 18, 2018, Jean Cardinal (Université Libre de Bruxelles (ULB)): On the Diameter of Tree Associahedra [details]
• December 20, 2018, Torsten Mütze (TU Berlin): On symmetric chains and Hamilton cycles [details]

2019

January

• January 24, 2019, in CAB G11, Anita Liebenau (UNSW): Asymptotic enumeration of graphs by degree sequence [details]
• January 29, 2019, Kaito Fujii (University of Tokyo): Fast greedy algorithms for dictionary selection with generalized sparsity constraints [details]
• January 31, 2019, Volker Kaibel (OVGU): A Lower Bound on the Extension Complexity of the Correlation Polytope [details]

February

• February 14, 2019, Václav Rozhoň: Embedding trees in dense graphs [details]
• February 19, 2019, Luis Barba: Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees [details]
• February 21, 2019, Igor Balla: The Minrank of Random Graphs over Arbitrary Fields [details]
• February 26, 2019, Patrick Schnider: Center transversals in subspaces [details]
• February 28, 2019, Hung Hoang: ARRIVAL: Intermediate Stops [details]

March

• March 05, 2019, Chih-Hung Liu: A Nearly Optimal Algorithm for Approximate Minimum Selection with Unreliable Comparisons [details]
• March 07, 2019, Sebastian Brandt: A General Distributed Speedup Technique and Its Applications [details]
• March 14, 2019, Torsten Mütze (TU Berlin): Combinatorial generation via permutation languages [details]
• March 19, 2019, Ahad N. Zehmakan: Tight Bounds on the Minimum Size of a Dynamo [details]
• March 21, 2019, Mihyun Kang (TU Graz): Vanishing of cohomology groups of random simplicial complexes [details]
• March 26, 2019, Charlotte Knierim: Improved bounds on the multicolor Ramsey number of paths and even cycles [details]
• March 28, 2019, Boris Klemz (Freie Universität Berlin ): Ordered Level Planarity [details]

April

• April 02, 2019, Alexey Pokrovskiy (Birkbeck, University of London): Slow graph Bootstrap percolation [details]
• April 04, 2019, Csaba D. Tóth (California State University Northridge): Reconstruction of the Crossing Type of a Point Set from the Compatible Exchange Graph of Noncrossing Spanning Trees [details]
• April 09, 2019, Richard Montgomery (University of Birmingham ): Rainbow Spanning Tree Decompositions [details]
• April 11, 2019, Pascal Su: Hajnal-Szemerédi theorem, but without large independent sets [details]
• April 16, 2019, Nicolas Grelier: Approximate strong edge-colouring of unit disk graphs [details]
• April 18, 2019, Seyedrouzbeh Hasheminezhad: Stabilizing Consensus With The Power Of Two Choices [details]
• April 30, 2019, Julian Portmann: Improved Network Decompositions and Applications [details]

May

• May 02, 2019, Louis Abraham: Classic Nintendo Games are (Computationally) Hard (Aloupis et al., 2012) [details]
• Friday, May 03, 2019, in CAB G 11, Thodoris Lykouris (Cornell University): Small-loss bounds for online learning with partial information [details]
• Friday, May 03, 2019, in CAB G 11, Nathan Linial (The Hebrew University of Jerusalem): On the large-scale metric of graphs [details]
• May 07, 2019, Jara Uitto: Massively Parallel Computation of Matching and MIS in Sparse Graphs [details]
• May 09, 2019, Johannes Lengler: Weighted Percolation on Geometric Inhomogeneous Random Graphs [details]
• May 14, 2019, Matija Bucic: Covering random graphs by monochromatic trees and Helly-type results for hypergraphs [details]
• May 16, 2019, Erik Jahn: 2-factors with k cycles in Hamiltonian graphs [details]
• Friday, May 17, 2019, in CAB G59, Yau Guo Xian: A crossing lemma for multigraphs [details]
• May 21, 2019, Yassir Akram: The Adaptive Complexity of Maximizing a Submodular Function (Eric Balkanski, Yaron Singer) [details]
• Wednesday, May 22, 2019, in ML H 44, Domenico Mergoni: Minimal Ramsey Graphs for cyclicity [details]
• May 23, 2019, Yufei Zhao (MIT): Packing superballs [details]
• May 28, 2019, Vincent Tassion: Sharpness of the phase transition via randomized algorithms [details]

June

• June 18, 2019, in CAB G 11, Justin Lewis (UT Austin): Provable Certificates for Adversarial Examples: Fitting a Ball in the Union of Polytopes [details]
• June 27, 2019, in CAB G 11, Maxime Larcher: Win Conditions in Maker-Breaker Games on Uniform Hypergraphs [details]

July

• July 30, 2019, Jasper Lee (Brown University): A Near-Optimal Adaptive Algorithm for Estimating Binary Mixtures of Unknown Coins [details]

September

• September 05, 2019, in CAB G 11, Evanthia Papadopoulou (Università della Svizzera italiana): Abstract Voronoi-like diagrams for trees and forests [details]
• September 17, 2019, Miloš Trujić: Rödl-Ruciński theorem for large graphs [details]
• September 19, 2019, Nicolas Grelier: On the VC-dimension of convex sets and half-spaces [details]
• September 24, 2019, Bettina Speckmann (TU Eindhoven): Preprocessing Ambiguous Imprecise Points [details]
• September 26, 2019, Daniel Bertschinger: Weighted ε-Nets [details]

October

• October 01, 2019, Emo Welzl: Bistellar and edge flip graphs of triangulations in the plane: Geometry and connectivity. [details]
• October 03, 2019, Stefan Glock: High-girth Steiner triple systems and a Turán problem of Brown, Erdős and Sós [details]
• October 08, 2019, István Tomon: Partitioning the Boolean lattice into chains of uniform size [details]
• October 10, 2019, Vaclav Rozhon: Distributed Derandomization via Network Decomposition [details]
• October 15, 2019, Micha Sharir (Tel Aviv University): How to find a point in the convex hull? or: Tukey depth and differential privacy [details]
• October 17, 2019, Patrick Schnider: Bisecting three classes of lines [details]
• October 22, 2019, Manuela Fischer: The Complexity of (Δ+1)-Vertex-Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation [details]
• October 24, 2019, Samuel Hopkins ( UC Berkeley): Robust Mean Estimation in Nearly-Linear Time [details]
• October 29, 2019, Raphael Wegner: Queries for convex Polytopes [details]
• October 31, 2019, Yi-Jun Chang: Distributed Complexity and Automata Theory [details]

November

• November 05, 2019, Charlotte Knierim: Long Cycles, Heavy Cycles and Cycle Decompositions in Directed Graphs [details]
• November 07, 2019, Hung Hoang: Lattice Quotients of the Weak Order [details]
• November 12, 2019, Michael Hoffmann: On Universal Geometric Graphs [details]
• November 14, 2019, Daan Nilis: A Massively Parallel Algorithm for Minimum Weight Vertex Cover [details]
• November 19, 2019, Vincent Cohen-Addad (Sorbonne Université): On the Recent Progress on the Inapproximability of High Dimensional Clustering and the Johnson-Coverage Hypothesis. [details]
• November 21, 2019, Anders Martinsson: Mastermind [details]
• November 26, 2019, Matija Bucic: Erdos-Szekeres theorem for multidimensional arrays [details]
• November 28, 2019, Pascal Su: Chromatic Number of the Random Block Graph [details]

December

• December 03, 2019, Shoham Letzter: Finding monotone patterns [details]
• December 05, 2019, Johannes Obenaus: Spanning Trees with Low (Shallow) Stabbing Number [details]
• December 10, 2019, Sebastian Brandt: Classification of Distributed Binary Labeling Problems [details]
• December 12, 2019, Saeed Ilchi: Multicommodity Routing in Expander Graphs [details]
• December 17, 2019, Chih-Hung Liu: Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions [details]

2020

February

• February 04, 2020, Manfred Scheucher (Technische Universität Berlin): Topological Drawings meet SAT Solvers and Classical Theorems of Convex Geometry [details]
• February 18, 2020, Karim Adiprasito (Hebrew University of Jerusalem): Algorithmic questions in geometric group theory and linear programming [details]
• February 20, 2020, Konstantinos Panagiotou (University of Munich): Weighted Online Search [details]
• February 25, 2020, Krzysztof Nowicki (University of Wroclaw): Faster Algorithms for Edge Connectivity Via Random 2-Out Contractions [details]
• February 27, 2020, Christoph Grunau: Improved Local Computation Algorithm for Set Cover via Sparsification [details]

March

• March 03, 2020, Václav Rozhoň: k-means in the distributed setting [details]
• March 05, 2020, Nadja Seiferth (FU Berlin): Packing 2D disks into a 3D container [details]
• March 10, 2020, Patrick Schnider: Sensible depth measures [details]
• March 19, 2020, in Zoom: https://ethz.zoom.us/j/630077105, Emo Welzl: Sylvester’s Four-Point Problem on Order Types [details]
• March 26, 2020, in Zoom: https://ethz.zoom.us/j/563801169, Julian Portmann: k-means++: few more steps yield constant approximation [details]
• March 31, 2020, in Zoom: https://ethz.zoom.us/j/678050737, Alexey Pokrovskiy (Birkbeck, University of London): A proof of Ringel's conjecture [details]

April

• April 02, 2020, in Zoom: https://ethz.zoom.us/j/696511724, Nemanja Draganic: Universal and unavoidable graphs [details]
• April 07, 2020, in Zoom: conference room, Dániel Korándi (University of Oxford): Exact stability for Turán's theorem [details]
• April 09, 2020, in Zoom: conference room, Meghana M. Reddy: Simple Topological Drawings of k-Planar Graphs [details]
• April 14, 2020, in Zoom: conference room, Daniel Bertschinger: An Optimal Decentralized (Δ + 1)-Coloring Algorithm [details]
• April 16, 2020, in Zoom: conference room, Andreas Galanis (University of Oxford): Counting solutions in the random k-SAT model [details]
• April 21, 2020, in Zoom: conference room, Georg Anegg: Approximation Algorithms for k-Center with Covering Constraints [details]
• April 23, 2020, in Zoom: conference room, Julia Schulte: Reconstruction of convex bodies from moments [details]
• April 28, 2020, in Zoom: conference room, Johannes Lengler: Why do we theory of optimization heuristics? [details]
• April 30, 2020, in Zoom: conference room, Saeed Ilchi: Derandomized balanced allocation [details]

May

• May 05, 2020, in Zoom: conference room, Anders Martinsson: Matroid-restricted coin-weighing [details]
• May 07, 2020, in Zoom: conference room, Miklós Horváth: On Improvements of the Sunflower Lemma [details]
• May 12, 2020, in Zoom: conference room, Xavier Goaoc (Université de Lorraine): Limits of order types [details]
• May 14, 2020, in Zoom: conference room, Nicolas Grelier: Hardness and Approximation of Minimum Convex Partition [details]
• May 19, 2020, in Zoom: conference room, Pascal Su: Hamilton Cycles in Random Graphs [details]
• May 26, 2020, in Zoom: conference room, Tim Taubner: VC dimension of neural networks with rectified activations [details]
• May 28, 2020, in Zoom: conference room, Hung Hoang: Flip Graph of Combinatorial Triangulations [details]

July

• July 02, 2020, in Zoom: conference room, Marc Kaufmann (Imperial College London): Tao's Quantitative Ergodic Theory Proof of Szemerédi's Theorem [details]

August

• August 20, 2020, in Zoom: conference room, Torsten Mütze (University of Warwick): On the central levels problem [details]

September

• September 15, 2020, in Zoom: conference room, Maxime Larcher: Solving Random Jigsaw Puzzles in Polynomial Time [details]
• September 17, 2020, in Zoom: conference room, Sebastian Brandt: Lower Bounds for Ruling Sets in the LOCAL Model [details]
• September 22, 2020, in Zoom: conference room, Abhigyan Ghosh: Extremal Graphs for Ramsey-Turán Numbers [details]
• September 24, 2020, in Zoom: conference room, Thang Pham: Falconer Distance Conjecture: Continuous and Discrete [details]
• September 29, 2020, in Zoom: conference room, Christoph Grunau: Improved Deterministic Network Decomposition [details]

October

• October 01, 2020, in Zoom: conference room, Oliver Janzer: Rainbow Turán number of even cycles [details]
• October 06, 2020, in Zoom: conference room, Lior Gishboliner: Counting Subgraphs in Degenerate Graphs [details]
• October 08, 2020, in Zoom: conference room, Daniel Bertschinger: Tukey Depth Histograms [details]
• October 13, 2020, in Zoom: conference room, Christopher Harshaw (Yale University): Balancing covariates in randomized experiments using the Gram–Schmidt walk [details]
• October 15, 2020, in Zoom: conference room, Meghana M. Reddy: Topological Drawings meet Classical Theorems from Convex Geometry [details]
• October 20, 2020, in Zoom: conference room, Julian Portmann: Tight Bounds for Deterministic High-Dimensional Grid Exploration [details]
• October 22, 2020, in Zoom: conference room, Yi-Jun Chang: Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed Derandomization [details]
• October 27, 2020, in Zoom: conference room, Vaclav Rozhon: Sharp threshold in the complexity of distributed Lovász local lemma [details]
• October 29, 2020, in Zoom: conference room, Jingqiu Ding: Estimating Rank-One Spikes from Heavy-Tailed Noise via Self-Avoiding Walks [details]

November

• November 03, 2020, in Zoom: conference room, Nemanja Draganic: Rolling backwards can move you forward: on embedding problems in sparse expanders [details]
• November 05, 2020, in Zoom: conference room, Ulysse Schaller: Shape of Epidemic Curves in Geometric Inhomogeneous Random Graphs [details]
• November 10, 2020, in Zoom: conference room, Michael Hoffmann: On the Maximum Number of Crossings in Star-Simple Drawings of K_n with No Empty Lens [details]
• November 12, 2020, in Zoom: conference room, Goran Zuzic: Low-Congestion Shortcuts are Universally Optimal for Distributed Computing [details]
• November 17, 2020, in Zoom: conference room, Hung Hoang: Assistance and Interdiction Problems on Interval Graphs [details]
• November 19, 2020, in Zoom: conference room, Tommaso d'Orsi: Sparse PCA: Algorithms, Adversarial Perturbations and Certificates [details]
• November 24, 2020, in Zoom: conference room, Nicolas Grelier: Maximum Clique in Disk-Like Intersection Graphs [details]
• November 26, 2020, in Zoom: conference room, Martin Kucera: Minimum Eccentricity Shortest Path Problem with Respect to Structural Parameters [details]

December

• December 01, 2020, in Zoom: conference room, Simon Weber: Unique Sink Orientations: Constructions and Random Facet [details]
• December 03, 2020, in Zoom: conference room, Saeed Ilchi: Sample Complexity of Learning Simplices [details]
• December 08, 2020, in Zoom: conference room, Nicolas El Maalouly: Towards a Deterministic Polynomial Time Algorithm for Exact Matching [details]
• December 10, 2020, in Zoom: conference room, Anders Martinsson: The edge statistics conjecture for small ℓ [details]
• December 15, 2020, in Zoom: conference room, Domagoj Bradac: Powers of Hamilton cycles of high discrepancy are unavoidable [details]
• December 17, 2020, in Zoom: conference room, Emo Welzl: Deep Cliques in Point Sets [details]

2021

February

• February 23, 2021, in Zoom: conference room, Miloš Trujić: Sparse blow-up lemma for cycles [details]
• February 25, 2021, in Zoom: conference room, Raphael Steiner (TU Berlin): Subdivisions, minors and colorings of digraphs [details]

March

• March 02, 2021, in Zoom: conference room, Istvan Tomon: Ramsey properties of string graphs [details]
• March 04, 2021, in Zoom: conference room, Tim Taubner: Target-oriented Graph Drawings [details]
• March 09, 2021, in Zoom: conference room, Christoph Grunau: A gap in the Randomized Local Computation Complexity Landscape [details]
• March 11, 2021, in Zoom: conference room, Maxime Larcher: A More Efficient Algorithm for the Multi-Armed Bandit Problem with Non-Stationary Reward Distribution [details]
• March 16, 2021, in Zoom: conference room, Stefan Glock: Long induced paths in sparse random graphs [details]
• March 18, 2021, in Zoom: conference room, Meghana M. Reddy: Simple Drawings and Straight Line Drawings of k-planar Graphs [details]
• March 23, 2021, in Zoom: conference room, Vaclav Rozhon: Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics [details]
• March 25, 2021, in Zoom: conference room, Yi-Jun Chang: Tight Distributed Listing of Cliques [details]
• March 30, 2021, in Zoom: conference room, Matija Bucic: Large cliques and independent sets all over the place [details]

April

• April 01, 2021, in Zoom: conference room, Julian Portmann: Distributed Shortest Paths [details]
• April 08, 2021, in Zoom: conference room, David Munha Canas Correia: Tight bounds for powers of Hamilton cycles in tournaments [details]
• April 13, 2021, in Zoom: conference room, Bernd Gärtner: A New Combinatorial Property of Geometric Unique Sink Orientations [details]
• April 15, 2021, in Zoom: conference room, Daniel Bertschinger: A short survey on depth measures [details]
• April 20, 2021, in Zoom: conference room, Peter Zeman (Charles University): Jordan-like characterization of automorphism groups of planar graphs [details]
• April 22, 2021, in Zoom: conference room, Hung Hoang: A Subexponential Algorithm for ARRIVAL [details]
• April 27, 2021, in Zoom: conference room, Michael Krivelevich (Tel Aviv University): Linearly sized induced odd subgraphs [details]
• April 29, 2021, in Zoom: conference room, Sebastian Brandt: Improved Distributed Lower Bounds for MIS and Bounded Degree Dominating Sets on Trees [details]

May

• May 04, 2021, in Zoom: conference room, Nicolas Grelier: Nearest-Neighbor Decompositions of Drawings [details]
• May 06, 2021, in Zoom: conference room, Saeed Ilchi: On List Decoding of Reed-Solomon Codes [details]
• May 11, 2021, in Zoom: conference room, Nicolas El Maalouly: Minimizing the Constraint Violation for Color Constrained Perfect Matchings [details]
• May 18, 2021, in Zoom: conference room, Stefan Tiegel: SoS Degree Reduction with Applications to Clustering and Robust Moment Estimation [details]
• May 20, 2021, in Zoom: conference room, Gleb Novikov: Consistent regression when oblivious outliers overwhelm [details]
• May 25, 2021, in Zoom: conference room, Simon Weber: An Improved Upper Bound for Random Facet [details]
• May 27, 2021, in Zoom: conference room, Charlotte Knierim: Schur's Theorem for randomly perturbed sets [details]

June

• June 01, 2021, in Zoom: conference room, François Clément: Erdős-Falconer distance problem: distribution of distances in five dimensions [details]
• June 03, 2021, in Zoom: conference room, Michal Dory: Distributed Weighted Min Cut in Nearly Optimal Time [details]

September

• September 21, 2021, in CAB G51 and Zoom: conference room, Rajko Nenadov (Google): A new proof of the KŁR conjecture [details]
• September 23, 2021, in CAB G51 and Zoom: conference room, Johannes Lengler: Evolutionary Algorithms in Dynamic Environments [details]
• September 28, 2021, in Zoom: conference room and maybe CAB G51 , Valentin Stoppiello: Edge sets of three dimensional triangulations [details]
• September 30, 2021, in CAB G51 and Zoom: conference room, Oliver Janzer: Counting H-free orientations of graphs [details]

October

• October 05, 2021, in CAB G51 and Zoom: conference room, Manuel Wettstein: ExTeX - Interactive lecture notes and exercises in TeX [details]
• October 07, 2021, in CAB G51 and Zoom: conference room, Maxime Larcher: Solving Static Permutation Mastermind using O(n log n) Queries [details]
• October 12, 2021, in CAB G51 and Zoom: conference room, Stefan Glock: New results for MaxCut in H-free graphs [details]
• October 14, 2021, in CAB G51 and Zoom: conference room, Lior Gishboliner: Cycles of many lengths in Hamiltonian graphs [details]
• October 19, 2021, Christoph Grunau: Improved CONGEST Algorithm for Strong-Diameter Network Decomposition [details]
• October 21, 2021, Goran Zuzic: Universally-Optimal (1+eps)-Approximate Shortest Path and Transshipment in the Distributed Setting [details]
• October 26, 2021, Xavier Goaoc (Université de Lorraine): Shatter Functions with Polynomial Growth Rates [details]
• October 28, 2021, Julian Portmann: Simple and Optimal Pebble Guided Treasure Hunt [details]

November

• November 02, 2021, Domagoj Bradac: Turán numbers of sunflowers [details]
• November 04, 2021, Daniel Rutschmann: Chain Configurations with many Triangulations [details]
• November 09, 2021, Vaclav Rozhon: Distributed Algorithms and Set Theory [details]
• November 11, 2021, Sándor Kisfaludi-Bak: A Gap-ETH-tight approximation scheme for Euclidean TSP [details]
• November 16, 2021, Daniel Bertschinger: Well-Separation and Hyperplane Transversals in High Dimensions [details]
• November 18, 2021, Nicolas El Maalouly: Exact Matching in Graphs with Small Independence Number [details]
• November 23, 2021, Saeed Ilchi: Perfect Matching in the Plane with Small Detour [details]
• November 25, 2021, Anders Martinsson: Additive query games [details]
• November 30, 2021, Ulysse Schaller: The Symmetric Rendezvous Problem [details]

December

• December 02, 2021, Simon Weber: Oriented Matroids and Unique Sink Orientations [details]
• December 07, 2021, Charlotte Knierim: Reconstructibility of the K_r-count from n-1 cards [details]
• December 09, 2021, Kalina Petrova: Resilience of Loose Hamilton Cycles in Random 3-Uniform Hypergraphs [details]
• December 14, 2021, Hung Hoang: Gioan's Theorem for complete bipartite graphs [details]
• December 16, 2021, Rajai Nasser: Robust recovery for stochastic block models [details]
• December 21, 2021, Nicolas Grelier: Improved approximation algorithm for the Minimum Convex Partition problem [details]

2022

February

• February 22, 2022, Meghana M. Reddy: Simplifying Non-simple Fan-Planar Drawings [details]
• February 24, 2022, Eleonora Eichelberg: Computational Complexity of Counting Crossing-free Structures in a Restricted and Augmented Setting [details]

March

• March 01, 2022, Goran Zuzic: A Simple Boosting Framework for Transshipment [details]
• March 03, 2022, Christoph Grunau: A Near-Optimal Deterministic Parallel Algorithm for (1+eps)-Approximate Shortest Paths [details]
• March 08, 2022, Julian Portmann: Average Awake Complexity of MIS and Matching [details]
• March 10, 2022, Daniel Bertschinger: Lions and Contamination [details]
• March 15, 2022, Istvan Tomon: Hyperplane covers of finite spaces [details]
• March 17, 2022, Simon Weber: Training Fully-Connected Neural Networks is ER-Complete [details]
• March 22, 2022, Nemanja Draganic: Induced subgraphs of sparse random graphs [details]
• March 24, 2022, David Munha Canas Correia: Rainbow matchings [details]
• March 29, 2022, Nicolas El Maalouly: Top-k Perfect Matching: Approximation and FPT Algorithms [details]
• March 31, 2022, Joost Jorritsma (Eindhoven University of Technology ): Distance evolutions in growing preferential attachment graphs [details]

April

• April 05, 2022, Saeed Ilchi: Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs [details]
• April 07, 2022, Michal Dory: Fault-Tolerant Labeling and Compact Routing Schemes [details]
• April 12, 2022, Raphael Steiner: New bounds for relatives of Hadwiger's conjecture [details]
• April 14, 2022, Marc Kaufmann: Success-Rate Sensitivity in the Self-Adjusting (1, λ)-EA [details]
• April 26, 2022, Kalina Petrova: Size-Ramsey numbers of subcubic graphs [details]
• April 28, 2022, Lasse Wulf (TU Graz): Non-preemptive tree packing [details]

May

• May 03, 2022, Charlotte Knierim: Hat guessing numbers of strongly degenerate graphs [details]
• May 05, 2022, Miloš Trujić: On the size-Ramsey number of grids [details]
• May 10, 2022, Jean Cardinal (Université Libre de Bruxelles): Diameter estimates for graph associahedra [details]
• May 12, 2022, Hung Hoang: Hardness of Approximating the Rank of a Graph Divisor [details]
• May 17, 2022, Nicolas Grelier: Max clique in disk graphs and Max independent set in graphs with forbidden odd cycles [details]
• May 19, 2022, Tommaso d'Orsi: A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs [details]
• May 24, 2022, Rajai Nasser: Age Distribution in Arbitrary Preemptive Memoryless Networks [details]
• May 31, 2022, Stefan Tiegel: Optimal SQ Lower Bounds for Learning Halfspaces with Massart Noise [details]

June

• June 02, 2022, Ulysse Schaller: Block-monotone subsequences [details]
• June 28, 2022, Arturo Merino (TU Berlin): Efficient generation of rectangulations via permutation languages [details]
• June 30, 2022, Torsten Mütze (University of Warwick): Efficient generation of elimination trees and Hamilton paths on graph associahedra [details]

August

• August 23, 2022, Zhihan Jin: Semi-algebraic And Semi-linear Ramsey Numbers [details]
• August 25, 2022, Emanuel Seemann: Matchings and Hamiltonian cycles in 1-planar graphs [details]

September

• September 15, 2022, in CAB G 56, Alex Black (UC Davis): Small Shadows of Lattice Polytopes [details]
• September 20, 2022, Maxime Larcher: A Random Walk Algorithm for the 2-Armed Bandit [details]
• September 22, 2022, Oliver Janzer: Small subgraphs with large average degree [details]
• September 27, 2022, Miloš Stojaković (University of Novi Sad): Generalised Turan Game [details]
• September 29, 2022, Joel Widmer: Solving systems of linear equations of Matousek matrices in the matrix-vector query model (Master Thesis) [details]

October

• October 04, 2022, Jingqiu Ding: Fast algorithm for random overcomplete order-3 tensor decomposition [details]
• October 06, 2022, Gleb Novikov: Higher degree sum-of-squares relaxations robust against oblivious outliers [details]
• October 18, 2022, Vaclav Rozhon: Thoughts on creating math videos [details]
• October 20, 2022, Meghana M. Reddy: On the Number of Edges in Maximal 2-planar Graphs [details]
• October 25, 2022, Nicolas El Maalouly: Approximation Algorithms for the Exact Matching Problem [details]
• October 27, 2022, Saeed Ilchi: Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates [details]

November

• November 01, 2022, Marc Kaufmann: Hitting time of clique factors in the random graph process [details]
• November 03, 2022, Lior Gishboliner: Polynomial removal lemmas: overview and new results [details]
• November 08, 2022, Raphael Steiner: Splitting digraphs [details]
• November 10, 2022, Johannes Lengler: Two-Dimensional Drift Analysis [details]
• November 15, 2022, Simon Weber: A Universal Construction for Unique Sink Orientations [details]
• November 17, 2022, Charlotte Knierim: Oriented Discrepancy of Hamilton cycles [details]
• November 29, 2022, Kalina Petrova: Minimum degree conditions for spanning linear hypertrees of bounded degree [details]

December

• December 01, 2022, Thomas Bläsius (Karlsruhe Institute of Technology): On the External Validity of Average-Case Analyses of Graph Algorithms [details]
• December 06, 2022, Jozef Skokan (LSE): Graphs with large minimum degree and large girth are three-colourable [details]
• December 08, 2022, Christoph Grunau: Distributed Derandomization via Local Rounding [details]
• December 15, 2022, Abhishek Methuku: A proof of the Erdős–Faber–Lovász conjecture. [details]

2023

February

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

March

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

April

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

May

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

June

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

July

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

September

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

October

• October 03, 2023, in OAT S15/S16/S17, Benjamin O’Sullivan: Edge Operations and the Constrained Transition Problem for Spanning Trees [details]
• October 05, 2023, in CAB G51, Lior Gishboliner: Ramsey problems for monotone paths in graphs and hypergraphs [details]
• October 10, 2023, in OAT S15/S16/S17, Michael Hoffmann: Plane Spanning Trees
 à la Ramsey [details]
• October 12, 2023, in CAB G51, Raphael Steiner: Chromatic number is not tournament-local [details]
• October 26, 2023, in CAB G51, Bernhard von Stengel (London School of Economics and Political Science): Zero-Sum Games and Linear Programming Duality [details]

November

• November 02, 2023, in CAB G51, Simon Weber: (Comically bad) sandwiches and highly separable necklaces: Some FPT algorithms for necklace splitting [details]
• November 07, 2023, in OAT S15/S16/S17, Aurelio Sulser: Ramsey numbers for multiple copies of sparse graphs [details]
• November 14, 2023, in OAT S15/S16/S17, Christos Papadimitriou (Columbia University and Google): Sink equilibria as a solution concept in game theory [details]
• November 16, 2023, in CAB G51, Zhihan Jin: Difference-Isomorphic Graph Families [details]
• November 21, 2023, in OAT S15/S16/S17, Stefan Felsner (TU Berlin): Triangle Flip Graphs of Arrangements of Pseudolines and Pseudocircles [details]
• November 23, 2023, in CAB G51, Patrick Schnider: Cutting cookies: bisections with similar copies [details]
• November 28, 2023, in OAT S15/S16/S17, Adrian Taubner: Exact Matching: Algorithms and Related Problems [details]
• November 30, 2023, in CAB G51, Yuval Wigderson: Ramsey properties of random graphs [details]

December

• December 05, 2023, in OAT X (floor 19), open area, Johannes Lengler: Population Diversity in Neutral Fitness Landscape [details]
• December 07, 2023, in CAB G51, Micha Christoph: The Hamilton space of pseudorandom graphs [details]
• December 12, 2023, in OAT S15/S16/S17, Meghana M. Reddy: The Density Formula: One Lemma to Bound Them All [details]
• December 14, 2023, in CAB G51, Ulysse Schaller: Balanced Bidirectional Breadth-First-Search on Scale-Free Networks [details]
• December 19, 2023, in OAT S15/S16/S17, Marc Kaufmann: Assortativity in Synthetic and Real-World Networks [details]
• December 21, 2023, in CAB G51, Kalina Petrova: On Connectivity in Random Graph Models with Limited Dependencies [details]

2024

February

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

March

• March 05, 2024, 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, 2024, in CAB G51, Noah Kravitz (Princeton University): Can you reconstruct a set from its subset sums? [details]
• March 14, 2024, in CAB G51, Damien Berriaud: Stable Dinner Party Seating Arrangements [details]
• March 21, 2024, in CAB G51, Andrei-Costin Constantinescu: No Checkerboards Allowed! Permutations Satisfying (Non-)Betweenness Constraints in Polynomial Time [details]
• March 26, 2024, in OAT S15/S16/S17, Johannes Lengler: Population Diversity in a Neutral Fitness Landscape [details]
• March 28, 2024, in CAB G51, Simon Weber: Two Choices are Enough: Reductions in UEOPL [details]

April

• April 02, 2024, in CAB G51, Rajko Nenadov (University of Auckland, New Zealand): Global rigidity of random graphs [details]
• April 11, 2024, in CAB G51, Eoin Hurley (University of Amsterdam): Induced Trees in Sparse Expanders [details]
• April 16, 2024, in CAB G51, Simona Boyadzhiyska (University of Birmingham): Ramsey goodness of loose paths [details]
• April 18, 2024, 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, 2024, in OAT S15/S16/S17, Raphael Steiner: Short paths on and diameters of polytopes [details]
• April 25, 2024, in CAB G51, Leon Schiller: Plus Strategies are Exponentially Slower for Planted Optima of Random Height [details]
• April 30, 2024, in OAT S15/S16/S17, Richard Hladik: Fast and Simple Sorting Using Partial Information [details]

May

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

July

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

August

• August 29, 2024, Linus Stalder: α-Necklace-Splitting in Polynomial Time [details]

September

• September 10, 2024, in OAT S15/S16/S17, Frank Neumann (University of Adelaide): Quality Diversity Approaches for Time-Use Optimisation to Improve Health Outcomes [details]
• September 10, 2024, 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, 2024, Simon Meierhans: Simple Dynamic Spanner and News on Dynamic Flow [details]
• September 26, 2024, in CAB G51, Kostas Lakis: Rumour Spreading Depends on the Latent Geometry and Degree Distribution in Social Network Models [details]

October

• October 08, 2024, in OAT X 11 (floor 19), Rares Buhai: Semirandom Planted Clique and the Restricted Isometry Property [details]
• October 10, 2024, in CAB G51, Micha Christoph: Improved bounds for zero-sum cycles in Z_p^d [details]
• October 24, 2024, in CAB G51, Simon Weber: Connections between Search Complexity and Proof Complexity [details]

November

• Wednesday, November 20, 2024, in OAT S13, Yonggang Jiang (Max Planck Institute for Informatics): New Tools and Faster Algorithms for Vertex Connectivity [details]
• November 26, 2024, Frederic Koehler (University of Chicago): Variational Inference, MCMC, and Dense SoftMax-Cut [details]

December

• December 03, 2024, Johannes Lengler: The complex parameter landscape of Estimation of Distribution Algorithms [details]

---

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  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