14 citations · 40 across the 10 of their papers we have counts for
3 papers · 1 filter
Engineering Exact Quasi-Threshold Editing
Lars Gottesbüren, Michael Hamann, Philipp Schoch +3
Quasi-threshold graphs are -free graphs, i.e., they do not contain any cycle or path of four nodes as an induced subgraph. We study the -free editing pr…
Advanced Flow-Based Multilevel Hypergraph Partitioning
Lars Gottesbüren, Michael Hamann, Sebastian Schlag +1
The balanced hypergraph partitioning problem is to partition a hypergraph into disjoint blocks of bounded size such that the sum of the number of blocks connected by each hyper…
Recent Advances in Scalable Network Generation
Manuel Penschuck, Ulrik Brandes, Michael Hamann +5
Random graph models are frequently used as a controllable and versatile data source for experimental campaigns in various research fields. Generating such data-sets at scale is a n…