Completed Topics

• Evolutionary Graph Clustering [PDF]
  Sonja Biedermann
• A Heuristic Algorithm for Graph-Based Surface Segmentation in Volumetric Images [PDF]
  Rosa Zimmermann
• Engineering Algorithms for Fully Dynamic Maximal Matching [PDF]
  Richard Paul
• Practical Kernelization for the Edge Clique Cover Problem [PDF]
  Jonathan Trummer
• Reduced Nested Dissection for Fill Reducing Node Orderings [PDF]
  Wolfgang Martin Ost
• Dynamic All-Pairs Reachability on Partitioned Graphs [PDF]
  Alwin Stockinger
• Process Reordering in MPI for Cartesian Topologies and Isomorphic Communication Neighborhoods [PDF]
  Konrad von Kirchbach
• Update Your Network - Loop Free [PDF]
  Tabea Reichmann
• Fully Dynamic Detection of Constant-Size Subgraphs [PDF]
  Qi Cheng Hua
• Engineering Maximum Common Subgraph Algorithms for Large Graphs [PDF]
  Jonathan Trummer
• Algorithm Engineering for Fully Dynamic Subgraph Counting [PDF]
  Leonhard Paul Sidl
• Covering Rectilinear Polygons with Few and Small Axis-Aligned Rectangles [PDF]
  Julian Unterweger