6 citations · 9 across the 4 of their papers we have counts for
4 papers
An Optimal Realization Algorithm for Bipartite Graphs with Degrees in Prescribed Intervals
Steffen Rechner
We consider the problem of constructing a bipartite graph whose degrees lie in prescribed intervals. Necessary and sufficient conditions for the existence of such graphs are well-k…
Gerbil: A Fast and Memory-Efficient -mer Counter with GPU-Support
Marius Erbert, Steffen Rechner, Matthias Müller-Hannemann
A basic task in bioinformatics is the counting of -mers in genome strings. The -mer counting problem is to build a histogram of all substrings of length in a given genome…
Marathon: An open source software library for the analysis of Markov-Chain Monte Carlo algorithms
Steffen Rechner, Annabell Berger
In this paper, we consider the Markov-Chain Monte Carlo (MCMC) approach for random sampling of combinatorial objects. The running time of such an algorithm depends on the total mix…
Broder's Chain Is Not Rapidly Mixing
Annabell Berger, Steffen Rechner
We prove that Broder's Markov chain for approximate sampling near-perfect and perfect matchings is not rapidly mixing for Hamiltonian, regular, threshold and planar bipartite graph…