output
20022025
most citedNWChem: Past, Present, and Future

699 citations

Showing 2014Show all

61 papers · 1 filter

cs.DS2014

An Improved Approximation Algorithm for the Traveling Salesman Problem with Relaxed Triangle Inequality

Tobias Mömke

Given a complete edge-weighted graph G, we present a polynomial time algorithm to compute a degree-four-bounded spanning Eulerian subgraph of 2G that has at most 1.5 times the weig…

q-bio.CB2014

Optimal Observation Time Points in Stochastic Chemical Kinetics

Charalampos Kyriakopoulos, Verena Wolf

Wet-lab experiments, in which the dynamics within living cells are observed, are usually costly and time consuming. This is particularly true if single-cell measurements are obtain…

quant-ph201432 cited

Optomechanical laser cooling with mechanical modulations

Marc Bienert, Pablo Barberis-Blostein

We theoretically study the laser cooling of cavity optomechanics when the mechanical resonance frequency and damping depend on time. In the regime of weak optomechanical coupling w…

quant-ph201421 cited

Quantum optical master equation for solid-state quantum emitters

Ralf Betzholz, Juan Mauricio Torres, Marc Bienert

We provide an elementary description of the dynamics of defect centers in crystals in terms of a quantum optical master equation which includes spontaneous decay and a simplified v…

math.NT20141 cited

Some congruences for Siegel theta series

Rainer Schulze-Pillot

We discuss an arithmetic approach to some congruence properties of Siegel theta series of even positive definite unimodular quadratic forms.

cs.DM2014

Spiders can be recognized by counting their legs

Sarah Berkemer, Ricardo Chaves, Adrian Fritz +3

Spiders are arthropods that can be distinguished from their closest relatives, the insects, by counting their legs. Spiders have 8, insects just 6. Spider graphs are a very restric…