January 10th, Virtual

February 7th, Virtual

March 7th, Virtual




December 6th, Virtual


  • Vijay Ganesh, University of Waterloo:
    On The Unreasonable Effectiveness of SAT Solvers
  • Ralf Rothenberger, HPI Potsdam:
    The Impact of Heterogeneity and Geometry on the Proof Complexity of Random Satisfiability


November 1st, Virtual


  • Inbal Talgam-Cohen, Technion (Israel Institute of Technology):
    Incomplete Information VCG Contracts for Common Agency
  • Niklas Hahn, Goethe University Frankfurt:
    Delegated Online Search


October 4th, Virtual



August 30th, Virtual


  • Deepak Ajwani, University College Dublin:
    Learning to prune instances of combinatorial optimisation problems
  • Hung Tran, Goethe University Frankfurt:
    An Experimental Study of External Memory Algorithms for Connected Components


August 10th, Virtual


  • John Lapinskas, University of Bristol:
    Spreading Processes on Spatial Contact Networks


July 5th, Virtual


  • Jan Hazla, École Polytechnique Fédérale de Lausanne (EPFL):
    On codes decoding errors on the BEC and BSC
  • Jean Bernoulli Ravelomanana, Goethe University Frankfurt:
    Warning Propagation on Random Graphs


June 7th, Virtual


  • Zach Feinstein, Stevens Institute of Technology:
    Networked Contingent Convertible Obligations and Financial Stability
  • Yannick Gerstorfer, Frankfurt Institute of Advanced Studies (FIAS):
    Stochastical Models for Bipartite Random Graph Models


May 3rd, Virtual


  • Thomas Bläsius, KIT Karlsruhe:
    Theoretical Algorithm Analysis meets Practical Data
  • Philipp Fischbeck, HPI Potsdam:
    Eventually Exponential Contagion via Local and Global Contacts


April 12th, Virtual



March 1st, Virtual


  • George Giakkoupis, IRISA/INRIA Rennes:
    Self-Stabilizing Clock Synchronization with 1-Bit Messages
  • Malin Rau, Hamburg University:
    Using an Oracle for Scheduling Unknown Independent Tasks


February 8th, Virtual


  • Henning Meyerhenke, HU Berlin:
    Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis
  • Manuel Penschuck, Goethe University Frankfurt:
    Simulating Population Protocols in Sub-Constant Time per Interaction

January 11th, Virtual


  • Jonathan Scarlett, National University of Singapore:
    Beyond Sparsity: Compressive Sensing with (Deep) Generative Modeling Assumptions
  • Max Hahn-Klimroth, Goethe University Frankfurt:
    Inference under restrictions - sparsity constrained group testing