| 2026 | ESA | Robustifying Sparse Matrix Multiplication. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2026 | PODS | Fine-grained Complexity of Database Queries. | Karl Bringmann |
| 2026 | STOC | Fine-Grained Complexity of Continuous Euclidean k-Center. | Lotte Blank, Karl Bringmann, Parinya Chalermsook, Karthik C. S., Benedikt Kolbe, Hung Le, Geert van Wordragen |
| 2026 | STOC | Tight (S)ETH-Based Lower Bounds for Pseudopolynomial Algorithms for Bin Packing and Multi-machine Scheduling. | Karl Bringmann, Anita Drr, Karol Wegrzycki |
| 2025 | ICALP | Near-Optimal Directed Low-Diameter Decompositions. | Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov |
| 2025 | SODA | Beating Bellman's Algorithm for Subset Sum. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2025 | STOC | A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends. | Karl Bringmann, Egor Gorbachev |
| 2024 | ESA | Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing. | Karl Bringmann, Anita Drr, Adam Polak |
| 2024 | ESA | Exploring the Approximability Landscape of 3SUM. | Karl Bringmann, Ahmed Ghazy, Marvin Knnemann |
| 2024 | SODA | The Time Complexity of Fully Sparse Matrix Multiplication. | Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Knnemann |
| 2024 | SODA | Approximating Subset Sum Ratio faster than Subset Sum. | Karl Bringmann |
| 2024 | SODA | Faster Sublinear-Time Edit Distance. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Tomasz Kociumaka |
| 2024 | SODA | Dynamic Dynamic Time Warping. | Karl Bringmann, Nick Fischer, Ivor van der Hoog, Evangelos Kipouridis, Tomasz Kociumaka, Eva Rotenberg |
| 2024 | STOC | Knapsack with Small Items in Near-Quadratic Time. | Karl Bringmann |
| 2023 | ESA | Faster 0-1-Knapsack via Near-Convex Min-Plus-Convolution. | Karl Bringmann, Alejandro Cassis |
| 2023 | FOCS | Negative-Weight Single-Source Shortest Paths in Near-Linear Time: Now Faster! | Karl Bringmann, Alejandro Cassis, Nick Fischer |
| 2023 | SODA | Traversing the FFT Computation Tree for Dimension-Independent Sparse Fourier Transforms. | Karl Bringmann, Michael Kapralov, Mikhail Makarov, Vasileios Nakos, Amir Yagudin, Amir Zandieh |
| 2023 | STOC | Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. | Amir Abboud, Karl Bringmann, Nick Fischer |
| 2022 | ICALP | Faster Knapsack Algorithms via Bounded Monotone Min-Plus-Convolution. | Karl Bringmann, Alejandro Cassis |
| 2022 | ICALP | A Structural Investigation of the Approximability of Polynomial-Time Problems. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Marvin Knnemann |
| 2022 | ICALP | Improved Sublinear-Time Edit Distance for Preprocessed Strings. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
| 2022 | PODS | Tight Fine-Grained Bounds for Direct Access on Join Queries. | Karl Bringmann, Nofar Carmeli, Stefan Mengel |
| 2022 | SODA | Tight Bounds for Approximate Near Neighbor Searching for Time Series under the Frchet Distance. | Karl Bringmann, Anne Driemel, Andr Nusser, Ioannis Psarros |
| 2022 | SODA | Deterministic and Las Vegas Algorithms for Sparse Nonnegative Convolution. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2022 | STOC | Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. | Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir |
| 2022 | STOC | Almost-optimal sublinear-time edit distance in the low distance regime. | Karl Bringmann, Alejandro Cassis, Nick Fischer, Vasileios Nakos |
| 2021 | CiE | Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry. | Karl Bringmann |
| 2021 | ICALP | A Linear-Time n | Karl Bringmann, Debarati Das |
| 2021 | ICALP | Fast n-Fold Boolean Convolution via Additive Combinatorics. | Karl Bringmann, Vasileios Nakos |
| 2021 | ICALP | Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal. | Karl Bringmann, Jasper Slusallek |
| 2021 | SODA | A Fine-Grained Perspective on Approximating Subset Sum and Partition. | Karl Bringmann, Vasileios Nakos |
| 2021 | SODA | On Near-Linear-Time Algorithms for Dense Subset Sum. | Karl Bringmann, Philip Wellnitz |
| 2021 | STOC | Sparse nonnegative convolution is equivalent to dense nonnegative convolution. | Karl Bringmann, Nick Fischer, Vasileios Nakos |
| 2020 | ESA | When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Frchet Distance Under Translation. | Karl Bringmann, Marvin Knnemann, Andr Nusser |
| 2020 | ICALP | Scheduling Lower Bounds via AND Subset Sum. | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
| 2020 | ICALP | Faster Minimization of Tardy Processing Time on a Single Machine. | Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz |
| 2020 | STOC | Top-k-convolution and the quest for near-linear output-sensitive subset sum. | Karl Bringmann, Vasileios Nakos |
| 2019 | ESA | On Geometric Set Cover for Orthants. | Karl Bringmann, Sndor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen |
| 2019 | SODA | SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
| 2019 | SODA | A PTAS for ℓp-Low Rank Approximation. | Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff |
| 2019 | SODA | Frchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. | Karl Bringmann, Marvin Knnemann, Andr Nusser |
| 2019 | SODA | Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. | Karl Bringmann, Marvin Knnemann, Philip Wellnitz |
| 2019 | STOC | Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. | Karl Bringmann, Marvin Knnemann, Karol Wegrzycki |
| 2019 | STACS | Fine-Grained Complexity Theory (Tutorial). | Karl Bringmann |
| 2018 | ICALP | Tighter Connections Between Formula-SAT and Shaving Logs. | Amir Abboud, Karl Bringmann |
| 2018 | SODA | Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). | Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | SODA | Multivariate Fine-Grained Complexity of Longest Common Subsequence. | Karl Bringmann, Marvin Knnemann |
| 2018 | STOC | More consequences of falsifying SETH and the orthogonal vectors conjecture. | Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof |
| 2018 | STOC | Fast fencing. | Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup |
| 2017 | CPM | Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. | Karl Bringmann, Philip Wellnitz |
| 2017 | ESA | Sampling Geometric Inhomogeneous Random Graphs in Linear Time. | Karl Bringmann, Ralph Keusch, Johannes Lengler |
| 2017 | FOCS | Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. | Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Knnemann |
| 2017 | FOCS | A Dichotomy for Regular Expression Membership Testing. | Karl Bringmann, Allan Grnlund, Kasper Green Larsen |
| 2017 | ICALP | Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. | Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger |
| 2017 | PODC | Greedy Routing and the Algorithmic Small-World Phenomenon. | Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla |
| 2017 | SODA | A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum. | Karl Bringmann |
| 2016 | ESA | Hitting Set for Hypergraphs of Low VC-dimension. | Karl Bringmann, Lszl Kozma, Shay Moran, N. S. Narayanaswamy |
| 2016 | FOCS | Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. | Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams |
| 2015 | CEC | Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. | Karl Bringmann, Tobias Friedrich, Patrick Klitzke |
| 2015 | FOCS | Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. | Karl Bringmann, Marvin Knnemann |
| 2015 | ICALP | Ultra-Fast Load Balancing on Scale-Free Networks. | Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald |
| 2015 | ISAAC | Improved Approximation for Frchet Distance on c-packed Curves Matching Conditional Lower Bounds. | Karl Bringmann, Marvin Knnemann |
| 2015 | STACS | Parameterized Complexity Dichotomy for Steiner Multicut. | Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen |
| 2014 | ESA | De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. | Karl Bringmann, Tobias Friedrich, Anton Krohmer |
| 2014 | FOCS | Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. | Karl Bringmann |
| 2014 | GECCO | Two-dimensional subset selection for hypervolume and epsilon-indicator. | Karl Bringmann, Tobias Friedrich, Patrick Klitzke |
| 2014 | ICALP | Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). | Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas |
| 2014 | PPSN | Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. | Karl Bringmann, Tobias Friedrich, Patrick Klitzke |
| 2014 | STACS | Balls into bins via local search: cover time and maximum load. | Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun |
| 2013 | GECCO | Parameterized average-case complexity of the hypervolume indicator. | Karl Bringmann, Tobias Friedrich |
| 2013 | ICALP | Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. | S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar |
| 2013 | ICALP | Online Checkpointing with Improved Worst-Case Guarantees. | Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan |
| 2013 | ICALP | Exact and Efficient Generation of Geometric Random Variates and Random Graphs. | Karl Bringmann, Tobias Friedrich |
| 2013 | MFCS | Bringing Order to Special Cases of Klee's Measure Problem. | Karl Bringmann |
| 2013 | MFCS | Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. | Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao |
| 2013 | STOC | Succinct sampling from discrete distributions. | Karl Bringmann, Kasper Green Larsen |
| 2012 | GECCO | Convergence of hypervolume-based archiving algorithms ii: competitiveness. | Karl Bringmann, Tobias Friedrich |
| 2012 | ICALP | Efficient Sampling Methods for Discrete Distributions. | Karl Bringmann, Konstantinos Panagiotou |
| 2011 | FOGA | The logarithmic hypervolume indicator. | Tobias Friedrich, Karl Bringmann, Thomas Vo, Christian Igel |
| 2011 | GECCO | Convergence of hypervolume-based archiving algorithms I: effectiveness. | Karl Bringmann, Tobias Friedrich |
| 2011 | IJCAI | Approximation-Guided Evolutionary Multi-Objective Optimization. | Karl Bringmann, Tobias Friedrich, Frank Neumann, Markus Wagner |
| 2010 | GECCO | The maximum hypervolume set yields near-optimal approximation. | Karl Bringmann, Tobias Friedrich |
| 2010 | GECCO | Scaling up indicator-based MOEAs by approximating the least hypervolume contributor: a preliminary study. | Thomas Vo, Tobias Friedrich, Karl Bringmann, Christian Igel |
| 2010 | PPSN | Tight Bounds for the Approximation Ratio of the Hypervolume Indicator. | Karl Bringmann, Tobias Friedrich |
| 2009 | EMO | Approximating the Least Hypervolume Contributor: NP-Hard in General, But Fast in Practice. | Karl Bringmann, Tobias Friedrich |
| 2009 | FOGA | Don't be greedy when calculating hypervolume contributions. | Karl Bringmann, Tobias Friedrich |
| 2008 | ISAAC | Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects. | Karl Bringmann, Tobias Friedrich |