Approximate computation of zero-dimensional polynomial ideals. - Daniel Heldt; Martin Kreuzer; Sebastian Pokutta; Hennie Poulisse (J. Symb. Comput., 2009)

Edge-intersection graphs of grid paths: The bend-number. - Daniel Heldt; Kolja B. Knauer; Torsten Ueckerdt (Discret. Appl. Math., 2014)

On the bend-number of planar and outerplanar graphs. - Daniel Heldt; Kolja B. Knauer; Torsten Ueckerdt (Discret. Appl. Math., 2014)

Lattice Path Enumeration and Toeplitz Matrices. - Stefan Felsner; Daniel Heldt (J. Integer Seq., 2015)

Mixing Times of Markov Chains of 2-Orientations. - Stefan Felsner; Daniel Heldt (WALCOM, 2016)

Mixing Times of Markov Chains on Degree Constrained Orientations of Planar Graphs. - Stefan Felsner; Daniel Heldt (Discret. Math. Theor. Comput. Sci., 2016)

Block coupling and rapidly mixing k-heights. - Stefan Felsner; Daniel Heldt; Sandro Roch; Peter Winkler (CoRR, 2024)