@inproceedings{11850,
  abstract     = {Modern networked systems are increasingly reconfigurable, enabling demand-aware infrastructures whose resources can be adjusted according to the workload they currently serve. Such dynamic adjustments can be exploited to improve network utilization and hence performance, by moving frequently interacting communication partners closer, e.g., collocating them in the same server or datacenter. However, dynamically changing the embedding of workloads is algorithmically challenging: communication patterns are often not known ahead of time, but must be learned. During the learning process, overheads related to unnecessary moves (i.e., re-embeddings) should be minimized. This paper studies a fundamental model which captures the tradeoff between the benefits and costs of dynamically collocating communication partners on l servers, in an online manner. Our main contribution is a distributed online algorithm which is asymptotically almost optimal, i.e., almost matches the lower bound (also derived in this paper) on the competitive ratio of any (distributed or centralized) online algorithm.},
  author       = {Henzinger, Monika H and Neumann, Stefan and Schmid, Stefan},
  booktitle    = {SIGMETRICS'19: International Conference on Measurement and Modeling of Computer Systems},
  isbn         = {978-1-4503-6678-6},
  location     = {Phoenix, AZ, United States},
  pages        = {43–44},
  publisher    = {Association for Computing Machinery},
  title        = {{Efficient distributed workload (re-)embedding}},
  doi          = {10.1145/3309697.3331503},
  year         = {2019},
}

@inproceedings{11851,
  abstract     = {The minimum cut problem for an undirected edge-weighted graph asks us to divide its set of nodes into two blocks while minimizing the weighted sum of the cut edges. In this paper, we engineer the fastest known exact algorithm for the problem. State-of-the-art algorithms like the algorithm of Padberg and Rinaldi or the algorithm of Nagamochi, Ono and Ibaraki identify edges that can be contracted to reduce the graph size such that at least one minimum cut is maintained in the contracted graph. Our algorithm achieves improvements in running time over these algorithms by a multitude of techniques. First, we use a recently developed fast and parallel inexact minimum cut algorithm to obtain a better bound for the problem. Afterwards, we use reductions that depend on this bound to reduce the size of the graph much faster than previously possible. We use improved data structures to further lower the running time of our algorithm. Additionally, we parallelize the contraction routines of Nagamochi et al. . Overall, we arrive at a system that significantly outperforms the fastest state-of-the-art solvers for the exact minimum cut problem.},
  author       = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian},
  booktitle    = {33rd International Parallel and Distributed Processing Symposium},
  isbn         = {978-1-7281-1247-3},
  issn         = {1530-2075},
  location     = {Rio de Janeiro, Brazil},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Shared-memory exact minimum cuts}},
  doi          = {10.1109/ipdps.2019.00013},
  year         = {2019},
}

@inproceedings{11853,
  abstract     = {We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed.},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Nanongkai, Danupon},
  booktitle    = {60th Annual Symposium on Foundations of Computer Science},
  isbn         = {978-1-7281-4953-0},
  issn         = {2575-8454},
  location     = {Baltimore, MD, United States},
  pages        = {406--423},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{A new deterministic algorithm for dynamic set cover}},
  doi          = {10.1109/focs.2019.00033},
  year         = {2019},
}

