Fabian Kühn

University of Freiburg — Germany

Computer Science · Physical Sciences

42h-index7.7kcitations272works1.22yr 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(139), Optimization and Search Problems(102), Mobile Ad Hoc Networks(70), Advanced Graph Theory Research(55), Distributed systems and fault tolerance(46)

Publications272 total

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the \(k\)-Means Problem
Society for Industrial and Applied Mathematics eBooks·2026
Distributed (Δ+1)-Coloring in Graphs of Bounded Neighborhood Independence
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
On the Complexity of Distributed Edge Coloring and Orientation Problems
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2026Open Access
An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
arXiv (Cornell University)·2025Open Access
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond
ACM Transactions on Algorithms·2025
A $(3+\varepsilon)$-Approximate Correlation Clustering Algorithm in Dynamic Streams
TheoretiCS·2025Open Access
Brief Announcement: Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
arXiv (Cornell University)·2025Open Access
Towards Fully Automatic Distributed Lower Bounds
arXiv (Cornell University)·2024· 1 citedOpen Access
Shared Randomness Helps with Local Distributed Problems
arXiv (Cornell University)·2024· 1 citedOpen Access
No Distributed Quantum Advantage for Approximate Graph Coloring
2024· 5 citedOpen Access
Brief Announcement: Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
2024· 1 cited
Brief Announcement: Local Advice and Local Decompression
2024· 3 citedOpen Access
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
2024· 2 citedOpen Access
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
arXiv (Cornell University)·2024Open Access
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
arXiv (Cornell University)·2024Open Access
A Distributed Palette Sparsification Theorem
Society for Industrial and Applied Mathematics eBooks·2024· 3 cited
A (3 + ɛ)-Approximate Correlation Clustering Algorithm in Dynamic Streams
Society for Industrial and Applied Mathematics eBooks·2024· 4 cited
Toward Online Mobile Facility Location on General Metrics
Theory of Computing Systems·2023· 1 citedOpen Access
No distributed quantum advantage for approximate graph coloring
arXiv (Cornell University)·2023· 1 citedOpen Access
Node and edge averaged complexities of local graph problems
Distributed Computing·2023· 1 citedOpen Access
page 1 of 14Next →

Frequent Co-authors

Roger Wattenhofer(13), Rogert Wattenhofer(12), Thomas Moscibroda(10), Aaron Zollinger(8), Mohsen Ghaffari(7), Rotem Oshman(5), Nancy Lynch(3), Dahlia Malkhi(3), Calvin Newport(3), Tim Nieberg(2), Stefan Schmid(2), Yehuda Afek(2), Noga Alon(2), Ziv Bar‐Joseph(2), Alejandro Donohué-Cornejo(2), Bernhard Haeupler(2), Venugopalan Ramasubramanian(2), Mahesh Balakrishnan(2), Seth Gilbert(2), Kunal Talwar(2)