Towards practical permutation routing on meshes. - Michael Kaufmann 001; Ulrich Meyer 001; Jop F. Sibeyn (SPDP, 1994)

Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator. - Ulrich Meyer 001; Jop F. Sibeyn (EUROSIM, 1995)

Matrix Transpose on Meshes: Theory and Practice. - Michael Kaufmann 001; Ulrich Meyer 001; Jop F. Sibeyn (Comput. Artif. Intell., 1997)

Randomized External-Memory Algorithms for Some Geometric Problems. - Andreas Crauser; Paolo Ferragina; Kurt Mehlhorn; Ulrich Meyer 001; Edgar A. Ramos (SCG, 1998)

I/O-optimal computation of segment intersections. - Andreas Crauser; Paolo Ferragina; Kurt Mehlhorn; Ulrich Meyer 001; Edgar A. Ramos (External Memory Algorithms, 1998)

Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. - Ulrich Meyer 001; Peter Sanders 001 (ESA, 1998)

Gossiping Large Packets on Full-Port Tori. - Ulrich Meyer 001; Jop F. Sibeyn (Euro-Par, 1998)

A Parallelization of Dijkstra's Shortest Path Algorithm. - Andreas Crauser; Kurt Mehlhorn; Ulrich Meyer 001; Peter Sanders 001 (MFCS, 1998)

Parallel Shortest Path for Arbitrary Graphs. - Ulrich Meyer 001; Peter Sanders 001 (Euro-Par, 2000)

An Experimental Study of Priority Queues in External Memory. - Klaus Brengel; Andreas Crauser; Paolo Ferragina; Ulrich Meyer 001 (ACM J. Exp. Algorithmics, 2000)

Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. - Ulrich Meyer 001 (Euro-Par, 2001)

Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. - Stefan Edelkamp; Ulrich Meyer 001 (KI/ÖGAI, 2001)

External memory BFS on undirected graphs with bounded degree. - Ulrich Meyer 001 (SODA, 2001)

Single-source shortest-paths on arbitrary directed graphs in linear average-case time. - Ulrich Meyer 001 (SODA, 2001)

Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. - Andreas Crauser; Paolo Ferragina; Kurt Mehlhorn; Ulrich Meyer 001; Edgar A. Ramos (Int. J. Comput. Geom. Appl., 2001)

Design and analysis of sequential and parallel single-source shortest-paths algorithms. - Ulrich Meyer 001 (2002)

Elementary Graph Algorithms in External Memory. - Irit Katriel; Ulrich Meyer 001 (Algorithms for Memory Hierarchies, 2002)

External-Memory Breadth-First Search with Sublinear I/O. - Kurt Mehlhorn; Ulrich Meyer 001 (ESA, 2002)

Buckets Strike Back: Improved Parallel Shortest Paths. - Ulrich Meyer 001 (IPDPS, 2002)

Heuristics for semi-external depth first search on directed graphs. - Jop F. Sibeyn; James Abello; Ulrich Meyer 001 (SPAA, 2002)

Oblivious Gossiping on Tori. - Ulrich Meyer 001; Jop F. Sibeyn (J. Algorithms, 2002)

Algorithms and Experiments for the Webgraph. - Luigi Laura; Stefano Leonardi 001; Stefano Millozzi; Ulrich Meyer 001; Jop F. Sibeyn (ESA, 2003)

I/O-Efficient Undirected Shortest Paths. - Ulrich Meyer 001; Norbert Zeh (ESA, 2003)

Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. - Ulrich Meyer 001 (J. Algorithms, 2003)

[Delta]-stepping: a parallelizable shortest path algorithm. - Ulrich Meyer 001; Peter Sanders 001 (J. Algorithms, 2003)

On External-Memory Planar Depth First Search. - Lars Arge; Ulrich Meyer 001; Laura Toma; Norbert Zeh (J. Graph Algorithms Appl., 2003)

External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. - Lars Arge; Ulrich Meyer 001; Laura Toma (ICALP, 2004)

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. - Gerth Stølting Brodal; Rolf Fagerberg; Ulrich Meyer 001; Norbert Zeh (SWAT, 2004)

Breadth First Search on Massive Graphs. - Deepak Ajwani; Ulrich Meyer 001; Vitaly Osipov (The Shortest Path Problem, 2006)

I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. - Ulrich Meyer 001; Norbert Zeh (ESA, 2006)

A computational study of external-memory BFS algorithms. - Deepak Ajwani; Roman Dementiev; Ulrich Meyer 001 (SODA, 2006)

An O(n2.75) algorithm for online topological ordering. - Deepak Ajwani; Tobias Friedrich 001; Ulrich Meyer 001 (Electron. Notes Discret. Math., 2006)

Algorithms and Experiments for the Webgraph. - Debora Donato; Luigi Laura; Stefano Leonardi 001; Ulrich Meyer 001; Stefano Millozzi; Jop F. Sibeyn (J. Graph Algorithms Appl., 2006)

A simple improved distributed algorithm for minimum CDS in unit disk graphs. - Stefan Funke; Alexander Kesselman; Ulrich Meyer 001; Michael Segal 001 (ACM Trans. Sens. Networks, 2006)