@inproceedings{11865,
  abstract     = {We present the first sublinear-time algorithm that can compute the edge connectivity λ of a network exactly on distributed message-passing networks (the CONGEST model), as long as the network contains no multi-edge. We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity λ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes Õ(n1−1/353D1/353+n1−1/706) time to compute λ and a cut of cardinality λ with high probability, where n and D are the number of nodes and the diameter of the network, respectively, and Õ hides polylogarithmic factors. This running time is sublinear in n (i.e. Õ(n1−є)) whenever D is. Previous sublinear-time distributed algorithms can solve this problem either (i) exactly only when λ=O(n1/8−є) [Thurimella PODC’95; Pritchard, Thurimella, ACM Trans. Algorithms’11; Nanongkai, Su, DISC’14] or (ii) approximately [Ghaffari, Kuhn, DISC’13; Nanongkai, Su, DISC’14]. To achieve this we develop and combine several new techniques. First, we design the first distributed algorithm that can compute a k-edge connectivity certificate for any k=O(n1−є) in time Õ(√nk+D). The previous sublinear-time algorithm can do so only when k=o(√n) [Thurimella PODC’95]. In fact, our algorithm can be turned into the first parallel algorithm with polylogarithmic depth and near-linear work. Previous near-linear work algorithms are essentially sequential and previous polylogarithmic-depth algorithms require Ω(mk) work in the worst case (e.g. [Karger, Motwani, STOC’93]). Second, we show that by combining the recent distributed expander decomposition technique of [Chang, Pettie, Zhang, SODA’19] with techniques from the sequential deterministic edge connectivity algorithm of [Kawarabayashi, Thorup, STOC’15], we can decompose the network into a sublinear number of clusters with small average diameter and without any mincut separating a cluster (except the “trivial” ones). This leads to a simplification of the Kawarabayashi-Thorup framework (except that we are randomized while they are deterministic). This might make this framework more useful in other models of computation. Finally, by extending the tree packing technique from [Karger STOC’96], we can find the minimum cut in time proportional to the number of components. As a byproduct of this technique, we obtain an Õ(n)-time algorithm for computing exact minimum cut for weighted graphs.},
  author       = {Daga, Mohit and Henzinger, Monika H and Nanongkai, Danupon and Saranurak, Thatchaphol},
  booktitle    = {Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing},
  isbn         = {978-1-4503-6705-9},
  issn         = {0737-8017},
  location     = {Phoenix, AZ, United States},
  pages        = {343–354},
  publisher    = {Association for Computing Machinery},
  title        = {{Distributed edge connectivity in sublinear time}},
  doi          = {10.1145/3313276.3316346},
  year         = {2019},
}

@inproceedings{11871,
  abstract     = {Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas), and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.

In this paper we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.

1.	
For dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner, and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3(n) high-probability worst-case time bound for maintaining a (2k – 1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k – 1 and Õ(n1+1/k) edges.)

2.	
For dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2 + ∊)-approximate, and hence not maximal.

Our results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: an algorithm is said to have worst-case expected update time α if for every update σ, the expected time to process σ is at most α. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: a worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires Θ(f(n)) time to process, for arbitrarily high f(n). In this paper we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: the query time remains the same, while the update time increases by a factor of O(log2(n)).

Thus we achieve our results in two steps: (1) First we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times. (2) Then we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms.},
  author       = {Bernstein, Aaron and Forster, Sebastian and Henzinger, Monika H},
  booktitle    = {30th Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {San Diego, CA, United States},
  pages        = {1899--1918},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{A deamortization approach for dynamic spanner and dynamic maximal matching}},
  doi          = {10.1137/1.9781611975482.115},
  year         = {2019},
}

@article{11898,
  abstract     = {We build upon the recent papers by Weinstein and Yu (FOCS'16), Larsen (FOCS'12), and Clifford et al. (FOCS'15) to present a general framework that gives amortized lower bounds on the update and query times of dynamic data structures. Using our framework, we present two concrete results.
(1) For the dynamic polynomial evaluation problem, where the polynomial is defined over a finite field of size n1+Ω(1) and has degree n, any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω((lgn/lglgn)2).
(2) For the dynamic online matrix vector multiplication problem, where we get an n×n matrix whose entires are drawn from a finite field of size nΘ(1), any dynamic data structure must either have an amortized update time of Ω((lgn/lglgn)2) or an amortized query time of Ω(n⋅(lgn/lglgn)2).
For these two problems, the previous works by Larsen (FOCS'12) and Clifford et al. (FOCS'15) gave the same lower bounds, but only for worst case update and query times. Our bounds match the highest unconditional lower bounds known till date for any dynamic problem in the cell-probe model.},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Neumann, Stefan},
  issn         = {0304-3975},
  journal      = {Theoretical Computer Science},
  pages        = {72--87},
  publisher    = {Elsevier},
  title        = {{New amortized cell-probe lower bounds for dynamic problems}},
  doi          = {10.1016/j.tcs.2019.01.043},
  volume       = {779},
  year         = {2019},
}

