Robert Scheidweiler

Publication Activity (10 Years)

Years Active: 2011-2023
Publications (10 Years): 9

Top Topics

Graph Properties

Strongly Polynomial

Top Venues

Discret. Appl. Math.

SIAM J. Discret. Math.

Publications

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