The following pages link to Robert Scheidweiler (Q306112):
Displaying 11 items.
- A note on the duality between matchings and vertex covers in balanced hypergraphs (Q306113) (← links)
- (Q1730609) (redirect page) (← links)
- A flow based pruning scheme for enumerative equitable coloring algorithms (Q1730611) (← links)
- On chordal graph and line graph squares (Q1752465) (← links)
- A note on edge weightings inducing proper vertex colorings (Q1756095) (← links)
- Perfect \(f\)-matchings and \(f\)-factors in hypergraphs -- a combinatorial approach (Q2012539) (← links)
- New estimates for the gap chromatic number (Q2449176) (← links)
- Upper and lower bounds for competitive group testing (Q2700623) (← links)
- (Q2791973) (← links)
- A Polynomial Time Algorithm for Solving the Closest Vector Problem in Zonotopal Lattices (Q5163506) (← links)
- A Lower Bound for the Complexity of Monotone Graph Properties (Q5300493) (← links)
