Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Stefan Neumann

Stefan Neumann

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Algorithms×1

Frequent co-authors

Sebastian Lüderssen1×
Pan Peng1×

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

Papers

cs.DSTheoreticalRecentJun 16, 2026

Four-Cycle Counting in Low-Degeneracy Graph Streams

Sebastian Lüderssen, Stefan Neumann, Pan Peng

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.

View →