Semidynamic Disk Graphs. → Recording 40 min, password: Olog2Psi

On β-Plurality Points in Spatial Voting Games, recording 38 min, Password beta-1Approximation

1. A subquadratic approximation for Ward's method in agglomerative hierarchical clustering. 2. The sliding token problem (independent set reconfigurations)

On decentralized (Δ+1)-coloring and the drift analysis

Online Algorithms for Self-Organizing Lists in the P^d Model

The minimum constraint removal problem for axis-aligned squares in motion planning

Hop-spanners in unit disk graphs. Recording 38 min, password 5.5nEdges

A fast algorithm for computing the minimum-degree elimination ordering. Recording 43 min, password 2Delta*m+, slides

Bounding the number of walks by polynomials. Recording 41 min, password n^3*Lambda^n

Implementierung und Evaluation eines Routing Algorithmus für polygonale Gebiete

Trees on trees. Recording 45 min, password  O(n^2k+1)

Our current state with connectivity in deletion-only disk graphs. Recording 30 min, password 100smallDisks

An Introduction to and Experimental Examination of The Arrival Game

Measures and necklaces, recording 34 min, password 1:kn-Approximation

Efficiency of Self-Adjusting Heap Variants

Complexity of logical theories. Recording 40 min, password O(2^2^2^n)

Impossible billiard games / How (not) to illuminate a room (completely). Recording 39 min, password 2kAlpha

Recognizing unit disk graphs is NP-hard. Recording 37 min, password 2F-Cages

2D bandwidth. Recording 46 min, password Levels-at-most-19

Some characterizations of treewidth. Recording 40 min, password 2-Chordal

How to burn a graph. Recording 37 min, password Cover-by-123radius

Testing general position in high dimensions is co-NP-hard. Recording 43 min, Password 3SUM-hard

Online scheduling on uniform machines. Recording 41 min, password DOUBLE-is-8-competitive

Motion Planning

Implementierung eines Approximationsalgorithmus zum optimalen Packen konvexer Polygone

Geometric Routing. Recording 34 min, password Theta-6-graph

Separating Words with Small Deterministic Finite Automata

Implementierung und Evaluierung des Suffixbaum-Algorithmus von Ukkonen

A Reminiscence of Frank Hoffmann: About some highlights of his scientific work and about some open problems he tried to solve. → recording 44 min, password 26-competitiveOnlineStrategy

The generalized Vandermonde determinant and Schur polynomials. Slides, recording 32 min, password Jacobi-Trudi-identity-1841

Generalized nested dissection. Slides, recording 43 min, password n^1.5-Time

Experimental evaluation of the runtime properties for a presented reachability oracle for representing the connectivity of transmission graphs

Binary Decision Diagrams, recording 44 min, password: Majority3

Growth of matrix powers, recording 34 min, password: LimSup2lambda

Die Berechnungsmodelle zellulärer Automat, Markow-Algorithmus, Post’sches Tag-System und Zählermaschine

How to represent a continuous piecewise linear function. Slides, recording 40 min, password: only-n+1-Variables

Partitioning a sequence into few monotone subsequences. Slides, Recording 45 min, password ActaInformatica1998

Measures and necklaces, part 2. Recording 38 min, password Thieves3-3

Computing persistent homology: A Morse theory perspective. Recording 44 min, password Morse1928

In this talk, we will see how algebraic Morse theory can be used to obtain filtered chain equivalences between chain complexes described by intermediate matrices in persistence computations. This connection enables us to cast some of the commonly encountered persistence algorithms in terms of algebraic Morse theory. As an application of this framework, we will describe a new algorithm for computing persistence that fully exploits this structure resulting in improved output sensitive complexity bounds. The talk is based on joint work with Ulrich Bauer and Talha bin Masood.

Motion Planning, Part 2. Recording 31 min, password CG-challenge2021

Deletion-Only Connectivity in Disk Graphs. Recording 31 min, password mG4aBy5A

Lower bounds for resolution. Recording 49 min, password Width-2m

Saturated 0-1 matrices. Recording 41 min, password Saturated0-1

Minimization problems in Ramsey theory. Recording 35 min, password saturated-Ramsey(t-1)^2

Mastermind. Recording 43 min, password 2n-by-Log(n)

The Complexity Class Unique End of Potential Line (Mastervortrag)

(Im)proper approximation algorithms. Recording 50 min, password multiplication-in-RAM1974

"Geometric Routing in Theta-Graphs"

"Routing and Stabbing"

The most-likely skyline problem for stochastic points. Recording 38 min, password eps-ADR-in-R3

Preprocessing Imprecise Points for the Pareto Front. Recording 40 min, password Paretofront2

The Mittagsseminar is continued in the summer semester 2021