Dr. Bernhard Haeupler

Research area: Algorithm Design and Analysis
Google Scholar: link

Dr. Haeupler is a faculty at INSAIT and leads the Algorithms and Theory group. He received his PhD from MIT in 2013. Previously he was an Associate Professor of Computer Science at Carnegie Mellon University, as well as a senior researcher at ETH Zurich. He spent time as a Visiting Research Faculty at Google Research and as a (consulting) researcher at Microsoft Research Silicon Valley and New England. His research interests focus on algorithm design, parallel & distributed computing, (network) optimization, information theory, data structures, and (network) coding theory.

His research, spanning more than 100 papers published over the last ten years, has been recognized with numerous awards, including the ACM-EATCS PhD Dissertation Award in Distributed Computing, the George Sprowl Dissertation Award at MIT, and others. His research has been funded by prestigious grants such as a Sloan Research Fellowship, an NSF Career Award, and an ERC Starting Grant.

Research interests: Algorithm design and analysis for problems at the intersection of combinatorial optimization, Distributed systems and parallel computing, Coding theory, Graph and Network Algorithms, and Network Information Theory.

2026

Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
Combinatorial Minimum Cost Flow in Almost-Linear Time on Dense Graphs
In: 67th IEEE Symposium On Foundations Of Computer Science (FOCS 2026)

Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
Reducing Shortcut and Hopset Constructions to Shallow Graphs
In: SIAM Symposium on Simplicity in Algorithms (SOSA 2026)

Paper

Greg Bodwin, Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan
Simple Length-Constrained Expander Decompositions
In: SIAM Symposium on Simplicity in Algorithms (SOSA 2026)

Paper

Sudatta Bhattacharya, Sanjana Dey, Elazar Goldenberg, Mursalin Habib, Bernhard Haeupler, Karthik C. S., Michal Koucký
Constant Rate Isometric Embeddings of Hamming Metric into Edit Metric
In: The 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)

Paper

Bernhard Haeupler, Antti Roeyskoe, Zhijun Zhang
Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness
In: The 53rd International Colloquium on Automata, Languages, and Programming (ICALP 2026)

Paper

Bernhard Haeupler, Richard Hladík, John Iacono, Vaclav Rozhon, Robert Tarjan, Jakub Tětek
Fast and Simple Sorting Using Partial Information
In: Algorithmica International Journal

Paper

Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
DAG Projections: Reducing Distance and Flow Problems to DAGs
In: 58th ACM Symposium on Theory of Computing (STOC 2026)

Paper

Bernhard Haeupler, Yaowei Long, Antti Roeyskoe, Thatchaphol Saranurak
A Constant-Approximation Distance Labeling Scheme under Polynomially Many Edge Failures
In: 58th ACM Symposium on Theory of Computing (STOC 2026)

Paper

Bernhard Haeupler, Yonggang Jiang, Thatchaphol Saranurak
Deterministic Negative-Weight Shortest Paths in Nearly Linear Time via Path Covers
In: 58th ACM Symposium on Theory of Computing (STOC 2026)

Paper

Aaron Bernstein, Henry Fleischmann, Maximilian Probst Gutenberg, Bernhard Haeupler, Gary Hoppenworth, Yonggang Jiang, George Z. Li, Seth Pettie, Thatchaphol Saranurak, Leon Schiller
Reviving Thorup’s Shortcut Conjecture
In: 58th ACM Symposium on Theory of Computing (STOC 2026)

Paper

Bernhard Haeupler, Marc Kaufmann, Raghu Raman Ravi, Ulysse Schaller
Adversarially-Robust Gossip Algorithms for Approximate Quantile and Mean Computations
In: The 17th Innovations in Theoretical Computer Science (ITCS 2026)

Paper

2025

Bernhard Haeupler, Jonas Huebotter, Mohsen Ghaffari
A Cut-Matching Game for Constant-Hop Expanders
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)

Paper

Bernhard Haeupler, Richard Hladík, John Iacono, Vaclav Rozhon, Robert Tarjan, Jakub Tětek
Fast and Simple Sorting Using Partial Information
In: ACM-SIAM Symposium on Discrete Algorithms (SODA 2025)

Paper

Bernhard Haeupler, Richard Hladík, Václav Rozhoň, Robert E. Tarjan, Jakub Tětek
Bidirectional Dijkstra’s Algorithm is Instance-Optimal
In: SIAM Symposium on Simplicity in Algorithms (SOSA 2025)

 

 

Paper

Nick Fischer, Bernhard Haeupler, Rustam Latypov, Antti Roeyskoe, Aurelio Sulser
A Simple Parallel Algorithm with Near-Linear Work for Negative-Weight
In: SIAM Symposium on Simplicity in Algorithms (SOSA 2025)

Paper

Karl Bringmann, Nick Fischer, Bernhard Haeupler, Rustam Latypov
Near-Optimal Directed Low-Diameter Decompositions
In: EATCS International Colloquium on Automata, Languages and Programming (ICALP 2025)

Paper

Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang
Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
In: European Symposium on Algorithms (ESA 2025)

Paper

Bernhard Haeupler, Yonggang Jiang, Yaowei Long, Thatchaphol Saranurak, Shengzhe Wang
Parallel (1+ε)-Approximate Multi-Commodity Mincost Flow in Almost Optimal Depth and Work
In: IEEE Symposium on Foundations of Computer Science (FOCS 2025)

2024

Bernhard Haeupler, Richard Hladík, Vaclav Rozhon, Robert E. Tarjan and Jakub Tětek
Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
In: IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS 2024)

Paper

Bernhard Haeupler, Yaowei Long, Thatchaphol Saranurak
Dynamic Deterministic Constant-Approximate Distance Oracles with 𝑛ϵ Worst-Case Update Time
In: IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS 2024)

Bernhard Haeupler, D Ellis Hershkowitz, Zihan Tan
New Structures and Algorithms for Length-Constrained Expander Decompositions
In: IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS 2024)