2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.DS2026
Enumerating Length-Bounded Simple Paths and Cycles in Directed Graphs with Delay Using Edge-Consistent Node Barriers
Frank Bauernöppel, Jörg-Rüdiger Sack
Enumerating simple paths and cycles subject to a given length bound is a fundamental problem in graph algorithms. Recent algorithms, namely BC-DFS (Peng et al. 2019, 2021) and CYCL…
cs.DS2025
Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
Frank Bauernöppel, Jörg-Rüdiger Sack
In 2021, Gupta and Suzumura proposed a novel algorithm for enumerating all bounded-length simple cycles in directed graphs (arXiv:2105.10094). In this work, we present a concrete c…
cs.CR2021★ 2 cited
Obfuscation of Images via Differential Privacy: From Facial Images to General Images
William Croft, Jörg-Rüdiger Sack, Wei Shi
Due to the pervasiveness of image capturing devices in every-day life, images of individuals are routinely captured. Although this has enabled many benefits, it also infringes on p…