Towards Model-Independent Algorithmic ParadigmsLecture

by Dr Peter Kiss

Tuesday Nov 3, 2026, 9:30 AM → 10:15 AM Europe/Berlin

Endenicher Allee 60/1-016 - Lipschitzsaal (Mathezentrum)

Algorithms for large and evolving graphs operate under different constraints: updates must be processed quickly, only a small fraction of the input may be inspected, or computation must rely on local information. These requirements motivate distinct computational models, yet the algorithmic ideas that succeed in them are often closely related.

The talk explores examples of these connections through recent advances in graph matching, including my own work on dynamic and sublinear algorithms. Building on these examples, I will outline a broader research direction: developing algorithmic paradigms that admit efficient implementations across computational models, and understanding how extremal combinatorial structures shape their complexity.