@article{11957,
  abstract     = {Cross-coupling reactions mediated by dual nickel/photocatalysis are synthetically attractive but rely mainly on expensive, non-recyclable noble-metal complexes as photocatalysts. Heterogeneous semiconductors, which are commonly used for artificial photosynthesis and wastewater treatment, are a sustainable alternative. Graphitic carbon nitrides, a class of metal-free polymers that can be easily prepared from bulk chemicals, are heterogeneous semiconductors with high potential for photocatalytic organic transformations. Here, we demonstrate that graphitic carbon nitrides in combination with nickel catalysis can induce selective C−O cross-couplings of carboxylic acids with aryl halides, yielding the respective aryl esters in excellent yield and selectivity. The heterogeneous organic photocatalyst exhibits a broad substrate scope, is able to harvest green light, and can be recycled multiple times. In situ FTIR was used to track the reaction progress to study this transformation at different irradiation wavelengths and reaction scales.},
  author       = {Pieber, Bartholomäus and Malik, Jamal A. and Cavedon, Cristian and Gisbertz, Sebastian and Savateev, Aleksandr and Cruz, Daniel and Heil, Tobias and Zhang, Guigang and Seeberger, Peter H.},
  issn         = {1521-3773},
  journal      = {Angewandte Chemie International Edition},
  number       = {28},
  pages        = {9575--9580},
  publisher    = {Wiley},
  title        = {{Semi‐heterogeneous dual nickel/photocatalysis using carbon nitrides: Esterification of carboxylic acids with aryl halides}},
  doi          = {10.1002/anie.201902785},
  volume       = {58},
  year         = {2019},
}

@article{11982,
  abstract     = {A carbon nitride material can be combined with homogeneous nickel catalysts for light-mediated cross-couplings of aryl bromides with alcohols under mild conditions. The metal-free heterogeneous semiconductor is fully recyclable and couples a broad range of electron-poor aryl bromides with primary and secondary alcohols as well as water. The application for intramolecular reactions and the synthesis of active pharmaceutical ingredients was demonstrated. The catalytic protocol is applicable for the coupling of aryl iodides with thiols as well.},
  author       = {Cavedon, Cristian and Madani, Amiera and Seeberger, Peter H. and Pieber, Bartholomäus},
  issn         = {1523-7052},
  journal      = {Organic Letters},
  number       = {13},
  pages        = {5331--5334},
  publisher    = {American Chemical Society},
  title        = {{Semiheterogeneous dual nickel/photocatalytic (thio)etherification using carbon nitrides}},
  doi          = {10.1021/acs.orglett.9b01957},
  volume       = {21},
  year         = {2019},
}

@article{11984,
  abstract     = {Differentially protected galactosamine building blocks are key components for the synthesis of human and bacterial oligosaccharides. The azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal provides straightforward access to the corresponding 2-nitrogenated glycoside. Poor reproducibility and the use of azides that lead to the formation of potentially explosive and toxic species limit the scalability of this reaction and render it a bottleneck for carbohydrate synthesis. Here, we present a method for the safe, efficient, and reliable azidophenylselenylation of 3,4,6-tri-O-acetyl-d-galactal at room temperature, using continuous flow chemistry. Careful analysis of the transformation resulted in reaction conditions that produce minimal side products while the reaction time was reduced drastically when compared to batch reactions. The flow setup is readily scalable to process 5 mmol of galactal in 3 h, producing 1.2 mmol/h of product.},
  author       = {Guberman, Mónica and Pieber, Bartholomäus and Seeberger, Peter H.},
  issn         = {1520-586X},
  journal      = {Organic Process Research and Development},
  number       = {12},
  pages        = {2764--2770},
  publisher    = {American Chemical Society},
  title        = {{Safe and scalable continuous flow azidophenylselenylation of galactal to prepare galactosamine building blocks}},
  doi          = {10.1021/acs.oprd.9b00456},
  volume       = {23},
  year         = {2019},
}

