Karl Bringmann

European Research Council — Belgium

Computer Science · Physical Sciences

25h-index2.2kcitations216works2.32yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(66), Algorithms and Data Compression(52), Advanced Graph Theory Research(41), Computational Geometry and Mesh Generation(39), Data Management and Algorithms(33)

Publications216 total

A Fine-Grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
2025· 2 cited
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
Logical Methods in Computer Science·2025Open Access
Near-Optimal Directed Low-Diameter Decompositions
Aaltodoc (Aalto University)·2025Open Access
Beating Bellman’s Algorithm for Subset Sum
Society for Industrial and Applied Mathematics eBooks·2025· 1 cited
Average distance in a general class of scale-free networks
Advances in Applied Probability·2024· 3 citedOpen Access
Beating Bellman's Algorithm for Subset Sum
arXiv (Cornell University)·2024Open Access
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
TheoretiCS·2024· 2 citedOpen Access
Approximating Klee's Measure Problem and a Lower Bound for Union Volume Estimation
arXiv (Cornell University)·2024Open Access
Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics
SIAM Journal on Computing·2024
Knapsack with Small Items in Near-Quadratic Time
2024· 7 citedOpen Access
A Fine-grained Classification of Subquadratic Patterns for Subgraph Listing and Friends
arXiv (Cornell University)·2024Open Access
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
2024· 2 citedOpen Access
Fine-Grained Complexity of Earth Mover's Distance under Translation
arXiv (Cornell University)·2024Open Access
Approximating Subset Sum Ratio faster than Subset Sum
Society for Industrial and Applied Mathematics eBooks·2024
Dynamic Dynamic Time Warping
Society for Industrial and Applied Mathematics eBooks·2024· 18 citedOpen Access
The Time Complexity of Fully Sparse Matrix Multiplication
Society for Industrial and Applied Mathematics eBooks·2024· 5 cited
Faster Sublinear-Time Edit Distance
Society for Industrial and Applied Mathematics eBooks·2024· 2 cited
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
arXiv (Cornell University)·2024Open Access
Faster Sublinear-Time Edit Distance
arXiv (Cornell University)·2023Open Access
The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
arXiv (Cornell University)·2023Open Access
page 1 of 11Next →

Frequent Co-authors

Tobias Friedrich(19), Amir Abboud(6), Marvin Künnemann(4), Ralph Keusch(3), Johannes Lengler(3), Danny Hermelin(3), Dvir Shabtay(3), Patrick Klitzke(2), Frank Neumann(2), Markus Wagner(2), Christian Igel(2), T. T. Voss(2), Kasper Green Larsen(2), Κωνσταντίνος Παναγιώτου(2), Wolfgang Mulzer(1), Allan Grønlund(1), Holger Dell(1), Jesper Nederlof(1), Paweł Gawrychowski(1), Shay Mozes(1)