- 1
Alexander Leonhardt, Ulrich Meyer, and Manuel Penschuck.
Insights into (k, ρ)-shortcutting algorithms.
In ESA, volume 308 of LIPIcs, 84:1–84:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
@inproceedings{DBLP:conf/esa/Leonhardt0P24,
author = "Leonhardt, Alexander and Meyer, Ulrich and Penschuck, Manuel",
title = "Insights into (k, {\(\rho\)})-Shortcutting Algorithms",
booktitle = "{ESA}",
series = "LIPIcs",
volume = "308",
pages = "84:1--84:17",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = "2024"
}
- 2
Manuel Penschuck.
Engineering shared-memory parallel shuffling to generate random permutations in-place.
In SEA, volume 265 of LIPIcs, 5:1–5:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
@inproceedings{DBLP:conf/wea/Penschuck23,
author = "Penschuck, Manuel",
title = "Engineering Shared-Memory Parallel Shuffling to Generate Random Permutations In-Place",
booktitle = "{SEA}",
series = "LIPIcs",
volume = "265",
pages = "5:1--5:20",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = "2023"
}
- 3
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran.
Parallel and I/O-efficient algorithms for non-linear preferential attachment.
In
Gonzalo Navarro and Julian Shun, editors,
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2023, Florence, Italy, January 22-23, 2023, 65–76.
SIAM, 2023.
View Online doi:10.1137/1.9781611977561.ch6
@inproceedings{DBLP:conf/alenex/Allendorf0PT23,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
editor = "Navarro, Gonzalo and Shun, Julian",
title = "Parallel and {I/O}-Efficient Algorithms for Non-Linear Preferential Attachment",
doi = "10.1137/1.9781611977561.ch6",
url = "https://doi.org/10.1137/1.9781611977561.ch6",
booktitle = "Proceedings of the Symposium on Algorithm Engineering and Experiments, {ALENEX} 2023, Florence, Italy, January 22-23, 2023",
pages = "65--76",
publisher = "{SIAM}",
year = "2023"
} - 4
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran.
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees.
J. Parallel Distributed Comput., 174:118–129, 2023.
View Online doi:10.1016/j.jpdc.2022.12.010
@article{DBLP:journals/jpdc/AllendorfMPT23,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
title = "Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees",
doi = "10.1016/j.jpdc.2022.12.010",
url = "https://doi.org/10.1016/j.jpdc.2022.12.010",
journal = "J. Parallel Distributed Comput.",
volume = "174",
pages = "118--129",
year = "2023"
} - 5
Alexander Leonhardt, Holger Dell, Anselm Haak, Frank Kammer, Johannes Meintrup, Ulrich Meyer, and Manuel Penschuck.
PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM).
In
Neeldhara Misra and Magnus Wahlström, editors,
18th International Symposium on Parameterized and Exact Computation (IPEC 2023), volume 285 of Leibniz International Proceedings in Informatics (LIPIcs), 37:1–37:7. Dagstuhl, Germany, 2023. Schloss Dagstuhl – Leibniz-Zentrum f
ür Informatik.
View Online doi:10.4230/LIPIcs.IPEC.2023.37
@InProceedings{leonhardt_et_al:LIPIcs.IPEC.2023.37,
author = "Leonhardt, Alexander and Dell, Holger and Haak, Anselm and Kammer, Frank and Meintrup, Johannes and Meyer, Ulrich and Penschuck, Manuel",
editor = {Misra, Neeldhara and Wahlstr\"{o}m, Magnus},
title = "{PACE Solver Description: Exact (GUTHMI) and Heuristic (GUTHM)}",
booktitle = "18th International Symposium on Parameterized and Exact Computation (IPEC 2023)",
pages = "37:1--37:7",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
ISBN = "978-3-95977-305-8",
ISSN = "1868-8969",
year = "2023",
volume = "285",
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = "Dagstuhl, Germany",
URL = "https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2023.37",
URN = "urn:nbn:de:0030-drops-194563",
doi = "10.4230/LIPIcs.IPEC.2023.37",
annote = "Keywords: PACE 2023 Challenge, Heuristic, Exact, Twin-Width"
} - 6
Hannah Bast, Claudius Korzen, Ulrich Meyer, and Manuel Penschuck, editors.
Algorithms for Big Data - DFG Priority Program 1736, volume 13201 of Lecture Notes in Computer Science, Springer, 2022.
@proceedings{DBLP:books/sp/22/2022BKMP,
editor = "Bast, Hannah and Korzen, Claudius and Meyer, Ulrich and Penschuck, Manuel",
title = "Algorithms for Big Data - {DFG} Priority Program 1736",
series = "Lecture Notes in Computer Science",
volume = "13201",
publisher = "Springer",
year = "2022"
}
- 7
Eugenio Angriman, Alexander van der Grinten, Michael Hamann, Henning Meyerhenke, and Manuel Penschuck.
Algorithms for large-scale network analysis and the networkit toolkit.
In Algorithms for Big Data, volume 13201 of Lecture Notes in Computer Science, pages 3–20.
Springer, 2022.
@incollection{DBLP:books/sp/22/AngrimanGHMP22,
author = "Angriman, Eugenio and van der Grinten, Alexander and Hamann, Michael and Meyerhenke, Henning and Penschuck, Manuel",
title = "Algorithms for Large-Scale Network Analysis and the NetworKit Toolkit",
booktitle = "Algorithms for Big Data",
series = "Lecture Notes in Computer Science",
volume = "13201",
pages = "3--20",
publisher = "Springer",
year = "2022"
}
- 8
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, and Christopher Weyand.
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
Netw. Sci., 10(4):361–380, 2022.
@article{DBLP:journals/netsci/BlasiusFKMPW22,
author = {Bl{\"{a}}sius, Thomas and Friedrich, Tobias and Katzmann, Maximilian and Meyer, Ulrich and Penschuck, Manuel and Weyand, Christopher},
title = "Efficiently generating geometric inhomogeneous and hyperbolic random graphs",
journal = "Netw. Sci.",
volume = "10",
number = "4",
pages = "361--380",
year = "2022"
}
- 9
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Nick Wormald.
Engineering uniform sampling of graphs with a prescribed power-law degree sequence.
In
2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX), 27–40. SIAM, 2022.
View Online doi:10.1137/1.9781611977042.3
@inproceedings{allendorf2022engineering,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wormald, Nick",
title = "Engineering Uniform Sampling of Graphs with a Prescribed Power-law Degree Sequence",
booktitle = "2022 Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)",
pages = "27--40",
year = "2022",
organization = "SIAM",
url = "https://doi.org/10.1137/1.9781611977042.3",
doi = "10.1137/1.9781611977042.3"
} - 10
Ulrich Meyer and Manuel Penschuck.
Generating synthetic graph data from random network models.
In Algorithms for Big Data, volume 13201 of Lecture Notes in Computer Science, pages 21–38.
Springer, 2022.
@incollection{DBLP:books/sp/22/0001P22,
author = "Meyer, Ulrich and Penschuck, Manuel",
title = "Generating Synthetic Graph Data from Random Network Models",
booktitle = "Algorithms for Big Data",
series = "Lecture Notes in Computer Science",
volume = "13201",
pages = "21--38",
publisher = "Springer",
year = "2022"
}
- 11
Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, and Nelvin Tan.
Near-optimal sparsity-constrained group testing: improved bounds and algorithms.
IEEE Trans. Inf. Theory, 68(5):3253–3280, 2022.
@article{DBLP:journals/tit/GebhardHPPRST22,
author = "Gebhard, Oliver and Hahn{-}Klimroth, Max and Parczyk, Olaf and Penschuck, Manuel and Rolvien, Maurice and Scarlett, Jonathan and Tan, Nelvin",
title = "Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms",
journal = "{IEEE} Trans. Inf. Theory",
volume = "68",
number = "5",
pages = "3253--3280",
year = "2022"
}
- 12
Daniel Allendorf, Ulrich Meyer, Manuel Penschuck, and Hung Tran.
Parallel global edge switching for the uniform sampling of simple graphs with prescribed degrees.
In
2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), volume, 269–279. Los Alamitos, CA, USA, jun 2022. IEEE Computer Society.
View Online doi:10.1109/IPDPS53621.2022.00034
@inproceedings{allendorf2022parallel,
author = "Allendorf, Daniel and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
booktitle = "2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)",
title = "Parallel Global Edge Switching for the Uniform Sampling of Simple Graphs with Prescribed Degrees",
year = "2022",
volume = "",
issn = "",
pages = "269-279",
keywords = "distributed processing;runtime;scalability;switches;markov processes;data structures;generators",
doi = "10.1109/IPDPS53621.2022.00034",
url = "https://doi.ieeecomputersociety.org/10.1109/IPDPS53621.2022.00034",
publisher = "IEEE Computer Society",
address = "Los Alamitos, CA, USA",
month = "jun"
} - 13
Manuel Penschuck, Ulrik Brandes, Michael Hamann, Sebastian Lamm, Ulrich Meyer, Ilya Safro, Peter Sanders, and Christian Schulz.
Recent advances in scalable network generation.
In Massive Graph Analytics, pages 333–376.
Chapman and Hall/CRC, 2022.
@incollection{DBLP:books/crc/22/PenschuckBHL0S0022,
author = "Penschuck, Manuel and Brandes, Ulrik and Hamann, Michael and Lamm, Sebastian and Meyer, Ulrich and Safro, Ilya and Sanders, Peter and Schulz, Christian",
title = "Recent Advances in Scalable Network Generation",
booktitle = "Massive Graph Analytics",
pages = "333--376",
publisher = "Chapman and Hall/CRC",
year = "2022"
}
- 14
Gerth Stølting Brodal, Rolf Fagerberg, David Hammer, Ulrich Meyer, Manuel Penschuck, and Hung Tran.
An experimental study of external memory algorithms for connected components.
In
David Coudert and Emanuele Natale, editors,
19th International Symposium on Experimental Algorithms (SEA 2021), volume 190 of Leibniz International Proceedings in Informatics (LIPIcs), 23:1–23:23. Dagstuhl, Germany, 2021. Schloss Dagstuhl – Leibniz-Zentrum f
ür Informatik.
View Online doi:10.4230/LIPIcs.SEA.2021.23
@InProceedings{brodal_et_al:LIPIcs.SEA.2021.23,
author = "Brodal, Gerth St{\o}lting and Fagerberg, Rolf and Hammer, David and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
editor = "Coudert, David and Natale, Emanuele",
title = "An Experimental Study of External Memory Algorithms for Connected Components",
booktitle = "19th International Symposium on Experimental Algorithms (SEA 2021)",
pages = "23:1--23:23",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
ISBN = "978-3-95977-185-6",
ISSN = "1868-8969",
year = "2021",
volume = "190",
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = "Dagstuhl, Germany",
URL = "https://drops.dagstuhl.de/opus/volltexte/2021/13795",
URN = "urn:nbn:de:0030-drops-137958",
doi = "10.4230/LIPIcs.SEA.2021.23",
annote = "Keywords: Connected Components, Experimental Evaluation, External Memory, Graph Algorithms, Randomization"
} - 15
Dimitris Achlioptas, Amin Coja-Oghlan, Max Hahn-Klimroth, Joon Lee, Noëla Müller, Manuel Penschuck, and Guangyan Zhou.
The number of satisfying assignments of random 2-sat formulas.
Random Struct. Algorithms, 58(4):609–647, 2021.
@article{DBLP:journals/rsa/AchlioptasCHLMP21,
author = {Achlioptas, Dimitris and Coja{-}Oghlan, Amin and Hahn{-}Klimroth, Max and Lee, Joon and M{\"{u}}ller, No{\"{e}}la and Penschuck, Manuel and Zhou, Guangyan},
title = "The number of satisfying assignments of random 2-SAT formulas",
journal = "Random Struct. Algorithms",
volume = "58",
number = "4",
pages = "609--647",
year = "2021"
}
- 16
Ulrich Meyer and Manuel Penschuck.
Large-scale graph generation: recent results of the SPP 1736 - part II.
it Inf. Technol., 62(3-4):135–144, 2020.
View Online doi:10.1515/itit-2019-0041
@article{DBLP:journals/it/0001P20,
author = "Meyer, Ulrich and Penschuck, Manuel",
title = "Large-scale graph generation: Recent results of the {SPP} 1736 - Part {II}",
journal = "it Inf. Technol.",
volume = "62",
number = "3-4",
pages = "135--144",
year = "2020",
url = "https://doi.org/10.1515/itit-2019-0041",
doi = "10.1515/itit-2019-0041",
biburl = "https://dblp.org/rec/journals/it/0001P20.bib"
} - 17
Manuel Penschuck.
Scalable generation of random graphs.
PhD thesis, Goethe University, Germany, 2020.
View Online
@PhdThesis{penschuck2020scalable,
author = "Penschuck, Manuel",
title = "Scalable generation of random graphs",
uniqueid = "HEB483161861",
url = "http://publikationen.ub.uni-frankfurt.de/frontdoor/index/index/docId/61035",
School = "Goethe University, Germany",
year = "2020"
} - 18
Petra Berenbrink, David Hammer, Dominik Kaaser, Ulrich Meyer, Manuel Penschuck, and Hung Tran.
Simulating Population Protocols in Sub-Constant Time per Interaction.
In
Fabrizio Grandoni, Grzegorz Herman, and Peter Sanders, editors,
28th Annual European Symposium on Algorithms (ESA 2020), volume 173 of Leibniz International Proceedings in Informatics (LIPIcs), 16:1–16:22. Dagstuhl, Germany, 2020. Schloss Dagstuhl–Leibniz-Zentrum f
ür Informatik.
View Online doi:10.4230/LIPIcs.ESA.2020.16
@InProceedings{berenbrink_et_al:LIPIcs:2020:12882,
author = "Berenbrink, Petra and Hammer, David and Kaaser, Dominik and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung",
editor = "Grandoni, Fabrizio and Herman, Grzegorz and Sanders, Peter",
title = "{Simulating Population Protocols in Sub-Constant Time per Interaction}",
booktitle = "28th Annual European Symposium on Algorithms (ESA 2020)",
pages = "16:1--16:22",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
ISBN = "978-3-95977-162-7",
ISSN = "1868-8969",
year = "2020",
volume = "173",
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = "Dagstuhl, Germany",
URL = "https://drops.dagstuhl.de/opus/volltexte/2020/12882",
URN = "urn:nbn:de:0030-drops-128827",
doi = "10.4230/LIPIcs.ESA.2020.16",
annote = "Keywords: Population Protocols, Simulation, Random Sampling, Dynamic Alias Table"
} - 19
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, and Manuel Penschuck.
Bidirectional text compression in external memory.
In
Michael A. Bender, Ola Svensson, and Grzegorz Herman, editors,
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, volume 144 of LIPIcs, 41:1–41:16. Schloss Dagstuhl - Leibniz-Zentrum f
ür Informatik, 2019.
View Online doi:10.4230/LIPIcs.ESA.2019.41
@inproceedings{DBLP:conf/esa/DinklageE0KP19,
author = {Dinklage, Patrick and Ellert, Jonas and Fischer, Johannes and K{\"{o}}ppl, Dominik and Penschuck, Manuel},
editor = "Bender, Michael A. and Svensson, Ola and Herman, Grzegorz",
biburl = "https://dblp.org/rec/conf/esa/DinklageE0KP19.bib",
booktitle = "27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany",
doi = "10.4230/LIPIcs.ESA.2019.41",
pages = "41:1--41:16",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Bidirectional Text Compression in External Memory",
url = "https://doi.org/10.4230/LIPIcs.ESA.2019.41",
volume = "144",
year = "2019"
} - 20
Daniel Funke, Sebastian Lamm, Ulrich Meyer, Manuel Penschuck, Peter Sanders, Christian Schulz, Darren Strash, and Moritz von Looz.
Communication-free massively distributed graph generation.
J. Parallel Distributed Comput., 131:200–217, 2019.
View Online doi:10.1016/j.jpdc.2019.03.011
@article{DBLP:journals/jpdc/FunkeLMPSSSL19,
author = "Funke, Daniel and Lamm, Sebastian and Meyer, Ulrich and Penschuck, Manuel and Sanders, Peter and Schulz, Christian and Strash, Darren and von Looz, Moritz",
title = "Communication-free massively distributed graph generation",
journal = "J. Parallel Distributed Comput.",
volume = "131",
pages = "200--217",
year = "2019",
url = "https://doi.org/10.1016/j.jpdc.2019.03.011",
doi = "10.1016/j.jpdc.2019.03.011",
biburl = "https://dblp.org/rec/journals/jpdc/FunkeLMPSSSL19.bib"
} - 21
Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann, Ulrich Meyer, Manuel Penschuck, and Christopher Weyand.
Efficiently generating geometric inhomogeneous and hyperbolic random graphs.
In
Michael A. Bender, Ola Svensson, and Grzegorz Herman, editors,
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, volume 144 of LIPIcs, 21:1–21:14. Schloss Dagstuhl - Leibniz-Zentrum f
ür Informatik, 2019.
View Online doi:10.4230/LIPIcs.ESA.2019.21
@inproceedings{DBLP:conf/esa/Blasius0K0PW19,
author = {Bl{\"{a}}sius, Thomas and Friedrich, Tobias and Katzmann, Maximilian and Meyer, Ulrich and Penschuck, Manuel and Weyand, Christopher},
editor = "Bender, Michael A. and Svensson, Ola and Herman, Grzegorz",
biburl = "https://dblp.org/rec/conf/esa/Blasius0K0PW19.bib",
booktitle = "27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany",
doi = "10.4230/LIPIcs.ESA.2019.21",
pages = "21:1--21:14",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Efficiently Generating Geometric Inhomogeneous and Hyperbolic Random Graphs",
url = "https://doi.org/10.4230/LIPIcs.ESA.2019.21",
volume = "144",
year = "2019"
} - 22
Peyman Afshani, Rolf Fagerberg, David Hammer, Riko Jacob, Irina Kostitsyna, Ulrich Meyer, Manuel Penschuck, and Nodari Sitchinava.
Fragile complexity of comparison-based algorithms.
In
Michael A. Bender, Ola Svensson, and Grzegorz Herman, editors,
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany, volume 144 of LIPIcs, 2:1–2:19. Schloss Dagstuhl - Leibniz-Zentrum f
ür Informatik, 2019.
View Online doi:10.4230/LIPIcs.ESA.2019.2
@inproceedings{DBLP:conf/esa/AfshaniFHJK0PS19,
author = "Afshani, Peyman and Fagerberg, Rolf and Hammer, David and Jacob, Riko and Kostitsyna, Irina and Meyer, Ulrich and Penschuck, Manuel and Sitchinava, Nodari",
editor = "Bender, Michael A. and Svensson, Ola and Herman, Grzegorz",
biburl = "https://dblp.org/rec/conf/esa/AfshaniFHJK0PS19.bib",
booktitle = "27th Annual European Symposium on Algorithms, {ESA} 2019, September 9-11, 2019, Munich/Garching, Germany",
doi = "10.4230/LIPIcs.ESA.2019.2",
pages = "2:1--2:19",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Fragile Complexity of Comparison-Based Algorithms",
url = "https://doi.org/10.4230/LIPIcs.ESA.2019.2",
volume = "144",
year = "2019"
} - 23
Corrie Jacobien Carstens, Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner.
Parallel and I/O-efficient randomisation of massive networks using global curveball trades.
In
Yossi Azar, Hannah Bast, and Grzegorz Herman, editors,
26th Annual European Symposium on Algorithms, ESA 2018, August 20-22, 2018, Helsinki, Finland, volume 112 of LIPIcs, 11:1–11:15. Schloss Dagstuhl - Leibniz-Zentrum f
ür Informatik, 2018.
View Online doi:10.4230/LIPIcs.ESA.2018.11
@inproceedings{DBLP:conf/esa/CarstensH0PTW18,
author = "Carstens, Corrie Jacobien and Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea",
editor = "Azar, Yossi and Bast, Hannah and Herman, Grzegorz",
biburl = "https://dblp.org/rec/conf/esa/CarstensH0PTW18.bib",
booktitle = "26th Annual European Symposium on Algorithms, {ESA} 2018, August 20-22, 2018, Helsinki, Finland",
doi = "10.4230/LIPIcs.ESA.2018.11",
pages = "11:1--11:15",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Parallel and {I/O}-efficient Randomisation of Massive Networks using Global Curveball Trades",
url = "https://doi.org/10.4230/LIPIcs.ESA.2018.11",
volume = "112",
year = "2018"
} - 24
Michael Hamann, Ulrich Meyer, Manuel Penschuck, Hung Tran, and Dorothea Wagner.
I/O-efficient generation of massive graphs following the LFR benchmark.
ACM Journal of Experimental Algorithmics, 2018.
View Online doi:10.1145/3230743
@article{DBLP:journals/jea/HamannMPTW18,
author = "Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Tran, Hung and Wagner, Dorothea",
biburl = "https://dblp.org/rec/journals/jea/HamannMPTW18.bib",
doi = "10.1145/3230743",
journal = "{ACM} Journal of Experimental Algorithmics",
title = "{I/O}-Efficient Generation of Massive Graphs Following the {LFR} Benchmark",
url = "https://doi.org/10.1145/3230743",
volume = "23",
year = "2018"
} - 25
Manuel Penschuck.
Generating practical random hyperbolic graphs in near-linear time and with sub-linear memory.
In
Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, and Rajeev Raman, editors,
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK, volume 75 of LIPIcs, 26:1–26:21. Schloss Dagstuhl - Leibniz-Zentrum f
ür Informatik, 2017.
View Online doi:10.4230/LIPIcs.SEA.2017.26
@inproceedings{DBLP:conf/wea/Penschuck17,
author = "Penschuck, Manuel",
editor = "Iliopoulos, Costas S. and Pissis, Solon P. and Puglisi, Simon J. and Raman, Rajeev",
biburl = "https://dblp.org/rec/conf/wea/Penschuck17.bib",
booktitle = "16th International Symposium on Experimental Algorithms, {SEA} 2017, June 21-23, 2017, London, {UK}",
doi = "10.4230/LIPIcs.SEA.2017.26",
pages = "26:1--26:21",
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
series = "LIPIcs",
title = "Generating Practical Random Hyperbolic Graphs in Near-Linear Time and with Sub-Linear Memory",
url = "https://doi.org/10.4230/LIPIcs.SEA.2017.26",
volume = "75",
year = "2017"
} - 26
Ulrich Meyer and Manuel Penschuck.
Large-scale graph generation and big data: an overview on recent results.
Bulletin of the EATCS, 2017.
View Online
@article{DBLP:journals/eatcs/0001P17,
author = "Meyer, Ulrich and Penschuck, Manuel",
biburl = "https://dblp.org/rec/journals/eatcs/0001P17.bib",
journal = "Bulletin of the {EATCS}",
title = "Large-scale Graph Generation and Big Data: An Overview on Recent Results",
url = "http://eatcs.org/beatcs/index.php/beatcs/article/view/494",
volume = "122",
year = "2017"
} - 27
Michael Hamann, Ulrich Meyer, Manuel Penschuck, and Dorothea Wagner.
I/O-efficient generation of massive graphs following the LFR benchmark.
In
Sándor P. Fekete and Vijaya Ramachandran, editors,
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017, 58–72.
SIAM, 2017.
View Online doi:10.1137/1.9781611974768.5
@inproceedings{DBLP:conf/alenex/HamannMPW17,
author = "Hamann, Michael and Meyer, Ulrich and Penschuck, Manuel and Wagner, Dorothea",
editor = "Fekete, S{\'{a}}ndor P. and Ramachandran, Vijaya",
biburl = "https://dblp.org/rec/conf/alenex/HamannMPW17.bib",
booktitle = "Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017",
doi = "10.1137/1.9781611974768.5",
pages = "58--72",
publisher = "{SIAM}",
title = "{I/O}-efficient Generation of Massive Graphs Following the {LFR} Benchmark",
url = "https://doi.org/10.1137/1.9781611974768.5",
year = "2017"
} - 28
Ulrich Meyer and Manuel Penschuck.
Generating massive scale-free networks under resource constraints.
In
Michael T. Goodrich and Michael Mitzenmacher, editors,
Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2016, Arlington, Virginia, USA, January 10, 2016, 39–52.
SIAM, 2016.
View Online doi:10.1137/1.9781611974317.4
@inproceedings{DBLP:conf/alenex/MeyerP16,
author = "Meyer, Ulrich and Penschuck, Manuel",
editor = "Goodrich, Michael T. and Mitzenmacher, Michael",
biburl = "https://dblp.org/rec/conf/alenex/MeyerP16.bib",
booktitle = "Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, {ALENEX} 2016, Arlington, Virginia, USA, January 10, 2016",
doi = "10.1137/1.9781611974317.4",
pages = "39--52",
publisher = "{SIAM}",
title = "Generating Massive Scale-Free Networks under Resource Constraints",
url = "https://doi.org/10.1137/1.9781611974317.4",
year = "2016"
}