@article{12190,
  abstract     = {Meiotic crossover frequency varies within genomes, which influences genetic diversity and adaptation. In turn, genetic variation within populations can act to modify crossover frequency in cis and trans. To identify genetic variation that controls meiotic crossover frequency, we screened Arabidopsis accessions using fluorescent recombination reporters. We mapped a genetic modifier of crossover frequency in Col × Bur populations of Arabidopsis to a premature stop codon within TBP-ASSOCIATED FACTOR 4b (TAF4b), which encodes a subunit of the RNA polymerase II general transcription factor TFIID. The Arabidopsis taf4b mutation is a rare variant found in the British Isles, originating in South-West Ireland. Using genetics, genomics, and immunocytology, we demonstrate a genome-wide decrease in taf4b crossovers, with strongest reduction in the sub-telomeric regions. Using RNA sequencing (RNA-seq) from purified meiocytes, we show that TAF4b expression is meiocyte enriched, whereas its paralog TAF4 is broadly expressed. Consistent with the role of TFIID in promoting gene expression, RNA-seq of wild-type and taf4b meiocytes identified widespread transcriptional changes, including in genes that regulate the meiotic cell cycle and recombination. Therefore, TAF4b duplication is associated with acquisition of meiocyte-specific expression and promotion of germline transcription, which act directly or indirectly to elevate crossovers. This identifies a novel mode of meiotic recombination control via a general transcription factor.},
  author       = {Lawrence, Emma J. and Gao, Hongbo and Tock, Andrew J. and Lambing, Christophe and Blackwell, Alexander R. and Feng, Xiaoqi and Henderson, Ian R.},
  issn         = {0960-9822},
  journal      = {Current Biology},
  keywords     = {General Agricultural and Biological Sciences, General Biochemistry, Genetics and Molecular Biology},
  number       = {16},
  pages        = {2676--2686.e3},
  publisher    = {Elsevier BV},
  title        = {{Natural variation in TBP-ASSOCIATED FACTOR 4b controls meiotic crossover and germline transcription in Arabidopsis}},
  doi          = {10.1016/j.cub.2019.06.084},
  volume       = {29},
  year         = {2019},
}

@article{12192,
  abstract     = {Transposable elements (TEs), the movement of which can damage the genome, are epigenetically silenced in eukaryotes. Intriguingly, TEs are activated in the sperm companion cell – vegetative cell (VC) – of the flowering plant Arabidopsis thaliana. However, the extent and mechanism of this activation are unknown. Here we show that about 100 heterochromatic TEs are activated in VCs, mostly by DEMETER-catalyzed DNA demethylation. We further demonstrate that DEMETER access to some of these TEs is permitted by the natural depletion of linker histone H1 in VCs. Ectopically expressed H1 suppresses TEs in VCs by reducing DNA demethylation and via a methylation-independent mechanism. We demonstrate that H1 is required for heterochromatin condensation in plant cells and show that H1 overexpression creates heterochromatic foci in the VC progenitor cell. Taken together, our results demonstrate that the natural depletion of H1 during male gametogenesis facilitates DEMETER-directed DNA demethylation, heterochromatin relaxation, and TE activation.},
  author       = {He, Shengbo and Vickers, Martin and Zhang, Jingyi and Feng, Xiaoqi},
  issn         = {2050-084X},
  journal      = {eLife},
  keywords     = {General Immunology and Microbiology, General Biochemistry, Genetics and Molecular Biology, General Medicine, General Neuroscience},
  publisher    = {eLife Sciences Publications, Ltd},
  title        = {{Natural depletion of histone H1 in sex cells causes DNA demethylation, heterochromatin decondensation and transposon activation}},
  doi          = {10.7554/elife.42530},
  volume       = {8},
  year         = {2019},
}

