96 citations · 442 across the 64 of their papers we have counts for
86 papers
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 matrices when the matrices are sparse, i.e., when the number of nonzeros…
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 bins is a fundamental optimisation problem in which we are given a set of integers and a capacity and the goal is to partition the set into subsets…
Dynamic and Streaming Algorithms for Union Volume Estimation
Sujoy Bhore, Karl Bringmann, Timothy M. Chan +1
The union volume estimation problem asks to -approximate the volume of the union of given objects . In their seminal wor…
Near-Optimal Directed Low-Diameter Decompositions
Karl Bringmann, Nick Fischer, Bernhard Haeupler +1
Low Diameter Decompositions (LDDs) are invaluable tools in the design of combinatorial graph algorithms. While historically they have been applied mainly to undirected graphs, in t…
Beating Bellman's Algorithm for Subset Sum
Karl Bringmann, Nick Fischer, Vasileios Nakos
Bellman's algorithm for Subset Sum is one of the earliest and simplest examples of dynamic programming, dating back to 1957. For a given set of integers and a target , i…
Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
Karl Bringmann, Kasper Green Larsen, André Nusser +2
Union volume estimation is a classical algorithmic problem. Given a family of objects , we want to approximate the volume of their union. In…