2 citations · 2 across the 1 of their papers we have counts for
3 papers
cs.DM2020
Constructing Depth-Optimum Circuits for Adders and AND-OR Paths
Ulrich Brenner, Anna Hermann, Jannik Silvanus
We examine the fundamental problem of constructing depth-optimum circuits for binary addition. More precisely, as in literature, we consider the following problem: Given auxiliary…
math.CO2017
Few Sequence Pairs Suffice: Representing All Rectangle Placements
Jannik Silvanus, Jens Vygen
We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representat…
cs.DS2014★ 2 cited
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Stefan Hougardy, Jannik Silvanus, Jens Vygen
We present a new exact algorithm for the Steiner tree problem in edge-weighted graphs. Our algorithm improves the classical dynamic programming approach by Dreyfus and Wagner. We a…