Robert Scheidweiler

13 papers C 2Journal 11
YearRankTypeTitle / Venue / Authors
2023 J jnl
Upper and lower bounds for competitive group testing.
Discret. Appl. Math.
Robert Scheidweiler, Eberhard Triesch
2021 J jnl
A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices.
SIAM J. Discret. Math.
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
2020 J jnl
A polynomial time algorithm for solving the closest vector problem in zonotopal lattices.
CoRR
S. Thomas McCormick, Britta Peis, Robert Scheidweiler, Frank Vallentin
2019 J jnl
A flow based pruning scheme for enumerative equitable coloring algorithms.
Ann. Oper. Res.
Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves
2018 J jnl
A Note on Edge Weightings Inducing Proper Vertex Colorings.
Graphs Comb.
Anna M. Limbach, Robert Scheidweiler
2018 J jnl
On chordal graph and line graph squares.
Discret. Appl. Math.
Robert Scheidweiler, Sebastian Wiederrecht
2017 J jnl
Perfect f-matchings and f-factors in hypergraphs - A combinatorial approach.
Discret. Math.
Isabel Beckenbach, Robert Scheidweiler
2016 J jnl
A flow based pruning scheme for enumerative equitable coloring algorithms.
CoRR
Arie Koster, Robert Scheidweiler, Martin Tieves
2016 J jnl
A note on the duality between matchings and vertex covers in balanced hypergraphs.
J. Comb. Optim.
Robert Scheidweiler, Eberhard Triesch
2014 J jnl
New estimates for the gap chromatic number.
Discret. Math.
Robert Scheidweiler, Eberhard Triesch
2013 J jnl
A Lower Bound for the Complexity of Monotone Graph Properties.
SIAM J. Discret. Math.
Robert Scheidweiler, Eberhard Triesch
2012 C conf
New Estimations of the Gap-k-coloring Number.
CTW
Robert Scheidweiler, Eberhard Triesch
2011 C conf
Matchings in balanced hypergraphs.
CTW
Robert Scheidweiler, Eberhard Triesch