Ulrich Meyer - RankMe

118 papers A* 4A 25B 11Journal 43Unranked 26

Year	Rank	Type	Title / Venue / Authors
2026	A	`conf`	Revisiting a Successful Reduction Rule for Dominating Set. ALENEX Lukas Geis, Alexander Leonhardt, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck, Lukas Retschmeier
2025	A	`conf`	External-Memory Priority Queues with Optimal Insertions. ESA Gerth Stølting Brodal, Michael T. Goodrich, John Iacono, Jared Lo, Ulrich Meyer, Victor Pagan, Nodari Sitchinava, Rolf Svenning
2025	J	`jnl`	Simpler, Better, Faster, Stronger: Revisiting a Successful Reduction Rule for Dominating Set. CoRR Lukas Geis, Alexander Leonhardt, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck
2024	J	`jnl`	Certifying Induced Subgraphs in Large Graphs. J. Graph Algorithms Appl. Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis
2024	A	`conf`	Insights into (k, ρ)-Shortcutting Algorithms. ESA Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck
2024	J	`jnl`	Insights into (k, ρ)-shortcutting algorithms. CoRR Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck
2024	J	`jnl`	Uniform Sampling of Negative Edge Weights in Shortest Path Networks. CoRR Lukas Geis, Daniel Allendorf, Thomas Bläsius, Alexander Leonhardt, Ulrich Meyer, Manuel Penschuck, Hung Tran
2023	B	`conf`	Certifying Induced Subgraphs in Large Graphs. WALCOM Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis
2023	B	`conf`	PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM). IPEC Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, Manuel Penschuck
2023	A	`conf`	Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. ALENEX Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
2023	J	`jnl`	Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees. J. Parallel Distributed Comput. Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
2022	—	`ed.`	Algorithms for Big Data - DFG Priority Program 1736 Algorithms for Big Data Hannah Bast, Claudius Korzen, Ulrich Meyer, Manuel Penschuck
2022	J	`jnl`	Certifying Induced Subgraphs in Large Graphs. CoRR Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis
2022	J	`jnl`	Efficiently generating geometric inhomogeneous and hyperbolic random graphs. Netw. Sci. Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2022	A	`conf`	Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. ALENEX Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald
2022	—	`ch.`	Generating Synthetic Graph Data from Random Network Models. Algorithms for Big Data Ulrich Meyer, Manuel Penschuck
2022	A	`conf`	Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. IPDPS Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
2022	J	`jnl`	Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment. CoRR Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
2022	—	`ch.`	Recent Advances in Scalable Network Generation1. Massive Graph Analytics Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz
2021	B	`conf`	An Experimental Study of External Memory Algorithms for Connected Components. SEA Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, Hung Tran
2021	J	`jnl`	Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence. CoRR Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, Nick Wormald
2021	J	`jnl`	Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees. CoRR Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran
2020	J	`jnl`	Algorithms for Big Data. it Inf. Technol. Ulrich Meyer, Ziawasch Abedjan
2020	J	`jnl`	Large-scale graph generation: Recent results of the SPP 1736 - Part II. it Inf. Technol. Ulrich Meyer, Manuel Penschuck
2020	J	`jnl`	Recent Advances in Scalable Network Generation. CoRR Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, Christian Schulz
2020	A	`conf`	Simulating Population Protocols in Sub-Constant Time per Interaction. ESA Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran
2020	J	`jnl`	Simulating Population Protocols in Sub-Constant Time per Interaction. CoRR Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, Hung Tran
2019	J	`jnl`	Communication-free massively distributed graph generation. J. Parallel Distributed Comput. Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
2019	A	`conf`	Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. ESA Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019	J	`jnl`	Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs. CoRR Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
2019	A	`conf`	Fragile Complexity of Comparison-Based Algorithms. ESA Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
2019	J	`jnl`	Fragile Complexity of Comparison-Based Algorithms. CoRR Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
2019	B	`conf`	On Optimal Balance in B-Trees: What Does It Cost to Stay in Perfect Shape? ISAAC Rolf Fagerberg, David Hammer, Ulrich Meyer
2018	B	`conf`	An Empirical Comparison of k-Shortest Simple Path Algorithms on Multicores. ICPP Deepak Ajwani, Erika Duriakova, Neil Hurley, Ulrich Meyer, Alexander Schickedanz
2018	—	`conf`	Average-Case Behavior of k-Shortest Path Algorithms. COMPLEX NETWORKS (1) Alexander Schickedanz, Deepak Ajwani, Ulrich Meyer, Pawel Gawrychowski
2018	J	`jnl`	DFG Priority Programme SPP 1736: Algorithms for Big Data. Künstliche Intell. Mahyar Behdju, Ulrich Meyer
2018	J	`jnl`	From Big Data to Big Artificial Intelligence? - Algorithmic Challenges and Opportunities of Big Data. Künstliche Intell. Kristian Kersting, Ulrich Meyer
2018	J	`jnl`	I/O-Efficient Generation of Massive Graphs Following the ACM J. Exp. Algorithmics Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
2018	A	`conf`	Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. ESA Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
2018	J	`jnl`	Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades. CoRR Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
2017	J	`jnl`	GPU Multisplit. CoRR Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens
2017	J	`jnl`	GPU Multisplit: An Extended Study of a Parallel Algorithm. ACM Trans. Parallel Comput. Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens
2017	A	`conf`	I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. ALENEX Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner
2017	J	`jnl`	Large-scale Graph Generation and Big Data: An Overview on Recent Results. Bull. EATCS Ulrich Meyer, Manuel Penschuck
2016	B	`conf`	GPU multisplit. PPoPP Saman Ashkiani, Andrew A. Davidson, Ulrich Meyer, John D. Owens
2016	A	`conf`	Generating Massive Scale-Free Networks under Resource Constraints. ALENEX Ulrich Meyer, Manuel Penschuck
2016	—	`ch.`	I/O-Model. Encyclopedia of Algorithms Norbert Zeh, Ulrich Meyer
2016	J	`jnl`	I/O-efficient Generation of Massive Graphs Following the LFR Benchmark. CoRR Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner
2016	—	`ch.`	List Ranking. Encyclopedia of Algorithms Riko Jacob, Ulrich Meyer, Laura Toma
2015	J	`jnl`	A Graph Algorithmic Approach to Separate Direct from Indirect Neural Interactions. CoRR Patricia Wollstadt, Ulrich Meyer, Michael Wibral
2015	A	`conf`	An I/O-efficient Distance Oracle for Evolving Real-World Graphs. ALENEX Deepak Ajwani, Ulrich Meyer, David Veith
2015	—	`conf`	Mechanisms with Monitoring for Truthful RAM Allocation. WINE Annamária Kovács, Ulrich Meyer, Carmine Ventre
2015	J	`jnl`	The optimal structure of algorithms for α-paging. Inf. Process. Lett. Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
2014	A	`ed.`	2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2014, Portland, Oregon, USA, January 5, 2014 ALENEX Catherine C. McGeoch, Ulrich Meyer
2013	J	`jnl`	Algorithm Engineering für moderne Hardware. Inform. Spektrum Ulrich Meyer, Volker Weichert
2013	A	`conf`	An Implementation of I/O-Efficient Dynamic Breadth-First Search Using Level-Aligned Hierarchical Clustering. ESA Andreas Beckmann, Ulrich Meyer, David Veith
2012	—	`conf`	A structural analysis of the A5/1 state transition graph GRAPHITE Andreas Beckmann, Jaroslaw Fedorowicz, Jörg Keller, Ulrich Meyer
2012	A	`conf`	I/O-efficient Hierarchical Diameter Approximation. ESA Deepak Ajwani, Ulrich Meyer, David Veith
2012	—	`conf`	I/O-efficient approximation of graph diameters by parallel cluster growing - a first experimental study. ARCS Workshops Deepak Ajwani, Andreas Beckmann, Ulrich Meyer, David Veith
2012	J	`jnl`	I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths. ACM Trans. Algorithms Ulrich Meyer, Norbert Zeh
2012	—	`conf`	Revisiting Wiener's principle of causality - interaction-delay reconstruction using transfer entropy and multivariate analysis on delay-weighted graphs. EMBC Michael Wibral, Patricia Wollstadt, Ulrich Meyer, Nicolae Pampu, Viola Priesemann, Raul Vicente
2011	J	`jnl`	Energy-efficient sorting using solid state disks. Sustain. Comput. Informatics Syst. Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler
2011	—	`conf`	New Bounds for Old Algorithms: On the Average-Case Behavior of Classic Single-Source Shortest-Paths Approaches. TAPAS Ulrich Meyer, Andrei Negoescu, Volker Weichert
2010	—	`ed.`	Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part I ESA (1) Mark de Berg, Ulrich Meyer
2010	—	`ed.`	Algorithms - ESA 2010, 18th Annual European Symposium, Liverpool, UK, September 6-8, 2010. Proceedings, Part II ESA (2) Mark de Berg, Ulrich Meyer
2010	—	`conf`	Energy-efficient sorting using solid state disks. Green Computing Conference Andreas Beckmann, Ulrich Meyer, Peter Sanders, Johannes Singler
2009	—	`conf`	Design and Engineering of External Memory Traversal Algorithms for General Graphs. Algorithmics of Large and Complex Networks Deepak Ajwani, Ulrich Meyer
2009	A	`conf`	Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm. ALENEX Ulrich Meyer, Vitaly Osipov
2009	B	`conf`	On Computational Models for Flash Memory Devices. SEA Deepak Ajwani, Andreas Beckmann, Riko Jacob, Ulrich Meyer, Gabriel Moruz
2009	B	`conf`	Online paging for flash memory devices. ISAAC Annamária Kovács, Ulrich Meyer, Gabriel Moruz, Andrei Negoescu
2009	—	`conf`	Via Detours to I/O-Efficient Shortest Paths. Efficient Algorithms Ulrich Meyer
2008	J	`jnl`	An ACM Trans. Algorithms Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2008	—	`conf`	Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design. WEA Deepak Ajwani, Itay Malinger, Ulrich Meyer, Sivan Toledo
2008	J	`jnl`	On Dynamic Breadth-First Search in External-Memory CoRR Ulrich Meyer
2008	A	`conf`	On Dynamic Breadth-First Search in External-Memory. STACS Ulrich Meyer
2008	—	`conf`	On Trade-Offs in External-Memory Diameter-Approximation. SWAT Ulrich Meyer
2007	A	`conf`	Improved External Memory BFS Implementation. ALENEX Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
2006	A*	`conf`	A computational study of external-memory BFS algorithms. SODA Deepak Ajwani, Roman Dementiev, Ulrich Meyer
2006	J	`jnl`	A simple improved distributed algorithm for minimum CDS in unit disk graphs. ACM Trans. Sens. Networks Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal
2006	J	`jnl`	Algorithms and Experiments for the Webgraph. J. Graph Algorithms Appl. Debora Donato, Luigi Laura, Stefano Leonardi, Ulrich Meyer, Stefano Millozzi, Jop F. Sibeyn
2006	—	`conf`	An O(n SWAT Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2006	J	`jnl`	An O(n CoRR Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2006	J	`jnl`	An O(n Electron. Notes Discret. Math. Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
2006	—	`conf`	Breadth First Search on Massive Graphs. The Shortest Path Problem Deepak Ajwani, Ulrich Meyer, Vitaly Osipov
2006	A	`conf`	I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths. ESA Ulrich Meyer, Norbert Zeh
2005	—	`conf`	A simple improved distributed algorithm for minimum CDS in unit disk graphs. WiMob (2) Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal
2004	—	`conf`	Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths. SWAT Gerth Stølting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
2004	A*	`conf`	External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. ICALP Lars Arge, Ulrich Meyer, Laura Toma
2003	A	`conf`	Algorithms and Experiments for the Webgraph. ESA Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, Jop F. Sibeyn
2003	—	`ed.`	Algorithms for Memory Hierarchies, Advanced Lectures [Dagstuhl Research Seminar, March 10-14, 2002] Algorithms for Memory Hierarchies Ulrich Meyer, Peter Sanders, Jop F. Sibeyn
2003	J	`jnl`	Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds. J. Algorithms Ulrich Meyer
2003	A	`conf`	I/O-Efficient Undirected Shortest Paths. ESA Ulrich Meyer, Norbert Zeh
2003	J	`jnl`	On External-Memory Planar Depth First Search. J. Graph Algorithms Appl. Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
2003	J	`jnl`	[Delta]-stepping: a parallelizable shortest path algorithm. J. Algorithms Ulrich Meyer, Peter Sanders
2002	A	`conf`	Buckets Strike Back: Improved Parallel Shortest Paths. IPDPS Ulrich Meyer
2002	—	`—`	Design and analysis of sequential and parallel single-source shortest-paths algorithms. Ulrich Meyer
2002	—	`conf`	Elementary Graph Algorithms in External Memory. Algorithms for Memory Hierarchies Irit Katriel, Ulrich Meyer
2002	A	`conf`	External-Memory Breadth-First Search with Sublinear I/O. ESA Kurt Mehlhorn, Ulrich Meyer
2002	B	`conf`	Heuristics for semi-external depth first search on directed graphs. SPAA Jop F. Sibeyn, James Abello, Ulrich Meyer
2002	J	`jnl`	Oblivious Gossiping on Tori. J. Algorithms Ulrich Meyer, Jop F. Sibeyn
2001	A*	`conf`	External memory BFS on undirected graphs with bounded degree. SODA Ulrich Meyer
2001	—	`conf`	Heaps Are Better than Buckets: Parallel Shortest Paths on Unbalanced Graphs. Euro-Par Ulrich Meyer
2001	B	`conf`	On External-Memory Planar Depth First Search. WADS Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
2001	J	`jnl`	Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems. Int. J. Comput. Geom. Appl. Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
2001	A*	`conf`	Single-source shortest-paths on arbitrary directed graphs in linear average-case time. SODA Ulrich Meyer
2001	—	`conf`	Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. KI/ÖGAI Stefan Edelkamp, Ulrich Meyer
2000	J	`jnl`	An Experimental Study of Priority Queues in External Memory. ACM J. Exp. Algorithmics Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
2000	—	`conf`	Parallel Shortest Path for Arbitrary Graphs. Euro-Par Ulrich Meyer, Peter Sanders
1999	—	`conf`	An Experimental Study of Priority Queues in External Memory. WAE Klaus Brengel, Andreas Crauser, Paolo Ferragina, Ulrich Meyer
1998	B	`conf`	A Parallelization of Dijkstra's Shortest Path Algorithm. MFCS Andreas Crauser, Kurt Mehlhorn, Ulrich Meyer, Peter Sanders
1998	A	`conf`	Delta-Stepping: A Parallel Single Source Shortest Path Algorithm. ESA Ulrich Meyer, Peter Sanders
1998	—	`conf`	Gossiping Large Packets on Full-Port Tori. Euro-Par Ulrich Meyer, Jop F. Sibeyn
1998	—	`conf`	I/O-optimal computation of segment intersections. External Memory Algorithms Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
1998	—	`conf`	Randomized External-Memory Algorithms for Some Geometric Problems. SCG Andreas Crauser, Paolo Ferragina, Kurt Mehlhorn, Ulrich Meyer, Edgar A. Ramos
1997	—	`conf`	Matrix Transpose on Meshes: Theory and Practice. IPPS Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1997	J	`jnl`	Matrix Transpose on Meshes: Theory and Practice. Comput. Artif. Intell. Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn
1995	—	`conf`	Simulating the Simulator: Deterministic PRAM Simulation on a Mesh Simulator. EUROSIM Ulrich Meyer, Jop F. Sibeyn
1994	—	`conf`	Towards practical permutation routing on meshes. SPDP Michael Kaufmann, Ulrich Meyer, Jop F. Sibeyn