2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.CG2024★ 2 cited
Recognition of Unit Segment and Polyline Graphs is -Complete
Michael Hoffmann, Tillmann Miltzow, Simon Weber +1
Given a set of objects in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corres…
cs.DS2019
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics
Maciej Besta, Simon Weber, Lukas Gianinazzi +4
We propose Slim Graph: the first programming model and framework for practical lossy graph compression that facilitates high-performance approximate graph processing, storage, and…