News Archive

  • Oct 31, 2016:
    Two recent paper acceptances: Hoske et al. in Algorithms, Staudt et al. at the Complex Networks 2016 workshop!
  • Sep 15, 2016:
    A warm welcome to our new group member Charilaos "Harry" Tzovas!
  • Sep 13, 2016:
    Our paper on big graph frameworks for network analysis (authors: Koch, Staudt, Vogel, Meyerhenke) has been accepted by Springer's journal SNAM!
  • Sep 9, 2016:
    Our journal paper on partitioning complex networks (authors: Meyerhenke, Sanders, Schulz) has been accepted by Springer's J. of Heuristics!
  • July 15, 2016:
    We are in the new Bitkom brochure on Big Data in Germany.
  • July 6, 2016:
    Our paper on current-flow closeness approximation using a multigrid Laplacian solver (authors: Bergamini, Wegner, Lukarski, Meyerhenke) has been accepted at CSC 2016.
  • June 21, 2016:
    Congratulations to our group member Christian Staudt, who defended his PhD thesis successfully today!
  • June 17, 2016:
    Two HPEC 2016 papers with our participation have been accepted, one on fast complex network generation and one on GraphBLAS.
  • June 10, 2016
    Our paper on probabilistic neighborhood queries (authors: von Looz, Meyerhenke) has been accepted at IWOCA 2016.
  • May 9, 2016:
    The journal paper on our network analysis toolkit NetworKit (authors: Staudt, Sazonovs, Meyerhenke) has been accepted by the journal Network Science.
  • Apr 11, 2016:
    Two journal papers accepted, one on sparsification of social networks in SNAM, one on dynamic betweenness centrality algorithms in Internet Mathematics!
  • March 10, 2016:
    Our collaboration paper on partitions of protein graphs (authors: von Looz, Wolter, Jacob, Meyerhenke) has been accepted at SEA 2016.
  • Feb 2016:
    Spring School in Chennai, India!
  • Dec 16, 2015:
    The BMBF has accepted our joint proposal for the 3-year project An HPC toolbox for the simulation and inversion of wave fields. Our group will take care of the load balancing part.
  • Dec 14, 2015:
    Congratulations to our PhD student Elisabetta Bergamini for winning a SIAM Travel Award in order to present our work at ALENEX16!
  • Nov 25, 2015:
    Henning Meyerhenke nimmt heute um 19:30 Uhr an einer hochrangig besetzten Podiumsdiskussion als Vertreter der Juniorprofessoren/-innen teil.
  • Oct 20, 2015:
    Two papers we co-authored on closeness centrality and on hypergraph partitioning have been accepted at ALENEX 2016.
  • Aug 31, 2015:
    Our paper on generating random hyperbolic graphs in subquadratic time (authors: von Looz, Prutkin, Meyerhenke) has been accepted at the 26th International Symposium on Algorithms and Computation.
  • Jul 22, 2015:
    Our paper on drawing large graphs (authors: Meyerhenke, Nöllenburg, Schulz) has been accepted at the 23rd International Symposium on Graph Drawing and Network Visualization.
  • Jul 17, 2015:
    Congratulations to our Master student Daniel Hoske (now at Google) for his award as best Master CS graduate in the academic year 2014/2015!
  • Jul 2, 2015:
    Two publications are accepted for presentation in Paris: Structure-presevering Sparsification of Social Networks at ASONAM 2015 and Complex Network Analysis on Distributed Systems: An Empirical Comparison at the co-located FAB 2015
  • Jun 30, 2015:
    M. Wegner presents our paper Is nearly-linear the same in Theory and Practice? A Case Study with a Combinatorial Laplacian Solver at SEA 2015 in Paris.
  • Jun 16, 2015:
    Our paper on fully-dynamic approximation of betweenness centrality (authors: Bergamini, Meyerhenke) has been accepted at the 23rd European Symposium on Algorithms (ESA 2015).
  • Apr 29, 2015:
    H. Meyerhenke hosts a session on algorithms and tools for large-scale network analysis at ARS 2015.
  • Mar 2, 2015:
    Roland Glantz and Sebastian Gieße present in the ParCo seminar.
  • Jan 30, 2015:
    Marc Nemes presents Extending NetworKit at 2.30pm in room 301.
  • Jan 23, 2015:
    Elisabetta Bergamini presents Approximating betweenness centrality in dynamic graphs at 1pm in room 131.
  • Jan 23, 2015:
    Jannis Koch presents Network Analysis on Distributed Systems at 2pm in room 301.
  • Jan 22, 2015:
    Moritz von Looz presents Fast graph generation with a hyperbolic unit disk model at 4pm in room 010.
  • Dec 26, 2014:
    Our paper on parallel community detection (authors: Staudt, Meyerhenke) has been accepted by IEEE TPDS.
  • Dec 22, 2014:
    Congratulations to our PhD student Elisabetta Bergamini for winning a SIAM Travel Award in order to present our work at ALENEX15!
  • Dec 12, 2014:
    Our paper on parallel graph partitioning (authors: Meyerhenke, Sanders, Schulz) has been accepted at the 29th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2015).
  • Dec 9, 2014:
    Daniel Hoske presents An experimental study of a nearly-linear time Laplacian solver at 2pm in room 010.
  • Dec 4, 2014:
    We have released version 3.4 of NetworKit, the open-source toolkit for high-performance network analysis.
  • Nov 27, 2014:
    Prof. Ulrik Brandes (U Konstanz) presents A New Approach to Social Network Analysis at 1pm in room 236.
  • Nov 9-14, 2014: Dagstuhl seminar 14461 High-perfor- mance Graph Algorithms and Applications in Computational Science
  • Nov 7, 2014:
    Hoang Vu Nguyen (IPD Böhm) presents Non-parametric Methods for Correlation Analysis in Multivariate Data at 1pm in room 131.
  • Nov 3, 2014:
    Our paper on mapping parallel processes onto grid and torus architectures (authors: Glantz, Meyerhenke, Noe) has been accepted at the 23rd Inter-national Conference on Parallel, Distributed, and Network-Based Processing (PDP 2015).
  • Oct 23, 2014:
    Gerd Lindner presents Complex Network Backbones at 1.15pm in room 010.
  • Oct 21, 2014:
    Our paper on approximating betweenness centrality in dynamic networks (authors: Bergamini, Meyerhenke, Staudt) has been accepted at the 17th SIAM Meeting on Algorithm Engineering and Experiments, ALENEX 2015.
  • Oct 13, 2014:
    Alexander Noe presents Benchmarking of Topology-aware Mappings and a Bottom-Up Multilevel Mapping Algorithm at 2pm in room -102.
  • Sep 28, 2014:
    Our paper on selective community detection (authors: Staudt, Marrakchi, Meyerhenke) has been accepted at the First International Workshop on High Performance Big Graph Data Management, Analysis, and Mining (in Conjunction with IEEE BigData'14).
  • Sep 17-19, 2014:
    Henning Meyerhenke presents invited contributions at the Final Meeting of the SPP Algorithm Engineering and the AE Summer School.
  • Aug 22, 2014:
    NetworKit 3.3 has been released, including new features and important bug fixes for our network analysis toolkit.
  • June 18, 2014:
    Our group has moved, we are now in rooms 033-035 of the CS building 50.34.
  • June 1, 2014:
    Congratulations to our PhD student Christian Staudt for winning a SIAM Travel Award in order to present our work at SIAM NS14!
  • May 15, 2014:
    A warm welcome to our new PhD students Elisabetta Bergamini and Moritz von Looz!
  • Mar 20, 2014:
    Our project proposal FINCA within the SPP Algorithms for Big Data has been approved by DFG, together with three other projects from ITI!
  • Mar 14, 2014:
    Our two papers on partitioning complex networks have been accepted at SEA 2014. Both are available on arXiv (Glantz, Meyerhenke and Schulz as well as Meyerhenke, Sanders and Schulz).
  • Mar 14, 2014:
    Vortrag unseres Gastes Kay Hamacher, TU Darmstadt, über Coarse-graining in MD-Simulationen um 11 Uhr im SR 236.
  • Jan 24, 2014:
    Our guest Ravi Sundaram, Northeastern U (Boston, USA), presents From Akamai to Maygh: an overview of content delivery at 2pm in room 301.
  • Nov 12, 2013:
    Our grant proposal on graph partitioning and mapping has been accepted by DFG! Check out the project description of TEAM!
  • Oct 15, 2013:
    We welcome Maximilian Vogel as student research assistant and NetworKit developer.
  • Oct 3, 2013:
    We present our paper Engineering High-Performance Community Detection Heuristics for Massive Graphs (authors: Staudt and Meyerhenke) at ICPP 2013
  • Sep 23, 2013:
    Henning Meyerhenke gives a talk on community detection at the Dagstuhl seminar 13391 Algorithm Engineering.
  • Jul 12, 2013:
    Our Dagstuhl seminar proposal has been accepted. See the seminar homepage for details (more to come).
  • Jul 11, 2013:
    At the European Conference on Data Analysis our ongoing work on selective and dynamic community detection in large complex networks is presented by Christian Staudt.
  • Jun 14, 2013:
    Our paper Engineering High-Performance Community Detection Heuristics for Massive Graphs (authors: Staudt and Meyerhenke) has been accepted at ICPP 2013.
  • May 27, 2013:
    We welcome Aleksejs Sazonovs, who will work with us as a student research assistant during a 3 month internship in the DAAD RISE program.
  • May 22, 2013:
    Roland Glantz gives a talk at CIAC 2013 (Barcelona) on Finding all Convex Cuts of a Plane Graph.
  • Apr 18, 2013:
    The proposal for a YIN grant by M. Nöllenburg and H. Meyerhenke was accepted!
  • Apr 4, 2013:
    Wir bieten mehrere neue Themen als Bachelor- oder Masterarbeiten an.
  • Mar 28, 2013:
    AMS publishes the book Graph Partitioning and Graph Clustering co-edited by Henning Meyerhenke.
  • Feb 27, 2013: Henning Meyerhenke gives a talk at SIAM CSE'13 on Combinatorial and Numerical Algorithms for Network Analysis.
  • Feb 23/24, 2013: Henning Meyerhenke attends the European Career Fair at MIT in Cambridge, MA. As a KIT representative he gives a talk on Juniorprofessorhips in Germany.
  • Jan 28, 2013: Am 28.01.2013 hält Henning Meyerhenke um 17:30 Uhr seine Antrittsvorlesung (Folien) im Geb. 50.34, HS -101. Interessenten sind herzlich eingeladen!
  • Dec 20, 2012: The paper Finding all Convex Cuts of a Plane Graph (authors: Glantz and Meyerhenke) has been accepted at CIAC 2013.
  • Dec 11, 2012: Im Rahmen des diesjährigen "Adventskalenders" der Fachschaft für Mathematik und Informatik findet am 11. Dezember, 17-18 Uhr, eine adventliche Sondersprechstunde bei Henning Meyerhenke statt.
  • Oct 1, 2012: We welcome our new group member Christian Staudt, who pursues a PhD degree in computer science.
  • Aug 7, 2012: SR 301, 10:30am: T. Sauerwald (Max Planck Institute for Computer Science, Saarbrücken) gives a talk on Tight Bounds for Randomized Load Balancing on Arbitrary Network Topologies.
  • Aug 22, 2012: H. Meyerhenke gives a talk on Current trends in graph clustering at an ISMP'12 minisymposium organized by Renato Werneck, Microsoft Research.
  • Aug 15, 2012: H. Meyerhenke's grant proposal on network analysis has been accepted by MWK.
  • Jul 15 - 21, 2012: H. Meyerhenke gives a talk at the ICiS Workshop on Graph and Hypergraph Problems in Computational Science: Applications and Algorithms in Park City (USA).
  • June 5, 2012: The paper PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly (authors: Liu, Pande, Meyerhenke, Bader) has been accepted by IEEE TPDS.
  • June 5, 2012: The paper Beyond Good Partition Shapes: An Analysis of Diffusive Graph Partitioning (authors: Meyerhenke, Sauerwald) has been accepted by Algorithmica.
  • Apr 2, 2012: Dr. Roland Glantz joins our research group.
  • Feb 14 - 17, 2012: H. Meyerhenke attends the SIAM conference Parallel Processing in Savannah (USA) as co-organizer of a minisymposium and speaker.
  • Feb 13/14, 2012: H. Meyerhenke attends the 10th DIMACS Implementation Challenge Workshop in Atlanta (USA) as co-organizer and (co-)author of two papers.
  • Nov 7, 2011: The new research group's website is online.
  • Oct 1, 2011: The research group Theoretical Computer Science / Parallel Computing starts its work at the Institute of Theoretical Informatics of KIT.