{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:40:18Z","timestamp":1649068818122},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,12]],"date-time":"2017-12-12T00:00:00Z","timestamp":1513036800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s13218-017-0518-4","type":"journal-article","created":{"date-parts":[[2017,12,12]],"date-time":"2017-12-12T11:05:54Z","timestamp":1513076754000},"page":"77-84","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["DFG Priority Programme SPP 1736: Algorithms for Big Data"],"prefix":"10.1007","volume":"32","author":[{"given":"Mahyar","family":"Behdju","sequence":"first","affiliation":[]},{"given":"Ulrich","family":"Meyer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,12]]},"reference":[{"key":"518_CR1","doi-asserted-by":"crossref","unstructured":"Akhremtsev Y, Heuer T, Sanders P, Schlag S (2017) Engineering a direct k-way hypergraph partitioning algorithm. In: Fekete SP, Ramachandran V (eds) Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017, pp 28\u201342. SIAM","DOI":"10.1137\/1.9781611974768.3"},{"key":"518_CR2","doi-asserted-by":"crossref","unstructured":"Albers S, Bampis E, Letsios D, Lucarelli G, Stotz R (2016) Scheduling on power-heterogeneous processors. In: Kranakis E, Navarro G, Ch\u00e1vez E (eds) LATIN 2016: Theoretical Informatics\u201412th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings, vol 9644 of Lecture Notes in Computer Science, pp 41\u201354. Springer","DOI":"10.1007\/978-3-662-49529-2_4"},{"key":"518_CR3","doi-asserted-by":"crossref","unstructured":"Bader C, Hofheinz D, Jager T, Kiltz E, Li Y (2015) Tightly-secure authenticated key exchange. In: Dodis Y, Nielsen JB (eds) Theory of Cryptography\u201412th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23-25, 2015, Proceedings, Part I, vol 9014 of Lecture Notes in Computer Science, pp 629\u2013658. Springer","DOI":"10.1007\/978-3-662-46494-6_26"},{"key":"518_CR4","doi-asserted-by":"crossref","unstructured":"Bast H, B\u00e4urle F, Buchhold B, Hau\u00dfmann E (2014) Semantic full-text search with broccoli. In: Geva S, Trotman A, Bruza P, Clarke CLA, J\u00e4rvelin K (eds) The 37th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR \u201914, Gold Coast, QLD, Australia\u2014July 06-11, 2014, pp 1265\u20131266. ACM","DOI":"10.1145\/2600428.2611186"},{"issue":"5","key":"518_CR5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1080\/15427951.2016.1177802","volume":"12","author":"E Bergamini","year":"2016","unstructured":"Bergamini E, Meyerhenke H (2016) Approximating betweenness centrality in fully dynamic networks. Internet Math 12(5):281\u2013314","journal-title":"Internet Math"},{"key":"518_CR6","doi-asserted-by":"crossref","unstructured":"Bergamini E, Wegner M, Lukarski D, Meyerhenke H (2016) Estimating current-flow closeness centrality with a multigrid laplacian solver. In: Gebremedhin AH, Boman EG, U\u00e7ar B (eds) 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, CSC 2016, Albuquerque, New Mexico, USA, October 10-12, 2016, pp 1\u201312. SIAM","DOI":"10.1137\/1.9781611974690.ch1"},{"key":"518_CR7","doi-asserted-by":"crossref","unstructured":"Bingmann T, Axtmann M, J\u00f6bstl E, Lamm S, Nguyen HC, Noe A, Schlag S, Stumpp M, Sturm T, Sanders P (2016) Thrill: high-performance algorithmic distributed batch data processing with C++. In: Joshi J, Karypis G, Liu L, Hu X, Ak R, Xia Y, Xu W, Sato A, Rachuri S, Ungar LH, Yu PS, Govindaraju R, Suzumura T (eds) 2016 IEEE International Conference on Big Data, BigData 2016, Washington DC, USA, December 5-8, 2016, pp 172\u2013183. IEEE","DOI":"10.1109\/BigData.2016.7840603"},{"issue":"1","key":"518_CR8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00453-015-0071-1","volume":"77","author":"T Bingmann","year":"2017","unstructured":"Bingmann T, Eberle A, Sanders P (2017) Engineering parallel string sorting. Algorithmica 77(1):235\u2013286","journal-title":"Algorithmica"},{"key":"518_CR9","doi-asserted-by":"crossref","unstructured":"Brandes U, Hamann M, Strasser B, Wagner D (2015) Fast quasi-threshold editing. In: Bansal N, Finocchi I (eds) Algorithms-ESA 2015\u201423rd Annual European Symposium, Patras, Greece, September 14-16, 2015, Proceedings, vol 9294 of Lecture Notes in Computer Science, pp 251\u2013262. Springer","DOI":"10.1007\/978-3-662-48350-3_22"},{"key":"518_CR10","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7 A, Meyerhenke H, Safro I, Sanders P, Schulz C (2016) Recent advances in graph partitioning. In: Kliemann L, Sanders P (eds) Algorithm Engineering\u2014Selected Results and Surveys, vol 9220 of Lecture Notes in Computer Science, pp 117\u2013158","DOI":"10.1007\/978-3-319-49487-6_4"},{"issue":"6","key":"518_CR11","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1002\/spe.844","volume":"38","author":"R Dementiev","year":"2008","unstructured":"Dementiev R, Kettner L, Sanders P (2008) STXXL: standard template library for XXL data sets. Softw Pract Exper 38(6):589\u2013637","journal-title":"Softw Pract Exper"},{"key":"518_CR12","doi-asserted-by":"crossref","unstructured":"Disser Y, Hackfeld J, Klimm M (2016) Undirected graph exploration with $$\\theta (\\log \\log n)$$ \u03b8 ( log log n ) pebbles. In: Krauthgamer R (ed) Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016, pp 25\u201339. SIAM","DOI":"10.1137\/1.9781611974331.ch3"},{"key":"518_CR13","doi-asserted-by":"crossref","unstructured":"Esser A, K\u00fcbler R, May A (2017) LPN decoded. In: Katz J, Shacham H (eds) Advances in Cryptology\u2014CRYPTO 2017\u201437th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part II, vol 10402 of Lecture Notes in Computer Science, pp 486\u2013514. Springer","DOI":"10.1007\/978-3-319-63715-0_17"},{"key":"518_CR14","doi-asserted-by":"crossref","unstructured":"Etscheid M, Mnich M (2016) Linear kernels and linear-time algorithms for finding large cuts. In: Hong S (ed) 27th International Symposium on Algorithms and Computation, ISAAC 2016, December 12-14, 2016, Sydney, Australia, vol 64 of LIPIcs, pp 31:1\u201331:13. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik","DOI":"10.1007\/s00453-017-0388-z"},{"key":"518_CR15","doi-asserted-by":"crossref","unstructured":"Gay R, Hofheinz D, Kiltz E, Wee H (2016) Tightly cca-secure encryption without pairings. In: Fischlin M, Coron J (eds) Advances in Cryptology\u2014EUROCRYPT 2016\u201435th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part I, vol 9665 of Lecture Notes in Computer Science pp 1\u201327. Springer","DOI":"10.1007\/978-3-662-49890-3_1"},{"key":"518_CR16","unstructured":"Giesen J, Laue S (2016) Distributed convex optimization with many convex constraints. CoRR, abs\/1610.02967"},{"issue":"1","key":"518_CR17","first-page":"22:1","volume":"6","author":"M Hamann","year":"2016","unstructured":"Hamann M, Lindner G, Meyerhenke H, Staudt CL, Wagner D (2016) Structure-preserving sparsification methods for social networks. Social Netw Anal Mining 6(1):22:1\u201322:22","journal-title":"Social Netw Anal Mining"},{"key":"518_CR18","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs A, Meyer U, Ventre C (2015) Mechanisms with monitoring for truthful RAM allocation. In: Markakis E, Sch\u00e4fer G (eds), Web and Internet Economics\u201411th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings, vol 9470 of Lecture Notes in Computer Science, pp 398\u2013412. Springer","DOI":"10.1007\/978-3-662-48995-6_29"},{"issue":"4","key":"518_CR19","doi-asserted-by":"crossref","first-page":"B499","DOI":"10.1137\/110843563","volume":"34","author":"OE Livne","year":"2012","unstructured":"Livne OE, Brandt A (2012) Lean algebraic multigrid (LAMG): fast graph laplacian linear solver. SIAM J Sci Comput 34(4):B499\u2013B522","journal-title":"SIAM J Sci Comput"},{"key":"518_CR20","doi-asserted-by":"crossref","unstructured":"M\u00e4cker A, Malatyali M, Meyer auf der Heide F (2015) Online top-k-position monitoring of distributed data streams. In: 2015 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2015, Hyderabad, India, May 25-29, 2015, pp 357\u2013364. IEEE Computer Society","DOI":"10.1109\/IPDPS.2015.40"},{"key":"518_CR21","doi-asserted-by":"crossref","unstructured":"M\u00e4cker A, Malatyali M, Meyer auf der Heide F (2016) On competitive algorithms for approximations of top-k-position monitoring of distributed streams. In: 2016 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2016, Chicago, IL, USA, May 23-27, 2016, pp 700\u2013709. IEEE Computer Society","DOI":"10.1109\/IPDPS.2016.91"},{"key":"518_CR22","unstructured":"Meyer U, Penschuck M (2017) Large-scale graph generation and big data: an overview on recent results. Bull EATCS 122"},{"issue":"9","key":"518_CR23","doi-asserted-by":"crossref","first-page":"2625","DOI":"10.1109\/TPDS.2017.2671868","volume":"28","author":"H Meyerhenke","year":"2017","unstructured":"Meyerhenke H, Sanders P, Schulz C (2017) Parallel graph partitioning for complex networks. IEEE Trans Parallel Distrib Syst 28(9):2625\u20132638","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"518_CR24","doi-asserted-by":"crossref","first-page":"28:1","DOI":"10.1186\/s13321-017-0213-3","volume":"9","author":"T Sch\u00e4fer","year":"2017","unstructured":"Sch\u00e4fer T, Kriege N, Humbeck L, Klein K, Koch O, Mutzel P (2017) Scaffold hunter: a comprehensive visual analytics framework for drug discovery. J. Cheminf 9(1):28:1\u201328:18","journal-title":"J. Cheminf"},{"key":"518_CR25","doi-asserted-by":"crossref","unstructured":"Sch\u00e4fer T, Mutzel P (2017) Struclus: scalable structural graph set clustering with representative sampling. In: Cong G, Peng W, Zhang WE, Li C, Sun A (eds) Advanced Data Mining and Applications\u201413th International Conference, ADMA 2017, Singapore, November 5-6, 2017, Proceedings, vol 10604 of Lecture Notes in Computer Science, pp 343\u2013359. Springer","DOI":"10.1007\/978-3-319-69179-4_24"},{"issue":"1","key":"518_CR26","doi-asserted-by":"crossref","first-page":"47:1","DOI":"10.1007\/s13278-016-0357-6","volume":"6","author":"WE Schlauch","year":"2016","unstructured":"Schlauch WE, Zweig KA (2016) Motif detection speed up by using equations based on the degree sequence. Social Netw Anal Min 6(1):47:1\u201347:20","journal-title":"Social Netw Anal Min"},{"key":"518_CR27","doi-asserted-by":"crossref","unstructured":"Schl\u00f6ter M, Skutella M (2017) Fast and memory-efficient algorithms for evacuation problems. In: Klein PN (ed) Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19, pp 821\u2013840. SIAM","DOI":"10.1137\/1.9781611974782.52"},{"issue":"4","key":"518_CR28","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1017\/nws.2016.20","volume":"4","author":"C Staudt","year":"2016","unstructured":"Staudt C, Sazonovs A, Meyerhenke H (2016) Networkit: a tool suite for large-scale complex network analysis. Netw Sci 4(4):508\u2013530","journal-title":"Netw Sci"},{"key":"518_CR29","doi-asserted-by":"crossref","unstructured":"Staudt CL, Hamann M, Safro I, Gutfraind A, Meyerhenke H (2016) Generating scaled replicas of real-world complex networks. In: Cherifi H, Gaito S, Quattrociocchi W, Sala A (eds) Complex Networks and Their Applications V - Proceedings of the 5th International Workshop on Complex Networks and their Applications (COMPLEX NETWORKS 2016), Milan, Italy, November 30-December 2, 2016, vol 693 of Studies in Computational Intelligence, pp 17\u201328. Springer","DOI":"10.1007\/978-3-319-50901-3_2"},{"key":"518_CR30","doi-asserted-by":"crossref","unstructured":"Stegmaier J, Arz J, Schott B, Otte JC, Kobitski A, Nienhaus GU, Str\u00e4hle U, Sanders P, Mikut R (2016) Generating semi-synthetic validation benchmarks for embryomics. In: 13th IEEE International Symposium on Biomedical Imaging, ISBI 2016, Prague, Czech Republic, April 13-16, 2016, pp 684\u2013688. IEEE","DOI":"10.1109\/ISBI.2016.7493359"},{"key":"518_CR31","doi-asserted-by":"crossref","unstructured":"von Looz M, \u00d6zdayi MS, Laue S, Meyerhenke H (2016) Generating massive complex networks with hyperbolic geometry faster in practice. In: 2016 IEEE High Performance Extreme Computing Conference, HPEC 2016, Waltham, MA, USA, September 13-15, 2016, pp 1\u20136. IEEE","DOI":"10.1109\/HPEC.2016.7761644"},{"issue":"1","key":"518_CR32","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1186\/s12859-017-1724-7","volume":"18","author":"A Wedemeyer","year":"2017","unstructured":"Wedemeyer A, Kliemann L, Srivastav A, Schielke C, Reusch TB, Rosenstiel P (2017) An improved filtering algorithm for big read datasets and its application to single-cell assembly. BMC Bioinf 18(1):324","journal-title":"BMC Bioinf"},{"key":"518_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-0741-6","volume-title":"Network analysis literacy\u2014a practical approach to the analysis of networks. Lecture notes in social networks","author":"KA Zweig","year":"2016","unstructured":"Zweig KA (2016) Network analysis literacy\u2014a practical approach to the analysis of networks. Lecture notes in social networks. Springer, Wien"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13218-017-0518-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-017-0518-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-017-0518-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T22:14:50Z","timestamp":1570486490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13218-017-0518-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,12]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["518"],"URL":"https:\/\/doi.org\/10.1007\/s13218-017-0518-4","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"value":"0933-1875","type":"print"},{"value":"1610-1987","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,12]]}}}