Manuel Penschuck

Orcid: 0000-0003-2630-7548

Affiliations:
  • Goethe University Frankfurt, Germany


According to our database1, Manuel Penschuck authored at least 30 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Insights into (k, ρ)-shortcutting algorithms.
CoRR, 2024

2023
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees.
J. Parallel Distributed Comput., April, 2023

Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).
Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

Parallel and I/O-Efficient Algorithms for Non-Linear Preferential Attachment.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Netw. Sci., December, 2022

Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms.
IEEE Trans. Inf. Theory, 2022

Algorithms for Large-scale Network Analysis and the NetworKit Toolkit.
CoRR, 2022

Efficient and Accurate Group Testing via Belief Propagation: An Empirical Study.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Generating Synthetic Graph Data from Random Network Models.
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

Recent Advances in Scalable Network Generation1.
Proceedings of the Massive Graph Analytics, 2022

2021
Scalable generation of random graphs
PhD thesis, 2021

The number of satisfying assignments of random 2-SAT formulas.
Random Struct. Algorithms, 2021

An Experimental Study of External Memory Algorithms for Connected Components.
Proceedings of the 19th International Symposium on Experimental Algorithms, 2021

2020
Large-scale graph generation: Recent results of the SPP 1736 - Part II.
it Inf. Technol., 2020

Optimal group testing under real world restrictions.
CoRR, 2020

Recent Advances in Scalable Network Generation.
CoRR, 2020

The random 2-SAT partition function.
CoRR, 2020

Simulating Population Protocols in Sub-Constant Time per Interaction.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Communication-free massively distributed graph generation.
J. Parallel Distributed Comput., 2019

Bidirectional Text Compression in External Memory.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Fragile Complexity of Comparison-Based Algorithms.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

2018
I/O-Efficient Generation of Massive Graphs Following the <i>LFR</i> Benchmark.
ACM J. Exp. Algorithmics, 2018

Parallel and I/O-efficient Randomisation of Massive Networks using Global Curveball Trades.
Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017
Large-scale Graph Generation and Big Data: An Overview on Recent Results.
Bull. EATCS, 2017

Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

I/O-efficient Generation of Massive Graphs Following the LFR Benchmark.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Generating Massive Scale-Free Networks under Resource Constraints.
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016


  Loading...