Publikationen

Falls Sie an einer Publikation interessiert sind, die nicht online erhältlich ist, senden Sie mir einfach eine E-Mail-Anfrage an mein nachname at kit dot edu!

Journals

  • X. Liu, P. R. Pande, H. Meyerhenke, D. A. Bader: PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly. Submitted, 2011.

  • H. Meyerhenke, T. Sauerwald: Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning. Submitted to Algorithmica, special issue on ISAAC'10.

  • H. Meyerhenke, B. Monien, S. Schamberger: Graph Partitioning and Disturbed Diffusion. Parallel Computing, 35(10-11):544-569, 2009.
    [bibtex] [DOI:10.1016/j.parco.2009.09.006] [preprint (gzipped pdf)]

  • H. Meyerhenke, B. Monien, T. Sauerwald: A New Diffusion-based Multilevel Algorithm for Computing Graph Partitions. Journal of Parallel and Distributed Computing, 69(9):750-761, 2009. Best Paper Awards and Panel Summary: 22nd International Parallel and Distributed Processing Symposium (IPDPS 2008).
    [abstract] [bibtex] [DOI: 10.1016/j.jpdc.2009.04.005] [preprint (pdf)]

Conferences (and workshops with refereed proceedings)

  • J. Riedy, D.A. Bader, H. Meyerhenke: Scalable Multi-threaded Community Detection in Social Networks. To appear in Proc. Workshop on Multi-Threaded Architectures and Applications (MTAAP'12), in conjunction with 26th IEEE Internatl. Parallel and Distributed Processing Symposium (IPDPS'12), IEEE, 2012.

  • J. Riedy, H. Meyerhenke, D.A. Bader, D. Ediger, T. Mattson: Analysis of Streaming Social Networks on Multicore Architectures. To appear in Proc. 37th International Conference on Acoustics, Speech, and Signal Processing (ICASSP'12).

  • E.J. Riedy, H. Meyerhenke, D. Ediger, D.A. Bader: Parallel Community Detection for Massive Graphs. To appear in Proc. 9th Intl. Conf. on Parallel Processing and Applied Mathematics (PPAM'11). Springer-Verlag, 2012.

  • D. Ediger, J. Riedy, D.A. Bader, H. Meyerhenke: Tracking Structure of Streaming Social Networks. In Proc. Workshop on Multi-Threaded Architectures and Applications (MTAAP'11), in conjunction with 25th IEEE Internatl. Parallel and Distributed Processing Symposium (IPDPS'11), IEEE, 2011.

  • H. Meyerhenke: Beyond Good Shapes: Diffusion-based Graph Partitioning is Relaxed Cut Optimization. In Proc. 21st International Symposium on Algorithms and Computation (ISAAC'10), Part II, LNCS 6507, pp. 387-398. Springer-Verlag 2010. Invited to special issue of Algorithmica.
    [bibtex] [preprint (pdf)]

  • J. Gehweiler, H. Meyerhenke: A Distributed Diffusive Heuristic for Clustering a Virtual P2P Supercomputer. To appear in Proc. 7th High-Performance Grid Computing Workshop (HPGC'10), in conjunction with 24th IEEE Internatl. Parallel and Distributed Processing Symposium (IPDPS'10), IEEE, 2010.
    [bibtex] [preprint (pdf)]

  • H. Meyerhenke: Dynamic Load Balancing for Parallel Numerical Simulations based on Repartitioning with Disturbed Diffusion. In Proc. 15th Internatl. Conference on Parallel and Distributed Systems (ICPADS'09). IEEE, 2009.
    [abstract] [bibtex] [preprint (pdf)]

  • H. Meyerhenke, B. Monien, T. Sauerwald: A New Diffusion-based Multilevel Algorithm for Computing Graph Partitions of Very High Quality. In Proc. 22nd IEEE Internatl. Parallel and Distributed Processing Symposium (IPDPS'08). Winner of the Best Algorithms Paper Award.
    [abstract] [bibtex] [preprint (pdf)] or [pdf at IEEE Xplore, © IEEE Computer Society 2008]

  • H. Meyerhenke, T. Sauerwald: Analyzing Disturbed Diffusion on Networks. In Proc. 17th International Symposium on Algorithms and Computation (ISAAC'06), LNCS 4288, pp. 429-438. Springer-Verlag, 2006.
    [abstract] [bibtex] [pdf, © Springer-Verlag, Berlin Heidelberg 2006]

  • H. Meyerhenke, S. Schamberger: A Parallel Shape Optimizing Load Balancer. In Proc. 12th Int. Euro-Par Conf. 2006, LNCS 4128, pp. 232-242. Springer-Verlag, 2006.
    [abstract] [bibtex] [pdf, © Springer-Verlag, Berlin Heidelberg 2006]

  • H. Meyerhenke, B. Monien, S. Schamberger: Accelerating Shape Optimizing Load Balancing for Parallel FEM Simulations by Algebraic Multigrid. In Proc. 20th IEEE Internatl. Parallel and Distributed Processing Symposium (IPDPS'06), p. 57 (CD), IEEE Computer Society, 2006.
    [abstract] [bibtex] [preprint (pdf)] [pdf at IEEE Xplore, © IEEE Computer Society 2006]

  • H. Meyerhenke, S. Schamberger: Balancing Parallel Adaptive FEM Computations by Solving Systems of Linear Equations. In Proc. 11th Int. Euro-Par Conf. 2005, LNCS 3648, pp. 209-219. Springer-Verlag, 2005.
    [abstract] [bibtex] [pdf, © Springer-Verlag, Berlin Heidelberg 2005]

Book Chapters

  • D. Ediger, J. Riedy, D. A. Bader, H. Meyerhenke: Computational Graph Analytics for Massive Streaming Data. Submitted, 2011.

  • D. Ajwani, H. Meyerhenke: Realistic Computer Models. In: Matthias Müller-Hannemann, Stefan Schirra (eds.): Algorithm Engineering. Bridging the Gap between Algorithm Theory and Practice. Lecture Notes in Computer Science 5971, pp. 194-236. Springer-Verlag, 2010.
    [bibtex] [preprint (pdf)]

Workshops

  • B. Monien, H. Meyerhenke: Recent Trends in Graph Partitioning for Scientific Computing. Invited talk presented by Burkhard Monien at SIAM Workshop on Combinatorial Scientific Computing (CSC'11).
    [ppsx, 14MB]

  • H. Meyerhenke, B. Monien: On Multilevel Diffusion-based Load Balancing for Parallel Adaptive Numerical Simulations. Presented at SIAM Conference on Computational Science and Engineering (CSE'11), Reno, (Nevada, USA), February/March 2011.

  • H. Meyerhenke, J. Gehweiler: On Dynamic Graph Partitioning and Graph Clustering using Diffusion. In: Algorithm Engineering, 27.06. - 02.07.2010. Dagstuhl Seminar Proceedings 10261, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2010.
    [pdf]

  • H. Meyerhenke, B. Monien, S. Schamberger, T. Sauerwald: Graph Clustering based on Disturbed Diffusion. In Proc. Oberwolfach Workshop Algorithm Engineering, Math. Forschungsinstitut Oberwolfach Report No. 25/2007, pp. 1430-1431.
    [pdf at MFO]

  • H. Meyerhenke, B. Monien, T. Sauerwald: Parallel Graph Clustering Based on Disturbed Diffusion. In: Web Information Retrieval and Linear Algebra Algorithms, 11.02. - 16.02.2007. Dagstuhl Seminar Abstracts Collection 07071, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2007.
    [pdf at Dagstuhl]

  • B. Monien, S. Schamberger, U.-P. Schroeder, H. Meyerhenke: On Balancing of Dynamic Networks. In New Trends in Parallel & Distributed Computing, 6th Heinz Nixdorf Symposium (2006), HNI-Verlagsschriftenreihe, vol. 181, pp. 171-181.
    [preprint (pdf)]

  • H. Meyerhenke: Constructing Higher Order Voronoi Diagrams in Parallel. In European Workshop on Computational Geometry 2005, pp. 123-126.
    [pdf]

  • H. Meyerhenke: PFDC: A Parallel Algorithm for Fast Density-based Clustering in Large Spatial Databases. In Informatiktage 2002, Konradin Verlagsgruppe 2003, pp. 48 - 52.
    [pdf]

Reports

  • H. Meyerhenke, B. Monien, T. Sauerwald. Parallel Graph Clustering based on Disturbed Diffusion. Technical Report tr-ri-07-280, Universität Paderborn, Jan. 2007.

  • H. Meyerhenke, H.-D. Hecker: Parallele Algorithmische Geometrie anhand von Delaunay-Triangulationen. Jenaer Schriften zur Mathematik und Informatik, Math/Inf/04/05. Friedrich-Schiller-Universität Jena, Mai 2005.
    [abstract]

  • H. Meyerhenke, H.-D. Hecker: Delaunay-Triangulation und Tiefensortierung auf grobkörnigen Parallelrechnern. Jenaer Schriften zur Mathematik und Informatik, Math/Inf/10/04. Friedrich-Schiller-Universität Jena, August 2004.
    [abstract]

  • H. Meyerhenke, H.-D. Hecker: Parallelverarbeitung von Delaunay-Triangulationen und Voronoi-Diagrammen höherer Ordnung. Jenaer Schriften zur Mathematik und Informatik, Math/Inf/09/04. Friedrich-Schiller-Universität Jena, August 2004.
    [abstract]

  • H. Meyerhenke: Fast Density-based Clustering in Parallel with Different Parallel K-d Tree Schemes. Jenaer Schriften zur Mathematik und Informatik, Math/Inf/17/02. Friedrich-Schiller-Universität Jena, November 2002.
    (ask me via e-mail for [pdf])

Theses

  • H. Meyerhenke: Disturbed Diffusive Schemes for Solving Partitioning Problems on Graphs. Dissertation, University of Paderborn, April 2008.
    [abstract (en)] [abstract (de)] [bibtex] [pdf]

  • H. Meyerhenke: Parallelverarbeitung spezieller Triangulationen. Diplomarbeit, Friedrich-Schiller-Universität Jena, August 2004.
    [pdf]