Bernhard Haeupler

Sofia University "St. Kliment Ohridski" — BG

Computer Science · Physical Sciences

24h-index2.3kcitations243works1.12yr 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(86), Cooperative Communication and Network Coding(60), Optimization and Search Problems(44), Advanced Graph Theory Research(36), Mobile Ad Hoc Networks(31)

Publications243 total

Reducing Shortcut and Hopset Constructions to Shallow Graphs
Society for Industrial and Applied Mathematics eBooks·2026
Simple Length-Constrained Expander Decompositions
Society for Industrial and Applied Mathematics eBooks·2026
Clustering with Label Consistency
arXiv (Cornell University)·2025Open Access
Clustering with Label Consistency
ArXiv.org·2025Open Access
Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
arXiv (Cornell University)·2025Open Access
Parallel $(1+ε)$-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
arXiv (Cornell University)·2025Open Access
Simple Length-Constrained Expander Decompositions
arXiv (Cornell University)·2025Open Access
Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation
arXiv (Cornell University)·2025Open Access
Reducing Shortcut and Hopset Constructions to Shallow Graphs
arXiv (Cornell University)·2025Open Access
Maintaining Routing Structures under Deletions via Self-Pruning
arXiv (Cornell University)·2025Open Access
Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
arXiv (Cornell University)·2025Open Access
Near-Optimal Directed Low-Diameter Decompositions
Aaltodoc (Aalto University)·2025Open Access
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Path
Society for Industrial and Applied Mathematics eBooks·2025· 1 cited
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
arXiv (Cornell University)·2025Open Access
Bidirectional Dijkstra’s Algorithm is Instance-Optimal
Society for Industrial and Applied Mathematics eBooks·2025· 2 cited
A Cut-Matching Game for Constant-Hop Expanders
Society for Industrial and Applied Mathematics eBooks·2025
Fast and Simple Sorting Using Partial Information
Society for Industrial and Applied Mathematics eBooks·2025· 2 cited
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight Single-Source Shortest Paths
arXiv (Cornell University)·2024Open Access
Universal Optimality of Dijkstra Via Beyond-Worst-Case Heaps
2024· 20 cited
Dynamic Deterministic Constant-Approximate Distance Oracles with $n^{\epsilon}$ Worst-Case Update Time
2024· 2 cited
page 1 of 13Next →

Frequent Co-authors

Mohsen Ghaffari(8), Robert E. Tarjan(6), Fabian Kühn(4), Siddhartha Sen(4), Amirbehshad Shahrasbi(4), Ran Gelles(4), Madhu Sudan(3), Goran Žužić(3), Barna Saha(2), Yehuda Afek(2), Noga Alon(2), Ziv Bar‐Joseph(2), Alejandro Donohué-Cornejo(2), Rogers Mathew(2), Stefan Schmid(2), Chen Avin(2), Christian Scheideler(2), Zvi Lotker(2), Klim Efremenko(2), Ofer Feinerman(2)