@article{12600,
  abstract     = {The snow cover dynamics of High Mountain Asia are usually assessed at spatial resolutions of 250 m or greater, but this scale is too coarse to clearly represent the rugged topography common to the region. Higher-resolution measurement of snow-covered area often results in biased sampling due to cloud cover and deep shadows. We therefore develop a Normalized Difference Snow Index-based workflow to delineate snow lines from Landsat Thematic Mapper/Enhanced Thematic Mapper+ imagery and apply it to the upper Langtang Valley in Nepal, processing 194 scenes spanning 1999 to 2013. For each scene, we determine the spatial distribution of snow line altitudes (SLAs) with respect to aspect and across six subcatchments. Our results show that the mean SLA exhibits distinct seasonal behavior based on aspect and subcatchment position. We find that SLA dynamics respond to spatial and seasonal trade-offs in precipitation, temperature, and solar radiation, which act as primary controls. We identify two SLA spatial gradients, which we attribute to the effect of spatially variable precipitation. Our results also reveal that aspect-related SLA differences vary seasonally and are influenced by solar radiation. In terms of seasonal dominant controls, we demonstrate that the snow line is controlled by snow precipitation in winter, melt in premonsoon, a combination of both in postmonsoon, and temperature in monsoon, explaining to a large extent the spatial and seasonal variability of the SLA in the upper Langtang Valley. We conclude that while SLA and snow-covered area are complementary metrics, the SLA has a strong potential for understanding local-scale snow cover dynamics and their controlling mechanisms.},
  author       = {Girona‐Mata, Marc and Miles, Evan S. and Ragettli, Silvan and Pellicciotti, Francesca},
  issn         = {1944-7973},
  journal      = {Water Resources Research},
  keywords     = {Water Science and Technology},
  number       = {8},
  pages        = {6754--6772},
  publisher    = {American Geophysical Union},
  title        = {{High‐resolution snowline delineation from Landsat imagery to infer snow cover controls in a Himalayan catchment}},
  doi          = {10.1029/2019wr024935},
  volume       = {55},
  year         = {2019},
}

@article{12601,
  abstract     = {Ice cliffs and ponds on debris-covered glaciers have received increased attention due to their role in amplifying local melt. However, very few studies have looked at these features on the catchment scale to determine their patterns and changes in space and time. We have compiled a detailed inventory of cliffs and ponds in the Langtang catchment, central Himalaya, from six high-resolution satellite orthoimages and DEMs between 2006 and 2015, and a historic orthophoto from 1974. Cliffs cover between 1.4% (± 0.4%) in the dry and 3.4% (± 0.9%) in the wet seasons and ponds between 0.6% (± 0.1%) and 1.6% (± 0.3%) of the total debris-covered tongues. We find large variations between seasons, as cliffs and ponds tend to grow in the wetter monsoon period, but there is no obvious trend in total area over the study period. The inventory further shows that cliffs are predominately north-facing irrespective of the glacier flow direction. Both cliffs and ponds appear in higher densities several hundred metres from the terminus in areas where tributaries reach the main glacier tongue. On the largest glacier in the catchment ~10% of all cliffs and ponds persisted over nearly a decade.},
  author       = {STEINER, JAKOB F. and BURI, PASCAL and MILES, EVAN S. and RAGETTLI, SILVAN and Pellicciotti, Francesca},
  issn         = {1727-5652},
  journal      = {Journal of Glaciology},
  number       = {252},
  pages        = {617--632},
  publisher    = {Cambridge University Press},
  title        = {{Supraglacial ice cliffs and ponds on debris-covered glaciers: Spatio-temporal distribution and characteristics}},
  doi          = {10.1017/jog.2019.40},
  volume       = {65},
  year         = {2019},
}

@article{12602,
  abstract     = {This study aims at developing and applying a spatially-distributed coupled glacier mass balance and ice-flow model to attribute the response of glaciers to natural and anthropogenic climate change. We focus on two glaciers with contrasting surface characteristics: a debris-covered glacier (Langtang Glacier in Nepal) and a clean-ice glacier (Hintereisferner in Austria). The model is applied from the end of the Little Ice Age (1850) to the present-day (2016) and is forced with four bias-corrected General Circulation Models (GCMs) from the historical experiment of the CMIP5 archive. The selected GCMs represent region-specific warm-dry, warm-wet, cold-dry, and cold-wet climate conditions. To isolate the effects of anthropogenic climate change on glacier mass balance and flow runs from these GCMs with and without further anthropogenic forcing after 1970 until 2016 are selected. The outcomes indicate that both glaciers experience the largest reduction in area and volume under warm climate conditions, whereas area and volume reductions are smaller under cold climate conditions. Simultaneously with changes in glacier area and volume, surface velocities generally decrease over time. Without further anthropogenic forcing the results reveal a 3% (9%) smaller decline in glacier area (volume) for the debris-covered glacier and a 18% (39%) smaller decline in glacier area (volume) for the clean-ice glacier. The difference in the magnitude between the two glaciers can mainly be attributed to differences in the response time of the glaciers, where the clean-ice glacier shows a much faster response to climate change. We conclude that the response of the two glaciers can mainly be attributed to anthropogenic climate change and that the impact is larger on the clean-ice glacier. The outcomes show that the model performs well under different climate conditions and that the developed approach can be used for regional-scale glacio-hydrological modeling.},
  author       = {Wijngaard, René R. and Steiner, Jakob F. and Kraaijenbrink, Philip D. A. and Klug, Christoph and Adhikari, Surendra and Banerjee, Argha and Pellicciotti, Francesca and van Beek, Ludovicus P. H. and Bierkens, Marc F. P. and Lutz, Arthur F. and Immerzeel, Walter W.},
  issn         = {2296-6463},
  journal      = {Frontiers in Earth Science},
  publisher    = {Frontiers Media},
  title        = {{Modeling the response of the Langtang Glacier and the Hintereisferner to a changing climate since the Little Ice Age}},
  doi          = {10.3389/feart.2019.00143},
  volume       = {7},
  year         = {2019},
}

