ADYN-Seminar

 

2022:

 

October 10th, Virtual

 Speakers:

  • Nicole Megow, University of Bremen:
    Online Routing and Network Design with Predictions
  • tba:
    tba

 

September 19th, Virtual

 Speakers:

  • Stavros Ioannidis (King's College of London) :
    Strong Approximations and Irrationality in Financial Networks with Derivatives

 

September 12th, Virtual

 Speakers:

  • Frank Krauss, Durham University:
    Introducing JUNE - an open-source epidemiological simulation

  • Jan Hązła, EPFL:
    Initial alignment in neural networks and its necessity for learning by gradient descent

 

July 11th, Virtual

 Speakers:

  • Davide Bilò, University of L'Aquila:
    Single-source Shortest p-disjoint Paths: Fast Computation and Sparse Preservers
  • Philipp Fischbeck, HPI Potsdam:
    On the External Validity of Average-Case Analyses of Graph Algorithms

 

June 13th, Virtual

 Speakers:

  • Ruta Mehta,  University of Illinois at Urbana-Champaign:
    Competitive Divison of Goods, Bads, and Mixed
  • Tim Koglin, Goethe University Frankfurt:
    Public Signals in Network Congestion Games

 

May 23rd (originally April 11th), Virtual

 Speakers:

  • Matthias Mnich,  TU Hamburg:
    Similarity-based hierarchical Clustering in Tree-Like Networks
  • Daniel Allendorf, Goethe University Frankfurt:
    Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree-Sequence

 

May 9th, Virtual

 Speakers:

  • Emanuele Natale and Francesco D'Amore,  Université Côte d’Azur:
    Dynamics for Multi-Agent System Coordination in Noisy and Stochastic Environments
  • Dominik Schallmoser, Hamburg University:
    Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions

 

March 7th, Virtual

Speakers:

  • Danupon Nanongkai, University of Copenhagen:
    New Perspectives on Classic Questions in the Theory of Graph Algorithms

 

February 14th, Virtual

Speakers:

  • Dan Vilenchik, Ben-Gurion University of the Negev:
    Semi-Definite Programming meets Stance Classification - how to turn theory into good practice
  • Joon Lee, TU Dortmund:
    The sparse parity matrix

 

 

2021:

 

December 6th, Virtual

Speakers:

  • 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

Speakers:

  • 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

Speakers:

 

August 30th, Virtual

Speakers:

  • 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

Speakers:

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

 

July 5th, Virtual

Speakers:

  • 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

Speakers:

  • 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

Speakers:

  • 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

Speakers:

 

March 1st, Virtual

Speakers:

  • 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

Speakers:

  • 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

Speakers:

  • 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