2 citations · 4 across the 7 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cond-mat.supr-con2020★ 1 cited
Multiple scattering camouflaged as magnetic stripes in single crystals of superconducting (La,Sr)CuO
A. -E. Ţuţueanu, T. B. Tejsner, M. E. Lǎcǎtuşu +6
Neutron diffraction has been a very prominent tool to investigate high-temperature superconductors, in particular through the discovery of an incommensurate magnetic signal known a…
cs.DS2020
On Hop-Constrained Steiner Trees in Tree-Like Metrics
Martin Böhm, Ruben Hoeksma, Nicole Megow +2
We consider the problem of computing a Steiner tree of minimum cost under a hop constraint which requires the depth of the tree to be at most . Our main result is an exact algor…
cs.DS2020★ 2 cited
Discovering and Certifying Lower Bounds for the Online Bin Stretching Problem
Martin Böhm, Bertrand Simon
There are several problems in the theory of online computation where tight lower bounds on the competitive ratio are unknown and expected to be difficult to describe in a short for…