@inproceedings{12901,
  author       = {Schlögl, Alois and Kiss, Janos and Elefante, Stefano},
  booktitle    = {AHPC19 - Austrian HPC Meeting 2019 },
  location     = {Grundlsee, Austria},
  pages        = {25},
  publisher    = {Institut für Mathematik und wissenschaftliches Rechnen der Universität Graz},
  title        = {{Is Debian suitable for running an HPC Cluster?}},
  year         = {2019},
}

@misc{13067,
  abstract     = {Genetic incompatibilities contribute to reproductive isolation between many diverging populations, but it is still unclear to what extent they play a role if divergence happens with gene flow. In contact zones between the "Crab" and "Wave" ecotypes of the snail Littorina saxatilis divergent selection forms strong barriers to gene flow, while the role of postzygotic barriers due to selection against hybrids remains unclear. High embryo abortion rates in this species could indicate the presence of such barriers. Postzygotic barriers might include genetic incompatibilities (e.g. Dobzhansky-Muller incompatibilities) but also maladaptation, both expected to be most pronounced in contact zones. In addition, embryo abortion might reflect physiological stress on females and embryos independent of any genetic stress. We examined all embryos of >500 females sampled outside and inside contact zones of three populations in Sweden. Females' clutch size ranged from 0 to 1011 embryos (mean 130±123) and abortion rates varied between 0 and100% (mean 12%). We described female genotypes by using a hybrid index based on hundreds of SNPs differentiated between ecotypes with which we characterised female genotypes. We also calculated female SNP heterozygosity and inversion karyotype. Clutch size did not vary with female hybrid index and abortion rates were only weakly related to hybrid index in two sites but not at all in a third site. No additional variation in abortion rate was explained by female SNP heterozygosity, but increased female inversion heterozygosity added slightly to increased abortion. Our results show only weak and probably biologically insignificant postzygotic barriers contributing to ecotype divergence and the high and variable abortion rates were marginally, if at all, explained by hybrid index of females.},
  author       = {Johannesson, Kerstin and Zagrodzka, Zuzanna and Faria, Rui and Westram, Anja M and Butlin, Roger},
  publisher    = {Dryad},
  title        = {{Data from: Is embryo abortion a postzygotic barrier to gene flow between Littorina ecotypes?}},
  doi          = {10.5061/DRYAD.TB2RBNZWK},
  year         = {2019},
}

@misc{13079,
  abstract     = {The inner nuclear membrane (INM) is a subdomain of the endoplasmic reticulum (ER) that is gated by the nuclear pore complex. It is unknown whether proteins of the INM and ER are degraded through shared or distinct pathways in mammalian cells. We applied dynamic proteomics to profile protein half-lives and report that INM and ER residents turn over at similar rates, indicating that the INM’s unique topology is not a barrier to turnover. Using a microscopy approach, we observed that the proteasome can degrade INM proteins in situ. However, we also uncovered evidence for selective, vesicular transport-mediated turnover of a single INM protein, emerin, that is potentiated by ER stress. Emerin is rapidly cleared from the INM by a mechanism that requires emerin’s LEM domain to mediate vesicular trafficking to lysosomes. This work demonstrates that the INM can be dynamically remodeled in response to environmental inputs.},
  author       = {Buchwalter, Abigail and Schulte, Roberta and Tsai, Hsiao and Capitanio, Juliana and HETZER, Martin W},
  publisher    = {Dryad},
  title        = {{Data from: Selective clearance of the inner nuclear membrane protein emerin by vesicular transport during ER stress}},
  doi          = {10.5061/DRYAD.N0R525H},
  year         = {2019},
}

@article{13366,
  abstract     = {The ability to reversibly assemble nanoparticles using light is both fundamentally interesting and important for applications ranging from reversible data storage to controlled drug delivery. Here, the diverse approaches that have so far been developed to control the self-assembly of nanoparticles using light are reviewed and compared. These approaches include functionalizing nanoparticles with monolayers of photoresponsive molecules, placing them in photoresponsive media capable of reversibly protonating the particles under light, and decorating plasmonic nanoparticles with thermoresponsive polymers, to name just a few. The applicability of these methods to larger, micrometer-sized particles is also discussed. Finally, several perspectives on further developments in the field are offered.},
  author       = {Bian, Tong and Chu, Zonglin and Klajn, Rafal},
  issn         = {1521-4095},
  journal      = {Advanced Materials},
  keywords     = {Mechanical Engineering, Mechanics of Materials, General Materials Science},
  number       = {20},
  publisher    = {Wiley},
  title        = {{The many ways to assemble nanoparticles using light}},
  doi          = {10.1002/adma.201905866},
  volume       = {32},
  year         = {2019},
}

@article{13369,
  abstract     = {Arylazopyrazoles represent a new family of molecular photoswitches characterized by a near-quantitative conversion between two states and long thermal half-lives of the metastable state. Here, we investigated the behavior of a model arylazopyrazole in the presence of a self-assembled cage based on Pd–imidazole coordination. Owing to its high water solubility, the cage can solubilize the E isomer of arylazopyrazole, which, by itself, is not soluble in water. NMR spectroscopy and X-ray crystallography have independently demonstrated that each cage can encapsulate two molecules of E-arylazopyrazole. UV-induced switching to the Z isomer was accompanied by the release of one of the two guests from the cage and the formation of a 1:1 cage/Z-arylazopyrazole inclusion complex. DFT calculations suggest that this process involves a dramatic change in the conformation of the cage. Back-isomerization was induced with green light and resulted in the initial 1:2 cage/E-arylazopyrazole complex. This back-isomerization reaction also proceeded in the dark, with a rate significantly higher than in the absence of the cage.},
  author       = {Hanopolskyi, Anton I and De, Soumen and Białek, Michał J and Diskin-Posner, Yael and Avram, Liat and Feller, Moran and Klajn, Rafal},
  issn         = {1860-5397},
  journal      = {Beilstein Journal of Organic Chemistry},
  keywords     = {Organic Chemistry},
  pages        = {2398--2407},
  publisher    = {Beilstein Institut},
  title        = {{Reversible switching of arylazopyrazole within a metal–organic cage}},
  doi          = {10.3762/bjoc.15.232},
  volume       = {15},
  year         = {2019},
}

@article{13370,
  abstract     = {Efficient isomerization of photochromic molecules often requires conformational freedom and is typically not available under solvent-free conditions. Here, we report a general methodology allowing for reversible switching of such molecules on the surfaces of solid materials. Our method is based on dispersing photochromic compounds within polysilsesquioxane nanowire networks (PNNs), which can be fabricated as transparent, highly porous, micrometer-thick layers on various substrates. We found that azobenzene switching within the PNNs proceeded unusually fast compared with the same molecules in liquid solvents. Efficient isomerization of another photochromic system, spiropyran, from a colorless to a colored form was used to create reversible images in PNN-coated glass. The coloration reaction could be induced with sunlight and is of interest for developing “smart” windows.},
  author       = {Chu, Zonglin and Klajn, Rafal},
  issn         = {1530-6992},
  journal      = {Nano Letters},
  keywords     = {Mechanical Engineering, Condensed Matter Physics, General Materials Science, General Chemistry, Bioengineering},
  number       = {10},
  pages        = {7106--7111},
  publisher    = {American Chemical Society},
  title        = {{Polysilsesquioxane nanowire networks as an “Artificial Solvent” for reversible operation of photochromic molecules}},
  doi          = {10.1021/acs.nanolett.9b02642},
  volume       = {19},
  year         = {2019},
}