$LCSk$++: Practical similarity metric for long strings. - Filip Pavetic; Goran Zuzic; Mile Sikic (CoRR, 2014)

Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs. - Bernhard Haeupler; Taisuke Izumi; Goran Zuzic (DISC, 2016)

Broadcasting in Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (PODC, 2017)

Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$. - Filip Pavetic; Ivan Katanic; Gustav Matula; Goran Zuzic; Mile Sikic (CoRR, 2017)

Minor Excluded Network Families Admit Fast Distributed Algorithms. - Bernhard Haeupler; Jason Li 006; Goran Zuzic (PODC, 2018)

Fast and Simple Algorithms for Computing both LCSk and LCSk+. - Filip Pavetic; Ivan Katanic; Gustav Matula; Goran Zuzic; Mile Sikic (Stringology, 2018)

(Near) Optimal Adaptivity Gaps for Stochastic Multi-Value Probing. - Domagoj Bradac; Sahil Singla 001; Goran Zuzic (APPROX-RANDOM, 2019)

Erasure Correction for Noisy Radio Networks. - Keren Censor-Hillel; Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (DISC, 2019)

Network Coding Gaps for Completion Times of Multiple Unicasts. - Bernhard Haeupler; David Wajc; Goran Zuzic (FOCS, 2020)

Robust Algorithms for the Secretary Problem. - Domagoj Bradac; Anupam Gupta 001; Sahil Singla 001; Goran Zuzic (ITCS, 2020)

Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training. - Goran Zuzic; Di Wang 005; Aranyak Mehta; D. Sivakumar 001 (CoRR, 2020)

Hop-constrained oblivious routing. - Mohsen Ghaffari 001; Bernhard Haeupler; Goran Zuzic (STOC, 2021)

Tree embeddings for hop-constrained network design. - Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (STOC, 2021)

Universally-optimal distributed algorithms for known topologies. - Bernhard Haeupler; David Wajc; Goran Zuzic (STOC, 2021)

Deterministic Tree Embeddings with Copies for Algorithms Against Adaptive Adversaries. - Bernhard Haeupler; D. Ellis Hershkowitz; Goran Zuzic (CoRR, 2021)

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based L1-Oblivious Routing. - Goran Zuzic; Gramoz Goranci; Mingquan Ye; Bernhard Haeupler; Xiaorui Sun (CoRR, 2021)

Low-Congestion shortcuts without embedding. - Bernhard Haeupler; Taisuke Izumi; Goran Zuzic (Distributed Comput., 2021)

Adaptive-Adversary-Robust Algorithms via Small Copy Tree Embeddings. - Bernhard Haepler; D. Ellis Hershkowitz; Goran Zuzic (ESA, 2022)

Universally-Optimal Distributed Exact Min-Cut. - Mohsen Ghaffari 001; Goran Zuzic (PODC, 2022)

Brief Announcement: Almost Universally Optimal Distributed Laplacian Solver. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (PODC, 2022)

Universally-Optimal Distributed Shortest Paths and Transshipment via Graph-Based ℓ1-Oblivious Routing. - Goran Zuzic; Gramoz Goranci; Mingquan Ye; Bernhard Haeupler; Xiaorui Sun (SODA, 2022)

Undirected (1+ε)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (STOC, 2022)

Undirected (1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms. - Václav Rozhon; Christoph Grunau; Bernhard Haeupler; Goran Zuzic; Jason Li 006 (CoRR, 2022)

A Simple Boosting Framework for Transshipment. - Goran Zuzic (ESA, 2023)

Sparse Semi-Oblivious Routing: Few Random Paths Suffice. - Goran Zuzic; Bernhard Haeupler; Antti Roeyskoe (PODC, 2023)

Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances. - Václav Rozhon; Bernhard Haeupler; Anders Martinsson; Christoph Grunau; Goran Zuzic (STOC, 2023)

Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts. - Ioannis Anagnostides; Christoph Lenzen 001; Bernhard Haeupler; Goran Zuzic; Themis Gouleakis (Distributed Comput., 2023)

Polylog-Competitive Deterministic Local Routing and Scheduling. - Bernhard Haeupler; Shyamal Patel; Antti Roeyskoe; Cliff Stein 001; Goran Zuzic (STOC, 2024)