Improved External Memory BFS Implementation. - Deepak Ajwani; Ulrich Meyer 001; Vitaly Osipov (ALENEX, 2007)

On Dynamic Breadth-First Search in External-Memory. - Ulrich Meyer 001 (STACS, 2008)

On Trade-Offs in External-Memory Diameter-Approximation. - Ulrich Meyer 001 (SWAT, 2008)

Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. - Deepak Ajwani; Itay Malinger; Ulrich Meyer 001; Sivan Toledo (WEA, 2008)

An O(n2.75) algorithm for incremental topological ordering. - Deepak Ajwani; Tobias Friedrich 001; Ulrich Meyer 001 (ACM Trans. Algorithms, 2008)

Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. - Ulrich Meyer 001; Vitaly Osipov (ALENEX, 2009)

Via Detours to I/O-Efficient Shortest Paths. - Ulrich Meyer 001 (Efficient Algorithms, 2009)

Design and Engineering of External Memory Traversal Algorithms for General Graphs. - Deepak Ajwani; Ulrich Meyer 001 (Algorithmics of Large and Complex Networks, 2009)

Online paging for flash memory devices. - Annamária Kovács; Ulrich Meyer 001; Gabriel Moruz; Andrei Negoescu (ISAAC, 2009)

On Computational Models for Flash Memory Devices. - Deepak Ajwani; Andreas Beckmann; Riko Jacob; Ulrich Meyer 001; Gabriel Moruz (SEA, 2009)

New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. - Ulrich Meyer 001; Andrei Negoescu; Volker Weichert (TAPAS, 2011)

Energy-efficient sorting using solid state disks. - Andreas Beckmann; Ulrich Meyer 001; Peter Sanders 001; Johannes Singler (Sustain. Comput. Informatics Syst., 2011)

I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. - Deepak Ajwani; Andreas Beckmann; Ulrich Meyer 001; David Veith (ARCS Workshops, 2012)

Revisiting Wiener's principle of causality - interaction-delay reconstruction using transfer entropy and multivariate analysis on delay-weighted graphs. - Michael Wibral; Patricia Wollstadt; Ulrich Meyer 001; Nicolae Pampu; Viola Priesemann; Raul Vicente (EMBC, 2012)

I/O-efficient Hierarchical Diameter Approximation. - Deepak Ajwani; Ulrich Meyer 001; David Veith (ESA, 2012)

A structural analysis of the A5/1 state transition graph - Andreas Beckmann; Jaroslaw Fedorowicz; Jörg Keller 001; Ulrich Meyer 001 (GRAPHITE, 2012)

I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. - Ulrich Meyer 001; Norbert Zeh (ACM Trans. Algorithms, 2012)

An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. - Andreas Beckmann; Ulrich Meyer 001; David Veith (ESA, 2013)

Algorithm Engineering für moderne Hardware. - Ulrich Meyer 001; Volker Weichert (Inform. Spektrum, 2013)

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 14091). - Alejandro López-Ortiz; Ulrich Carsten Meyer; Robert Sedgewick (Dagstuhl Reports, 2014)

High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). - Ulrich Carsten Meyer; Henning Meyerhenke; Ali Pinar; Ilya Safro (Dagstuhl Reports, 2014)

An I/O-efficient Distance Oracle for Evolving Real-World Graphs. - Deepak Ajwani; Ulrich Meyer 001; David Veith (ALENEX, 2015)

Mechanisms with Monitoring for Truthful RAM Allocation. - Annamária Kovács; Ulrich Meyer 001; Carmine Ventre (WINE, 2015)

A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions. - Patricia Wollstadt; Ulrich Meyer 001; Michael Wibral (CoRR, 2015)

The optimal structure of algorithms for α-paging. - Annamária Kovács; Ulrich Meyer 001; Gabriel Moruz; Andrei Negoescu (Inf. Process. Lett., 2015)

Generating Massive Scale-Free Networks under Resource Constraints. - Ulrich Meyer 001; Manuel Penschuck (ALENEX, 2016)

GPU multisplit. - Saman Ashkiani; Andrew A. Davidson; Ulrich Meyer 001; John D. Owens (PPoPP, 2016)

Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101). - Alejandro López-Ortiz; Ulrich Carsten Meyer; Markus E. Nebel; Robert Sedgewick (Dagstuhl Reports, 2016)

List Ranking. - Riko Jacob; Ulrich Meyer 001; Laura Toma (Encyclopedia of Algorithms, 2016)

I/O-Model. - Norbert Zeh; Ulrich Meyer 001 (Encyclopedia of Algorithms, 2016)

I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. - Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Dorothea Wagner (ALENEX, 2017)

Large-scale Graph Generation and Big Data: An Overview on Recent Results. - Ulrich Meyer 001; Manuel Penschuck (Bull. EATCS, 2017)

GPU Multisplit: An Extended Study of a Parallel Algorithm. - Saman Ashkiani; Andrew A. Davidson; Ulrich Meyer 001; John D. Owens (ACM Trans. Parallel Comput., 2017)

