K. Bringmann

activity

20242026

most citedTight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing 2026Show all

3 papers · 1 filter

cs.DS2026

Robustifying Sparse Matrix Multiplication

Karl Bringmann, Nick Fischer, Vasileios Nakos

In the seminal sparse matrix multiplication problem the goal is to compute the product of two $n \times n$ matrices when the matrices are sparse, i.e., when the number of nonzeros…

cs.DS2026★ 1 cited

Tight (S)ETH-based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-Machine Scheduling

Karl Bringmann, Anita DÃ¼rr, Karol WÄgrzycki

Bin Packing with $k$ bins is a fundamental optimisation problem in which we are given a set of $n$ integers and a capacity $T$ and the goal is to partition the set into $k$ subsets…

cs.CG2026

Dynamic and Streaming Algorithms for Union Volume Estimation

Sujoy Bhore, Karl Bringmann, Timothy M. Chan +1

The union volume estimation problem asks to $(1 \pm ε)$ -approximate the volume of the union of $n$ given objects $X_{1}, \dots, X_{n} \subset R^{d}$ . In their seminal wor…