Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hoske, Daniel
Lukarski, Dimitar
Meyerhenke, Henning
and
Wegner, Michael
2016.
Engineering a Combinatorial Laplacian Solver: Lessons Learned.
Algorithms,
Vol. 9,
Issue. 4,
p.
72.
Koch, Jannis
Staudt, Christian L.
Vogel, Maximilian
and
Meyerhenke, Henning
2016.
An empirical comparison of Big Graph frameworks in the context of network analysis.
Social Network Analysis and Mining,
Vol. 6,
Issue. 1,
von Looz, Moritz
and
Meyerhenke, Henning
2016.
Combinatorial Algorithms.
Vol. 9843,
Issue. ,
p.
449.
Kepner, Jeremy
Meyerhenke, Henning
McMillan, Scott
Yang, Carl
Owens, John D.
Zalewski, Marcin
Mattson, Timothy
Moreira, Jose
Aaltonen, Peter
Bader, David
Buluc, Aydin
Franchetti, Franz
Gilbert, John
Hutchison, Dylan
Kumar, Manoj
and
Lumsdaine, Andrew
2016.
Mathematical foundations of the GraphBLAS.
p.
1.
Sengupta, Neha
Hamann, Michael
and
Wagner, Dorothea
2017.
Benchmark Generator for Dynamic Overlapping Communities in Networks.
p.
415.
Staudt, Christian L.
Hamann, Michael
Safro, Ilya
Gutfraind, Alexander
and
Meyerhenke, Henning
2017.
Complex Networks & Their Applications V.
Vol. 693,
Issue. ,
p.
17.
Hamann, Michael
Röhrs, Eike
and
Wagner, Dorothea
2017.
Local Community Detection Based on Small Cliques.
Algorithms,
Vol. 10,
Issue. 3,
p.
90.
Staudt, Christian L.
Hamann, Michael
Gutfraind, Alexander
Safro, Ilya
and
Meyerhenke, Henning
2017.
Generating realistic scaled complex networks.
Applied Network Science,
Vol. 2,
Issue. 1,
Liang, Jiaqi
Li, Linjing
Zeng, Daniel
and
Hernandez Montoya, Alejandro Raul
2018.
Evolutionary dynamics of cryptocurrency transaction networks: An empirical study.
PLOS ONE,
Vol. 13,
Issue. 8,
p.
e0202202.
Kojaku, Sadamori
and
Masuda, Naoki
2018.
A generalised significance test for individual communities in networks.
Scientific Reports,
Vol. 8,
Issue. 1,
Bläsius, Thomas
Friedrich, Tobias
Katzmann, Maximilian
Krohmer, Anton
and
Striebel, Jonathan
2018.
Algorithms and Models for the Web Graph.
Vol. 10836,
Issue. ,
p.
99.
Batagelj, Vladimir
2018.
Encyclopedia of Social Network Analysis and Mining.
p.
1943.
Riondato, Matteo
and
Upfal, Eli
2018.
ABRA.
ACM Transactions on Knowledge Discovery from Data,
Vol. 12,
Issue. 5,
p.
1.
Looz, Moritz Von
and
Meyerhenke, Henning
2018.
Updating Dynamic Random Hyperbolic Graphs in Sublinear Time.
ACM Journal of Experimental Algorithmics,
Vol. 23,
Issue. ,
p.
1.
Behdju, Mahyar
and
Meyer, Ulrich
2018.
DFG Priority Programme SPP 1736: Algorithms for Big Data.
KI - Künstliche Intelligenz,
Vol. 32,
Issue. 1,
p.
77.
Batagelj, Vladimir
2018.
Encyclopedia of Social Network Analysis and Mining.
p.
1.
ŞİMŞEK, Aybike
and
KARA, Resul
2018.
Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks.
Expert Systems with Applications,
Vol. 114,
Issue. ,
p.
224.
Mocnik, Franz-Benjamin
2018.
The Polynomial Volume Law of Complex Networks in the Context of Local and Global Optimization.
Scientific Reports,
Vol. 8,
Issue. 1,
Hamann, Michael
Meyer, Ulrich
Penschuck, Manuel
Tran, Hung
and
Wagner, Dorothea
2018.
I/O-Efficient Generation of Massive Graphs Following the
LFR
Benchmark
.
ACM Journal of Experimental Algorithmics,
Vol. 23,
Issue. ,
p.
1.
Martin, Christoph
2018.
Complex Networks & Their Applications VI.
Vol. 689,
Issue. ,
p.
41.