| 2026 | ALENEX | Revisiting a Successful Reduction Rule for Dominating Set. | Lukas Geis, Alexander Leonhardt, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck, Lukas Retschmeier |
| 2026 | ESA | Efficient Uniform Negative Edge Weights. | Lukas Geis, Daniel Allendorf, Thomas Blsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, Hung Tran |
| 2025 | ESA | External-Memory Priority Queues with Optimal Insertions. | Gerth Stlting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning |
| 2024 | ESA | Insights into (k, ρ)-Shortcutting Algorithms. | Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck |
| 2023 | ALENEX | Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. | Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran |
| 2023 | WALCOM | Certifying Induced Subgraphs in Large Graphs. | Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis |
| 2022 | ALENEX | Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. | Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald |
| 2020 | ESA | Simulating Population Protocols in Sub-Constant Time per Interaction. | Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran |
| 2019 | ESA | Fragile Complexity of Comparison-Based Algorithms. | Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava |
| 2019 | ESA | Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. | Thomas Blsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand |
| 2019 | ISAAC | On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? | Rolf Fagerberg, David Hammer, Ulrich Meyer |
| 2018 | ESA | Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. | Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner |
| 2018 | ICPP | An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores. | Deepak Ajwani, Erika Duriakova, Neil Hurley, Ulrich Meyer, Alexander Schickedanz |
| 2017 | ALENEX | I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. | Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner |
| 2016 | ALENEX | Generating Massive Scale-Free Networks under Resource Constraints. | Ulrich Meyer, Manuel Penschuck |
| 2016 | PPoPP | GPU multisplit. | Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens |
| 2015 | ALENEX | An I/O-efficient Distance Oracle for Evolving Real-World Graphs. | Deepak Ajwani, Ulrich Meyer, David Veith |
| 2013 | ESA | An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. | Andreas Beckmann, Ulrich Meyer, David Veith |
| 2012 | ESA | I/O-efficient Hierarchical Diameter Approximation. | Deepak Ajwani, Ulrich Meyer, David Veith |
| 2009 | ALENEX | Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. | Ulrich Meyer, Vitaly Osipov |
| 2009 | ISAAC | Online paging for flash memory devices. | Annamria Kovcs, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu |
| 2008 | STACS | On Dynamic Breadth-First Search in External-Memory. | Ulrich Meyer |
| 2007 | ALENEX | Improved External Memory BFS Implementation. | Deepak Ajwani, Ulrich Meyer, Vitaly Osipov |
| 2006 | ESA | I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. | Ulrich Meyer, Norbert Zeh |
| 2006 | SODA | A computational study of external-memory BFS algorithms. | Deepak Ajwani, Roman Dementiev, Ulrich Meyer |
| 2005 | WiMob | A simple improved distributed algorithm for minimum CDS in unit disk graphs. | Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal |
| 2004 | ICALP | External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. | Lars Arge, Ulrich Meyer, Laura Toma |
| 2003 | ESA | Algorithms and Experiments for the Webgraph. | Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn |
| 2003 | ESA | I/O-Efficient Undirected Shortest Paths. | Ulrich Meyer, Norbert Zeh |
| 2002 | ESA | External-Memory Breadth-First Search with Sublinear I/O. | Kurt Mehlhorn, Ulrich Meyer |
| 2002 | SPAA | Heuristics for semi-external depth first search on directed graphs. | Jop F. Sibeyn, James Abello, Ulrich Meyer |
| 2001 | EuroPar | Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. | Ulrich Meyer |
| 2001 | KI | Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. | Stefan Edelkamp, Ulrich Meyer |
| 2001 | SODA | External memory BFS on undirected graphs with bounded degree. | Ulrich Meyer |
| 2001 | SODA | Single-source shortest-paths on arbitrary directed graphs in linear average-case time. | Ulrich Meyer |
| 2001 | WADS | On External-Memory Planar Depth First Search. | Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh |
| 2000 | EuroPar | Parallel Shortest Path for Arbitrary Graphs. | Ulrich Meyer, Peter Sanders |
| 1998 | ESA | Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. | Ulrich Meyer, Peter Sanders |
| 1998 | EuroPar | Gossiping Large Packets on Full-Port Tori. | Ulrich Meyer, Jop F. Sibeyn |
| 1998 | MFCS | A Parallelization of Dijkstra's Shortest Path Algorithm. | Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders |