4 citations · 4 across the 6 of their papers we have counts for
5 papers · 1 filter
Effective Khovanskii, Ehrhart Polytopes, and the Erdős Multiplication Table Problem
Anna Margarethe Limbach, Robert Scheidweiler, Eberhard Triesch
Let be the set of products of factors from the set In 1955, Erdős posed the problem of determining the order of magnitude of and prove…
Upper and Lower Bounds for Competitive Group Testing
Robert Scheidweiler, Eberhard Triesch
We consider competitive algorithms for adaptive group testing problems. In the first part of the paper, we develop an algorithm with competitive constant c < 1.452 thus improving t…
On Chordal Graph and Line Graph Squares
Robert Scheidweiler, Sebastian Wiederrecht
In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induc…
A flow based pruning scheme for enumerative equitable coloring algorithms
Arie Koster, Robert Schweidweiler, Martin Tieves
An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the color classes differ by at most one. The equitable chromatic number is the smallest numb…
Matchings in balanced hypergraphs
Robert Scheidweiler, Eberhard Triesch
We give a new proof of König's theorem and generalize the Gallai-Edmonds decomposition to balanced hypergraphs in two different ways. Based on our decompositions we give two new ch…