@article{11768,
  abstract     = {In the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+ϵ)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+ϵ)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary.

In contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ϵ)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ϵ)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+ϵ)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ϵ)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and Mądry [27]. These two new tools might be of independent interest.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  issn         = {1557-735X},
  journal      = {Journal of the ACM},
  number       = {6},
  pages        = {1--40},
  publisher    = {Association for Computing Machinery},
  title        = {{Decremental single-source shortest paths on undirected graphs in near-linear total update time}},
  doi          = {10.1145/3218657},
  volume       = {65},
  year         = {2018},
}

@inproceedings{11827,
  abstract     = {We study the metric facility location problem with client insertions and deletions. This setting differs from the classic dynamic facility location problem, where the set of clients remains the same, but the metric space can change over time. We show a deterministic algorithm that maintains a constant factor approximation to the optimal solution in worst-case time O~(2^{O(kappa^2)}) per client insertion or deletion in metric spaces while answering queries about the cost in O(1) time, where kappa denotes the doubling dimension of the metric. For metric spaces with bounded doubling dimension, the update time is polylogarithmic in the parameters of the problem.},
  author       = {Goranci, Gramoz  and Henzinger, Monika H and Leniowski, Dariusz},
  booktitle    = {26th Annual European Symposium on Algorithms},
  isbn         = {9783959770811},
  issn         = {1868-8969},
  location     = {Helsinki, Finland},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{A tree structure for dynamic facility location}},
  doi          = {10.4230/LIPICS.ESA.2018.39},
  volume       = {112},
  year         = {2018},
}

@inproceedings{11828,
  abstract     = {We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an n^{c}-separator theorem for some c<1. We give a fully dynamic algorithm that maintains (1+epsilon)-approximations of the all-pairs effective resistances of an n-vertex graph G undergoing edge insertions and deletions with O~(sqrt{n}/epsilon^2) worst-case update time and O~(sqrt{n}/epsilon^2) worst-case query time, if G is guaranteed to be sqrt{n}-separable (i.e., it is taken from a class satisfying a sqrt{n}-separator theorem) and its separator can be computed in O~(n) time. Our algorithm is built upon a dynamic algorithm for maintaining approximate Schur complement that approximately preserves pairwise effective resistances among a set of terminals for separable graphs, which might be of independent interest.
We complement our result by proving that for any two fixed vertices s and t, no incremental or decremental algorithm can maintain the s-t effective resistance for sqrt{n}-separable graphs with worst-case update time O(n^{1/2-delta}) and query time O(n^{1-delta}) for any delta>0, unless the Online Matrix Vector Multiplication (OMv) conjecture is false.
We further show that for general graphs, no incremental or decremental algorithm can maintain the s-t effective resistance problem with worst-case update time O(n^{1-delta}) and query-time O(n^{2-delta}) for any delta >0, unless the OMv conjecture is false.},
  author       = {Goranci, Gramoz and Henzinger, Monika H and Peng, Pan},
  booktitle    = {26th Annual European Symposium on Algorithms},
  isbn         = {9783959770811},
  issn         = {1868-8969},
  location     = {Helsinki, Finland},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Dynamic effective resistances and approximate schur complement on separable graphs}},
  doi          = {10.4230/LIPICS.ESA.2018.40},
  volume       = {112},
  year         = {2018},
}

@inproceedings{11872,
  abstract     = {We design fast dynamic algorithms for proper vertex and edge colorings in a graph undergoing edge insertions and deletions. In the static setting, there are simple linear time algorithms for (Δ + 1)- vertex coloring and (2Δ – 1)-edge coloring in a graph with maximum degree Δ. It is natural to ask if we can efficiently maintain such colorings in the dynamic setting as well. We get the following three results. (1) We present a randomized algorithm which maintains a (Δ + 1)-vertex coloring with O(log Δ) expected amortized update time. (2) We present a deterministic algorithm which maintains a (1 + o(1)Δ-vertex coloring with O(polylog Δ) amortized update time. (3) We present a simple, deterministic algorithm which maintains a (2Δ – 1)-edge coloring with O(log Δ) worst-case update time. This improves the recent O(Δ)-edge coloring algorithm with  worst-case update time [4].},
  author       = {Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika H and Nanongkai, Danupon},
  booktitle    = {29th Annual ACM-SIAM Symposium on Discrete Algorithms},
  location     = {New Orleans, LA, United States},
  pages        = {1 -- 20},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Dynamic algorithms for graph coloring}},
  doi          = {10.1137/1.9781611975031.1},
  year         = {2018},
}

