Robert Scheidweiler

According to our database, Robert Scheidweiler authored at least 11 papers between 2011 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2023

Upper and lower bounds for competitive group testing.

Robert Scheidweiler, Eberhard Triesch

Discret. Appl. Math., July, 2023

2021

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

2019

A flow based pruning scheme for enumerative equitable coloring algorithms.

Arie M. C. A. Koster, Robert Scheidweiler, Martin Tieves

Ann. Oper. Res., 2019

2018

A Note on Edge Weightings Inducing Proper Vertex Colorings.

Anna M. Limbach, Robert Scheidweiler

Graphs Comb., 2018

On chordal graph and line graph squares.

Robert Scheidweiler, Sebastian Wiederrecht

Discret. Appl. Math., 2018

2017

Perfect f-matchings and f-factors in hypergraphs - A combinatorial approach.

Isabel Beckenbach, Robert Scheidweiler

Discret. Math., 2017

2016

A note on the duality between matchings and vertex covers in balanced hypergraphs.

Robert Scheidweiler, Eberhard Triesch

J. Comb. Optim., 2016

2014

New estimates for the gap chromatic number.

Robert Scheidweiler, Eberhard Triesch

Discret. Math., 2014

2013

A Lower Bound for the Complexity of Monotone Graph Properties.

Robert Scheidweiler, Eberhard Triesch

SIAM J. Discret. Math., 2013

2012

New Estimations of the Gap-k-coloring Number.

Robert Scheidweiler, Eberhard Triesch

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Matchings in balanced hypergraphs.

Robert Scheidweiler, Eberhard Triesch

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011