Manuel Penschuck
Manuel Penschuck
Institut für Informatik
Robert-Mayer-Straße 11-15
60325 Frankfurt am Main
Room 312
Tel: +49-69-798-28823
Fax: +49-69-798-28814
Email: manuel@ae.cs.uni-frankfurt.de
Publications
10
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, Christopher Weyand
Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs
In ESA 2019: 21:1-21:14 (ESA Track B, Best Paper)
9
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, Nodari Sitchinava
Fragile Complexity of Comparison-Based Algorithms
In ESA 2019: 2:1-2:19 (ESA Track A, Best Paper)
8
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck
Bidirectional Text Compression in External Memory
In ESA 2019: 41:1-41:16
7
Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, Moritz von Looz
Communication-free massively distributed graph generation
In Journal of Parallel and Distributed Computing 131 (2019)
6
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
I/O-Efficient Generation of Massive Graphs Following the LFR Benchmark
In ACM Journal of Experimental Algorithmics 23 (2018)
5
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, Dorothea Wagner
Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades
In ESA 2018: 11:1-11:15
4
Manuel Penschuck
Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory
In SEA 2017: 26:1-26:21
3
Ulrich Meyer, Manuel Penschuck, The Algorithmics Column by Gerhard J Woeginger
Large-scale Graph Generation and Big Data: An Overview on Recent Results
In 122nd issue of the EATCS Bulletin 2017
2
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Dorothea Wagner
I/O-efficent Generation of Massive Graphs Following the LFR Benchmark
ALENEX 2017: 58-72
1
Ulrich Meyer, Manuel Penschuck
Generating Massive Scale-Free Networks under Resource Constraints
ALENEX 2016: 39-52