@inproceedings{11882,
  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 weight sum of the cut edges. Here, we introduce a linear-time algorithm to compute near-minimum cuts. Our algorithm is based on cluster contraction using label propagation and Padberg and Rinaldi's contraction heuristics [SIAM Review, 1991]. We give both sequential and shared-memory parallel implementations of our algorithm. Extensive experiments on both real-world and generated instances show that our algorithm finds the optimal cut on nearly all instances significantly faster than other state-of-the-art exact algorithms, and our error rate is lower than that of other heuristic algorithms. In addition, our parallel algorithm shows good scalability.},
  author       = {Henzinger, Monika H and Noe, Alexander and Schulz, Christian and Strash, Darren},
  booktitle    = {20th Workshop on Algorithm Engineering and Experiments},
  location     = {New Orleans, LA, United States},
  pages        = {48--61},
  publisher    = {Society for Industrial and Applied Mathematics},
  title        = {{Practical minimum cut algorithms}},
  doi          = {10.1137/1.9781611975055.5},
  year         = {2018},
}

@article{11890,
  abstract     = {We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph 𝐺=(𝑉,𝐸), with |𝑉|=𝑛 and |𝐸|=𝑚, in 𝑜(𝑚‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+𝜖) approximation in 𝑂(log𝑛/𝜖2) amortized time per update. For maximum matching, we show how to maintain a (3+𝜖) approximation in 𝑂(min(𝑛√/𝜖,𝑚1/3/𝜖2) amortized time per update and a (4+𝜖) approximation in 𝑂(𝑚1/3/𝜖2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464].},
  author       = {Bhattacharya, Sayan and Henzinger, Monika H and Italiano, Giuseppe F.},
  issn         = {1095-7111},
  journal      = {SIAM Journal on Computing},
  number       = {3},
  pages        = {859--887},
  publisher    = {Society for Industrial & Applied Mathematics},
  title        = {{Deterministic fully dynamic data structures for vertex cover and matching}},
  doi          = {10.1137/140998925},
  volume       = {47},
  year         = {2018},
}

@inproceedings{11911,
  abstract     = {It is common knowledge that there is no single best strategy for graph clustering, which justifies a plethora of existing approaches. In this paper, we present a general memetic algorithm, VieClus, to tackle the graph clustering problem. This algorithm can be adapted to optimize different objective functions. A key component of our contribution are natural recombine operators that employ ensemble clusterings as well as multi-level techniques. Lastly, we combine these techniques with a scalable communication protocol, producing a system that is able to compute high-quality solutions in a short amount of time. We instantiate our scheme with local search for modularity and show that our algorithm successfully improves or reproduces all entries of the 10th DIMACS implementation challenge under consideration using a small amount of time.},
  author       = {Biedermann, Sonja and Henzinger, Monika H and Schulz, Christian and Schuster, Bernhard},
  booktitle    = {17th International Symposium on Experimental Algorithms},
  isbn         = {9783959770705},
  issn         = {1868-8969},
  location     = {L'Aquila, Italy},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
  title        = {{Memetic graph clustering}},
  doi          = {10.4230/LIPICS.SEA.2018.3},
  volume       = {103},
  year         = {2018},
}

@article{12,
  abstract     = {Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects.},
  author       = {Nakashima, Kazutaka and Auzinger, Thomas and Iarussi, Emmanuel and Zhang, Ran and Igarashi, Takeo and Bickel, Bernd},
  journal      = {ACM Transaction on Graphics},
  number       = {4},
  publisher    = {ACM},
  title        = {{CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds}},
  doi          = {10.1145/3197517.3201341},
  volume       = {37},
  year         = {2018},
}

@article{12193,
  abstract     = {DNA methylation regulates eukaryotic gene expression and is extensively reprogrammed during animal development. However, whether developmental methylation reprogramming during the sporophytic life cycle of flowering plants regulates genes is presently unknown. Here we report a distinctive gene-targeted RNA-directed DNA methylation (RdDM) activity in the Arabidopsis thaliana male sexual lineage that regulates gene expression in meiocytes. Loss of sexual-lineage-specific RdDM causes mis-splicing of the MPS1 gene (also known as PRD2), thereby disrupting meiosis. Our results establish a regulatory paradigm in which de novo methylation creates a cell-lineage-specific epigenetic signature that controls gene expression and contributes to cellular function in flowering plants.},
  author       = {Walker, James and Gao, Hongbo and Zhang, Jingyi and Aldridge, Billy and Vickers, Martin and Higgins, James D. and Feng, Xiaoqi},
  issn         = {1546-1718},
  journal      = {Nature Genetics},
  keywords     = {Genetics},
  number       = {1},
  pages        = {130--137},
  publisher    = {Nature Research},
  title        = {{Sexual-lineage-specific DNA methylation regulates meiosis in Arabidopsis}},
  doi          = {10.1038/s41588-017-0008-5},
  volume       = {50},
  year         = {2017},
}

@article{1228,
  abstract     = {Since 2006, reprogrammed cells have increasingly been used as a biomedical research technique in addition to neuro-psychiatric methods. These rapidly evolving techniques allow for the generation of neuronal sub-populations, and have sparked interest not only in monogenetic neuro-psychiatric diseases, but also in poly-genetic and poly-aetiological disorders such as schizophrenia (SCZ) and bipolar disorder (BPD). This review provides a summary of 19 publications on reprogrammed adult somatic cells derived from patients with SCZ, and five publications using this technique in patients with BPD. As both disorders are complex and heterogeneous, there is a plurality of hypotheses to be tested in vitro. In SCZ, data on alterations of dopaminergic transmission in vitro are sparse, despite the great explanatory power of the so-called DA hypothesis of SCZ. Some findings correspond to perturbations of cell energy metabolism, and observations in reprogrammed cells suggest neuro-developmental alterations. Some studies also report on the efficacy of medicinal compounds to revert alterations observed in cellular models. However, due to the paucity of replication studies, no comprehensive conclusions can be drawn from studies using reprogrammed cells at the present time. In the future, findings from cell culture methods need to be integrated with clinical, epidemiological, pharmacological and imaging data in order to generate a more comprehensive picture of SCZ and BPD.},
  author       = {Sauerzopf, Ulrich and Sacco, Roberto and Novarino, Gaia and Niello, Marco and Weidenauer, Ana and Praschak Rieder, Nicole and Sitte, Harald and Willeit, Matthaeus},
  journal      = {European Journal of Neuroscience},
  number       = {1},
  pages        = {45 -- 57},
  publisher    = {Wiley-Blackwell},
  title        = {{Are reprogrammed cells a useful tool for studying dopamine dysfunction in psychotic disorders? A review of the current evidence}},
  doi          = {10.1111/ejn.13418},
  volume       = {45},
  year         = {2017},
}

@article{123,
  abstract     = {The Leidenfrost effect occurs when an object near a hot surface vaporizes rapidly enough to lift itself up and hover. Although well understood for liquids and stiff sublimable solids, nothing is known about the effect with materials whose stiffness lies between these extremes. Here we introduce a new phenomenon that occurs with vaporizable soft solids - the elastic Leidenfrost effect. By dropping hydrogel spheres onto hot surfaces we find that, rather than hovering, they energetically bounce several times their diameter for minutes at a time. With high-speed video during a single impact, we uncover high-frequency microscopic gap dynamics at the sphere/substrate interface. We show how these otherwise-hidden agitations constitute work cycles that harvest mechanical energy from the vapour and sustain the bouncing. Our findings suggest a new strategy for injecting mechanical energy into a widely used class of soft materials, with potential relevance to fields such as active matter, soft robotics and microfluidics.},
  author       = {Waitukaitis, Scott R and Zuiderwijk, Antal and Souslov, Anton and Coulais, Corentin and Van Hecke, Martin},
  journal      = {Nature Physics},
  number       = {11},
  pages        = {1095 -- 1099},
  publisher    = {Nature Publishing Group},
  title        = {{Coupling the Leidenfrost effect and elastic deformations to power sustained bouncing}},
  doi          = {10.1038/nphys4194},
  volume       = {13},
  year         = {2017},
}

@inproceedings{12571,
  abstract     = {We consider the problems of maintaining approximate maximum matching and minimum vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this problem that has amortized update time of O(1) with high probability. We consider the natural open question of derandomizing this result. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph vertex cover and fractional matching problems, where every hyperedge has at most f vertices.},
  author       = {Bhattacharya, Sayan and Chakrabarty, Deeparnab and Henzinger, Monika H},
  booktitle    = {19th International Conference on Integer Programming and Combinatorial Optimization},
  isbn         = {9783319592497},
  issn         = {0302-9743},
  location     = {Waterloo, ON, Canada},
  pages        = {86--98},
  publisher    = {Springer Nature},
  title        = {{Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time}},
  doi          = {10.1007/978-3-319-59250-3_8},
  volume       = {10328},
  year         = {2017},
}

@article{12608,
  abstract     = {The spatio-temporal distribution of air temperature over mountain glaciers can demonstrate complex patterns, yet it is often represented simplistically using linear vertical temperature gradients (VTGs) extrapolated from off-glacier locations. We analyse a network of centreline and lateral air temperature observations at Tsanteleina Glacier, Italy, during summer 2015. On average, VTGs are steep (&lt;−0.0065 °C m<jats:sup>−1</jats:sup>), but they are shallow under warm ambient conditions when the correlation between air temperature and elevation becomes weaker. Published along-flowline temperature distribution methods explain centreline observations well, including warming on the lower glacier tongue, but cannot estimate lateral temperature variability. Application of temperature distribution methods improves simulation of melt rates (RMSE) in an energy-balance model by up to 36% compared to the environmental lapse rate extrapolated from an off-glacier station. However, results suggest that model parameters are not easily transferable to glaciers with a small fetch without recalibration. Such methods have potential to improve estimates of temperature across a glacier, but their parameter transferability should be further linked to the glacier and atmospheric characteristics. Furthermore, ‘cold spots’, which can be &gt;2°C cooler than expected for their elevation, whose occurrence is not predicted by the temperature distribution models, are identified at one-quarter of the measurement sites.},
  author       = {SHAW, THOMAS E. and BROCK, BEN W. and AYALA, ÁLVARO and RUTTER, NICK and Pellicciotti, Francesca},
  issn         = {1727-5652},
  journal      = {Journal of Glaciology},
  keywords     = {Earth-Surface Processes},
  number       = {242},
  pages        = {973--988},
  publisher    = {Cambridge University Press},
  title        = {{Centreline and cross-glacier air temperature variability on an Alpine glacier: Assessing temperature distribution methods and their influence on melt model calculations}},
  doi          = {10.1017/jog.2017.65},
  volume       = {63},
  year         = {2017},
}

@article{12609,
  abstract     = {Previous estimates of melt and surface sublimation on glaciers of the subtropical semiarid Andes (29–34°S) have been obtained at few specific locations, but it is not clear how ablation components vary across the entire extent of a glacier in this dry environment. Here, we simulate the distributed energy and mass balance of Juncal Norte Glacier (33°S) during a 2-month summer period. Forcing fields of near-surface air temperature and wind speed are generated using two methods accounting for the main physical processes that shape their spatial variations. Simulated meteorological variables and ablation agree well with observations on the glacier tongue and reveal complex patterns of energy and mass fluxes. Ablation decreases from 70 mm w.e. d<jats:sup>−1</jats:sup> at the low-albedo glacier terminus (~3000 m), where almost 100% of total ablation corresponds to melt, to &lt;5 mm w.e. d<jats:sup>−1</jats:sup> at wind-exposed, strong-radiated sites above 5500 m, where surface sublimation represents &gt;75% of total ablation. Our simulations provide the first glacier-scale estimates of ablation components on a glacier in the study region and better reproduce the observed and expected spatial variations of melt and surface sublimation, in comparison with more simple assumptions, such as linear gradients and uniform wind speeds.},
  author       = {AYALA, A. and Pellicciotti, Francesca and PELEG, N. and BURLANDO, P.},
  issn         = {1727-5652},
  journal      = {Journal of Glaciology},
  keywords     = {Earth-Surface Processes},
  number       = {241},
  pages        = {803--822},
  publisher    = {Cambridge University Press},
  title        = {{Melt and surface sublimation across a glacier in a dry environment: distributed energy-balance modelling of Juncal Norte Glacier, Chile}},
  doi          = {10.1017/jog.2017.46},
  volume       = {63},
  year         = {2017},
}

@article{12610,
  abstract     = {The hydrological systems of heavily-downwasted debris-covered glaciers differ from those of clean-ice glaciers due to the hummocky surface and debris mantle of such glaciers, leading to a relatively limited understanding of drainage pathways. Supraglacial ponds represent sinks within the discontinuous supraglacial drainage system, and occasionally drain englacially. To assess pond dynamics, we made pond water level measurements on Lirung Glacier, Nepal, during May and October of 2013 and 2014. Simultaneously, aerial, satellite, and terrestrial orthoimages and digital elevation models were obtained, providing snapshots of the ponds and their surroundings. We performed a DEM-based analysis of the glacier's closed surface catchments to identify surface drainage pathways and englacial drainage points, and compared this to field observations of surface and near-surface water flow. The total ponded area was higher in the pre-monsoon than post-monsoon, with individual ponds filling and draining seasonally associated with the surface exposure of englacial conduit segments. We recorded four pond drainage events, all of which occurred gradually (duration of weeks), observed diurnal fluctuations indicative of varying water supply and outflow discharge, and we documented instances of interaction between distant ponds. The DEM drainage analysis identified numerous sinks >3 m in depth across the glacier surface, few of which exhibited ponds (23%), while the field survey highlighted instances of surface water only explicable via englacial routes. Taken together, our observations provide evidence for widespread supraglacial-englacial connectivity of meltwater drainage paths. Results suggest that successive englacial conduit collapse events, themselves likely driven by supraglacial pond drainage, cause the glacier surface drainage system to evolve into a configuration following relict englacial conduit systems. Within this system, ponds form in depressions of reduced drainage efficiency and link the supraglacial and englacial drainage networks.},
  author       = {Miles, Evan S. and Steiner, Jakob and Willis, Ian and Buri, Pascal and Immerzeel, Walter W. and Chesnokova, Anna and Pellicciotti, Francesca},
  issn         = {2296-6463},
  journal      = {Frontiers in Earth Science},
  keywords     = {General Earth and Planetary Sciences},
  publisher    = {Frontiers Media},
  title        = {{Pond dynamics and supraglacial-englacial connectivity on debris-covered Lirung Glacier, Nepal}},
  doi          = {10.3389/feart.2017.00069},
  volume       = {5},
  year         = {2017},
}

@article{12612,
  abstract     = {Supraglacial ponds play a key role in absorbing atmospheric energy and directing it to the ice of debris-covered glaciers, but the spatial and temporal distribution of these features is not well documented. We analyse 172 Landsat TM/ETM+ scenes for the period 1999–2013 to identify thawed supraglacial ponds for the debris-covered tongues of five glaciers in the Langtang Valley of Nepal. We apply an advanced atmospheric correction routine (Landcor/6S) and use band ratio and image morphological techniques to identify ponds and validate our results with 2.5 m Cartosat-1 observations. We then characterize the spatial, seasonal and interannual patterns of ponds. We find high variability in pond incidence between glaciers (May–October means of 0.08–1.69% of debris area), with ponds most frequent in zones of low surface gradient and velocity. The ponds show pronounced seasonality, appearing in the pre-monsoon as snow melts, peaking at the monsoon onset at 2% of debris-covered area, then declining in the post-monsoon as ponds drain or freeze. Ponds are highly recurrent and persistent, with 40.5% of pond locations occurring for multiple years. Rather than a trend in pond cover over the study period, we find high interannual variability for each glacier after controlling for seasonality.},
  author       = {MILES, EVAN S. and WILLIS, IAN C. and ARNOLD, NEIL S. and STEINER, JAKOB and Pellicciotti, Francesca},
  issn         = {1727-5652},
  journal      = {Journal of Glaciology},
  keywords     = {Earth-Surface Processes},
  number       = {237},
  pages        = {88--105},
  publisher    = {Cambridge University Press},
  title        = {{Spatial, seasonal and interannual variability of supraglacial ponds in the Langtang Valley of Nepal, 1999–2013}},
  doi          = {10.1017/jog.2016.120},
  volume       = {63},
  year         = {2017},
}

@inproceedings{12905,
  author       = {Schlögl, Alois and Kiss, Janos},
  booktitle    = {AHPC17 – Austrian HPC Meeting 2017},
  location     = {Grundlsee, Austria},
  pages        = {28},
  publisher    = {FSP Scientific Computing},
  title        = {{Scientific Computing at IST Austria}},
  year         = {2017},
}

@article{1294,
  abstract     = {We study controller synthesis problems for finite-state Markov decision processes, where the objective is to optimize the expected mean-payoff performance and stability (also known as variability in the literature). We argue that the basic notion of expressing the stability using the statistical variance of the mean payoff is sometimes insufficient, and propose an alternative definition. We show that a strategy ensuring both the expected mean payoff and the variance below given bounds requires randomization and memory, under both the above definitions. We then show that the problem of finding such a strategy can be expressed as a set of constraints.},
  author       = {Brázdil, Tomáš and Chatterjee, Krishnendu and Forejt, Vojtěch and Kučera, Antonín},
  journal      = {Journal of Computer and System Sciences},
  pages        = {144 -- 170},
  publisher    = {Elsevier},
  title        = {{Trading performance for stability in Markov decision processes}},
  doi          = {10.1016/j.jcss.2016.09.009},
  volume       = {84},
  year         = {2017},
}

@inproceedings{13160,
  abstract     = {Transforming deterministic ω
-automata into deterministic parity automata is traditionally done using variants of appearance records. We present a more efficient variant of this approach, tailored to Rabin automata, and several optimizations applicable to all appearance records. We compare the methods experimentally and find out that our method produces smaller automata than previous approaches. Moreover, the experiments demonstrate the potential of our method for LTL synthesis, using LTL-to-Rabin translators. It leads to significantly smaller parity automata when compared to state-of-the-art approaches on complex formulae.},
  author       = {Kretinsky, Jan and Meggendorfer, Tobias and Waldmann, Clara and Weininger, Maximilian},
  booktitle    = {Tools and Algorithms for the Construction and Analysis of Systems},
  isbn         = {9783662545768},
  issn         = {1611-3349},
  location     = {Uppsala, Sweden},
  pages        = {443--460},
  publisher    = {Springer},
  title        = {{Index appearance record for transforming Rabin automata into parity automata}},
  doi          = {10.1007/978-3-662-54577-5_26},
  volume       = {10205},
  year         = {2017},
}

@phdthesis{820,
  abstract     = {The lac operon is a classic model system for bacterial gene regulation, and has been studied extensively in E. coli, a classic model organism. However, not much is known about E. coli’s ecology and life outside the laboratory, in particular in soil and water environments. The natural diversity of the lac operon outside the laboratory, its role in the ecology of E. coli and the selection pressures it is exposed to, are similarly unknown.
In Chapter Two of this thesis, I explore the genetic diversity, phylogenetic history and signatures of selection of the lac operon across 20 natural isolates of E. coli and divergent clades of Escherichia. I found that complete lac operons were present in all isolates examined, which in all but one case were functional. The lac operon phylogeny conformed to the whole-genome phylogeny of the divergent Escherichia clades, which excludes horizontal gene transfer as an explanation for the presence of functional lac operons in these clades. All lac operon genes showed a signature of purifying selection; this signature was strongest for the lacY gene. Lac operon genes of human and environmental isolates showed similar signatures of selection, except the lacZ gene, which showed a stronger signature of selection in environmental isolates.
In Chapter Three, I try to identify the natural genetic variation relevant for phenotype and fitness in the lac operon, comparing growth rate on lactose and LacZ activity of the lac operons of these wild isolates in a common genetic background. Sequence variation in the lac promoter region, upstream of the -10 and -35 RNA polymerase binding motif, predicted variation in LacZ activity at full induction, using a thermodynamic model of polymerase binding (Tugrul, 2016). However, neither variation in LacZ activity, nor RNA polymerase binding predicted by the model correlated with variation in growth rate. Lac operons of human and environmental isolates did not differ systematically in either growth rate on lactose or LacZ protein activity, suggesting that these lac operons have been exposed to similar selection pressures. We thus have no evidence that the phenotypic variation we measured is relevant for fitness.
To start assessing the effect of genomic background on the growth phenotype conferred by the lac operon, I compared growth on minimal medium with lactose between lac operon constructs and the corresponding original isolates, I found that maximal growth rate was determined by genomic background, with almost all backgrounds conferring higher growth rates than lab strain K12 MG1655. However, I found no evidence that the lactose concentration at which growth was half maximal depended on genomic background.},
  author       = {Jesse, Fabienne},
  issn         = {2663-337X},
  pages        = {87},
  publisher    = {Institute of Science and Technology Austria},
  title        = {{The lac operon in the wild}},
  doi          = {10.15479/AT:ISTA:th_857},
  year         = {2017},
}