Stefan Neumann
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Algorithms×1
Frequent co-authors
Research Timeline
2026
Four-Cycle Counting in Low-Degeneracy Graph Streams
This paper proposes two algorithms for approximating the number of four-cycles in graph edge streams, improving upon existing theoretical bounds and handling non-concentrated four-cycles in one-pass.
Highlighted terms show continued research focus across papers