Matchings in balanced hypergraphs. - Robert Scheidweiler; Eberhard Triesch (CTW, 2011)

New Estimations of the Gap-k-coloring Number. - Robert Scheidweiler; Eberhard Triesch (CTW, 2012)

A Lower Bound for the Complexity of Monotone Graph Properties. - Robert Scheidweiler; Eberhard Triesch (SIAM J. Discret. Math., 2013)

New estimates for the gap chromatic number. - Robert Scheidweiler; Eberhard Triesch (Discret. Math., 2014)

A note on the duality between matchings and vertex covers in balanced hypergraphs. - Robert Scheidweiler; Eberhard Triesch (J. Comb. Optim., 2016)

Perfect f-matchings and f-factors in hypergraphs - A combinatorial approach. - Isabel Beckenbach; Robert Scheidweiler (Discret. Math., 2017)

On chordal graph and line graph squares. - Robert Scheidweiler; Sebastian Wiederrecht (Discret. Appl. Math., 2018)

A Note on Edge Weightings Inducing Proper Vertex Colorings. - Anna M. Limbach; Robert Scheidweiler (Graphs Comb., 2018)

A flow based pruning scheme for enumerative equitable coloring algorithms. - Arie M. C. A. Koster; Robert Scheidweiler; Martin Tieves (Ann. Oper. Res., 2019)

A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices. - S. Thomas McCormick; Britta Peis; Robert Scheidweiler; Frank Vallentin (SIAM J. Discret. Math., 2021)

Upper and lower bounds for competitive group testing. - Robert Scheidweiler; Eberhard Triesch (Discret. Appl. Math., 2023)