On spanning tree congestion. - Christian Löwenstein; Dieter Rautenbach; Friedrich Regen (Discret. Math., 2009)

On packing shortest cycles in graphs. - Dieter Rautenbach; Friedrich Regen (Inf. Process. Lett., 2009)

Packing edge-disjoint cycles in graphs and the cyclomatic number. - Jochen Harant; Dieter Rautenbach; Peter Recht; Friedrich Regen (Discret. Math., 2010)

Minimum degree and density of binary sequences. - Stephan Brandt; Janina Müttel; Dieter Rautenbach; Friedrich Regen (Eur. J. Comb., 2010)

Edge-Injective and Edge-Surjective Vertex Labellings. - Stephan Brandt; Jozef Miskuf; Dieter Rautenbach; Friedrich Regen; Imre Z. Ruzsa (SIAM J. Discret. Math., 2010)

On Hamiltonian paths in distance graphs. - Christian Löwenstein; Dieter Rautenbach; Friedrich Regen (Appl. Math. Lett., 2011)

Lower bounds on the independence number of certain graphs of odd girth at least seven. - Anders Sune Pedersen; Dieter Rautenbach; Friedrich Regen (Discret. Appl. Math., 2011)

Independence, odd girth, and average degree. - Christian Löwenstein; Anders Sune Pedersen; Dieter Rautenbach; Friedrich Regen (J. Graph Theory, 2011)

Graphs with many Vertex-Disjoint Cycles. - Dieter Rautenbach; Friedrich Regen (Discret. Math. Theor. Comput. Sci., 2012)

Cycle spectra of Hamiltonian graphs. - Kevin G. Milans; Florian Pfender; Dieter Rautenbach; Friedrich Regen; Douglas B. West (J. Comb. Theory B, 2012)

Chiraptophobic Cockroaches evading a Torch Light. - Christian Löwenstein; Dieter Rautenbach; Friedrich Regen (Ars Comb., 2013)

On the Cycle Spectrum of Cubic Hamiltonian Graphs. - Janina Müttel; Dieter Rautenbach; Friedrich Regen; Thomas Sasse (Graphs Comb., 2013)