_id,doi,title 10007,10.15479/at:ista:10007,Curvature driven interface evolution: Uniqueness properties of weak solution concepts 10011,10.48550/arXiv.2109.04233,A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness 10013,10.48550/arXiv.2108.01733,Weak-strong uniqueness for the mean curvature flow of double bubbles 10015,10.3390/cells10071665,The Arabidopsis root tip (phospho)proteomes at growth-promoting versus growth-repressing conditions reveal novel root growth regulators 10023,10.4310/CIS.2021.v21.n4.a1,Trajectorial dissipation and gradient flow for the relative entropy in Markov chains 10024,10.1016/j.spa.2021.08.006,Hydrodynamics for the partial exclusion process in random environment 10025,10.1038/s41586-021-03938-w,Half and quarter metals in rhombohedral trilayer graphene 10029,,Breakdown of induced p±ip pairing in a superconductor-semiconductor hybrid 10030,10.15479/at:ista:10030,Discrete-to-continuum limits of transport problems and gradient flows in the space of measures 10033,10.1016/j.aim.2021.107992,The Atiyah-Bott formula and connectivity in chiral Koszul duality 10035,10.15479/at:ista:10035,On the adaptive security of graph-based games 10041,10.1007/978-3-030-84245-1_17,"Limits on the Adaptive Security of Yao’s Garbling" 10044,,"On treewidth, separators and Yao's garbling" 10045,10.48550/arXiv.2109.10203,Generalized minimum 0-extension problem and discrete convexity 10048,,The cost of adaptivity in security games on graphs 10049,10.1109/sp40001.2021.00035,"Keep the dirt: tainted TreeKEM, adaptively and actively secure continuous group key agreement" 10051,10.1523/JNEUROSCI.0586-21.2021,RIM-binding protein 2 organizes Ca21 channel topography and regulates release probability and vesicle replenishment at a fast central synapse 10052,10.4230/LIPIcs.CONCUR.2021.18,Decomposing permutation automata 10053,10.1109/ISIT45174.2021.9518153,Parallelism versus latency in simplified successive-cancellation decoding of polar codes 10054,10.4230/LIPIcs.ICALP.2021.124,Faster algorithms for bounded liveness in graphs and game graphs