Д-р Бернхард Хойплер

Област на изследване: Проектиране и анализ на алгоритми
Google Scholar: връзка

Д-р Хойплер в момента е преподавател в INSAIT. Той получава докторска степен от MIT през 2013 г. Преди това е бил професор в катедрата по компютърни науки в университета Карнеги Мелън, както и старши изследовател в ETH Zurich. Неговите изследователски интереси са фокусирани върху проектирането на алгоритми, разпределените изчисления и теорията на (мрежовото) кодиране.

Неговите изследвания, обхващащи повече от 100 статии, са отличени с множество награди, включително наградата ACM-EATCS за докторска дисертация в областта на разпределените изчисления, наградата George Sproul за дисертация в MIT и други. Неговите изследвания са финансирани от престижни грантове като Sloan Research Fellowship, NSF Career Award и ERC Starting Grant.

Изследователски интереси: Проектиране и анализ на алгоритми за проблеми в пресечната точка на комбинаторната оптимизация, разпределените системи и паралелните изчисления, теорията на кодирането, графичните и мрежовите алгоритми и теорията на мрежовата информация.

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)