The following pages link to Sebastian Berndt (Q831831):
Displaying 22 items.
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- On the gold standard for security of universal steganography (Q1648780) (← links)
- Computing tree width: from theory to practice and back (Q1670723) (← links)
- Using structural properties for integer programs (Q1670725) (← links)
- Practical access to dynamic programming on tree decompositions (Q2005578) (← links)
- Learning residual alternating automata (Q2105462) (← links)
- Robust online algorithms for dynamic choosing problems (Q2117763) (← links)
- Online load balancing with general reassignment cost (Q2157902) (← links)
- Robust online algorithms for certain dynamic packing problems (Q2193079) (← links)
- On the universal steganography of optimal rate (Q2216130) (← links)
- Positive-instance driven dynamic programming for graph searching (Q2285082) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Online bin covering with limited migration (Q2689369) (← links)
- Steganography Based on Pattern Languages (Q2798735) (← links)
- Jdrasil: A Modular Library for Computing Tree Decompositions (Q4580187) (← links)
- (Q4636498) (← links)
- Practical Access to Dynamic Programming on Tree Decompositions (Q5009563) (← links)
- Online Bin Covering with Limited Migration (Q5075753) (← links)
- (Q5089171) (← links)
- (Q5351895) (← links)
- (Q6089675) (← links)
- (Q6089676) (← links)