Average-Case Behavior of k-Shortest Path Algorithms. - Alexander Schickedanz; Deepak Ajwani; Ulrich Meyer 001; Pawel Gawrychowski (COMPLEX NETWORKS (1), 2018)

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. - Corrie Jacobien Carstens; Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Dorothea Wagner (ESA, 2018)

An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores. - Deepak Ajwani; Erika Duriakova; Neil Hurley; Ulrich Meyer 001; Alexander Schickedanz (ICPP, 2018)

I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark. - Michael Hamann; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Dorothea Wagner (ACM J. Exp. Algorithmics, 2018)

DFG Priority Programme SPP 1736: Algorithms for Big Data. - Mahyar Behdju; Ulrich Meyer 001 (Künstliche Intell., 2018)

From Big Data to Big Artificial Intelligence? - Algorithmic Challenges and Opportunities of Big Data. - Kristian Kersting; Ulrich Meyer 001 (Künstliche Intell., 2018)

Fragile Complexity of Comparison-Based Algorithms. - Peyman Afshani; Rolf Fagerberg; David Hammer; Riko Jacob; Irina Kostitsyna; Ulrich Meyer 001; Manuel Penschuck; Nodari Sitchinava (ESA, 2019)

On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? - Rolf Fagerberg; David Hammer; Ulrich Meyer 001 (ISAAC, 2019)

Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051). - Gerth Stølting Brodal; Ulrich Carsten Meyer; Markus E. Nebel; Robert Sedgewick (Dagstuhl Reports, 2019)

Communication-free massively distributed graph generation. - Daniel Funke; Sebastian Lamm; Ulrich Meyer 001; Manuel Penschuck; Peter Sanders 001; Christian Schulz 003; Darren Strash; Moritz von Looz (J. Parallel Distributed Comput., 2019)

Simulating Population Protocols in Sub-Constant Time per Interaction. - Petra Berenbrink; David Hammer; Dominik Kaaser; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (ESA, 2020)

Recent Advances in Scalable Network Generation. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (CoRR, 2020)

Algorithms for Big Data. - Ulrich Meyer 001; Ziawasch Abedjan (it Inf. Technol., 2020)

Large-scale graph generation: Recent results of the SPP 1736 - Part II. - Ulrich Meyer 001; Manuel Penschuck (it Inf. Technol., 2020)

An Experimental Study of External Memory Algorithms for Connected Components. - Gerth Stølting Brodal; Rolf Fagerberg; David Hammer; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (SEA, 2021)

Recent Advances in Scalable Network Generation1. - Manuel Penschuck; Ulrik Brandes; Michael Hamann; Sebastian Lamm; Ulrich Meyer 001; Ilya Safro; Peter Sanders 001; Christian Schulz 003 (Massive Graph Analytics, 2022)

Generating Synthetic Graph Data from Random Network Models. - Ulrich Meyer 001; Manuel Penschuck (Algorithms for Big Data, 2022)

Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. - Daniel Allendorf; Ulrich Meyer 001; Manuel Penschuck; Hung Tran; Nick Wormald (ALENEX, 2022)

Efficiently generating geometric inhomogeneous and hyperbolic random graphs. - Thomas Bläsius; Tobias Friedrich 001; Maximilian Katzmann; Ulrich Meyer 001; Manuel Penschuck; Christopher Weyand (Netw. Sci., 2022)

Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. - Daniel Allendorf; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (ALENEX, 2023)

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). - Alexander Leonhardt; Holger Dell; Anselm Haak; Frank Kammer; Johannes Meintrup; Ulrich Meyer 001; Manuel Penschuck (IPEC, 2023)

Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. - Daniel Allendorf; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (J. Parallel Distributed Comput., 2023)

Insights into (k, ρ)-Shortcutting Algorithms. - Alexander Leonhardt; Ulrich Meyer 001; Manuel Penschuck (ESA, 2024)

Uniform Sampling of Negative Edge Weights in Shortest Path Networks. - Lukas Geis; Daniel Allendorf; Thomas Bläsius; Alexander Leonhardt; Ulrich Meyer 001; Manuel Penschuck; Hung Tran (CoRR, 2024)

Machine Learning Augmented Algorithms for Combinatorial Optimization Problems (Dagstuhl Seminar 24441). - Deepak Ajwani; Bistra Dilkina; Tias Guns; Ulrich Carsten Meyer (Dagstuhl Reports, 2024)

Certifying Induced Subgraphs in Large Graphs. - Ulrich Meyer 001; Hung Tran; Konstantinos Tsakalidis (J. Graph Algorithms Appl., 2024)

K-Rho-Shortcutting Heuristics. - Alexander Leonhardt; Ulrich Meyer 001; Manuel Penschuck (DROPS Artifacts, 2024)

Simpler, Better, Faster, Stronger: Revisiting a Successful Reduction Rule for Dominating Set. - Lukas Geis; Alexander Leonhardt; Johannes Meintrup; Ulrich Meyer 001; Manuel Penschuck (CoRR, 2025)