@inproceedings{117,
  abstract     = {The packing arrangement of individual particles inside a granular material and the resulting response to applied stresses depend critically on particle-particle interactions. One aspect that recently received attention are nanoscale surface features of particles, which play an important role in determining the strength of cohesive van der Waals and capillary interactions and also affect tribo-charging of grains. We describe experiments on freely falling granular streams that can detect the contributions from all three of these forces. We show that it is possible to measure the charge of individual grains and build up distributions that are detailed enough to provide stringent tests of tribo-charging models currently available. A second aspect concerns particle shape. In this case steric interactions become important and new types of aggregate behavior can be expected when non-convex particle shapes are considered that can interlock or entangle. However, a general connection between the mechanical response of a granular material and the constituents\' shape remains unknown. This has made it infeasible to tackle the "inverse packing problem", namely to start from a given, desired behavior for the aggregate as a whole and then find the particle shape the produces it. We discuss a new approach, using concepts rooted in artificial evolution that provides a way to solve this inverse problem. This approach facilitates exploring the role of arbitrary particle geometry in jammed systems and invites the discovery and design of granular matter with optimized properties.},
  author       = {Jaeger, Heinrich and Miskin, Marc and Waitukaitis, Scott R},
  booktitle    = { AIP Conference Proceedings},
  location     = {Sydney, Australia},
  pages        = {3 -- 6},
  publisher    = {AIP},
  title        = {{From nanoscale cohesion to macroscale entanglement: opportunities for designing granular aggregate behaviour by tailoring grain shape and interactions}},
  doi          = {10.1063/1.4811858},
  volume       = {1542},
  year         = {2013},
}

@article{11758,
  author       = {Aceto, Luca and Henzinger, Monika H and Sgall, Jiří},
  issn         = {0890-5401},
  journal      = {Information and Computation},
  number       = {1},
  pages        = {1},
  publisher    = {Elsevier},
  title        = {{38th International Colloquium on Automata, Languages and Programming}},
  doi          = {10.1016/j.ic.2012.11.002},
  volume       = {222},
  year         = {2013},
}

@article{11759,
  abstract     = {Matching markets play a prominent role in economic theory. A prime example of such a market is the sponsored search market. Here, as in other markets of that kind, market equilibria correspond to feasible, envy free, and bidder optimal outcomes. For settings without budgets such an outcome always exists and can be computed in polynomial-time by the so-called Hungarian Method. Moreover, every mechanism that computes such an outcome is incentive compatible. We show that the Hungarian Method can be modified so that it finds a feasible, envy free, and bidder optimal outcome for settings with budgets. We also show that in settings with budgets no mechanism that computes such an outcome can be incentive compatible for all inputs. For inputs in general position, however, the presented mechanism—as any other mechanism that computes such an outcome for settings with budgets—is incentive compatible.},
  author       = {Dütting, Paul and Henzinger, Monika H and Weber, Ingmar},
  issn         = {0020-0190},
  journal      = {Information Processing Letters},
  number       = {3},
  pages        = {67--73},
  publisher    = {Elsevier},
  title        = {{Sponsored search, market equilibria, and the Hungarian Method}},
  doi          = {10.1016/j.ipl.2012.11.006},
  volume       = {113},
  year         = {2013},
}

@inproceedings{11791,
  abstract     = {The focus of classic mechanism design has been on truthful direct-revelation mechanisms. In the context of combinatorial auctions the truthful direct-revelation mechanism that maximizes social welfare is the VCG mechanism. For many valuation spaces computing the allocation and payments of the VCG mechanism, however, is a computationally hard problem. We thus study the performance of the VCG mechanism when bidders are forced to choose bids from a subspace of the valuation space for which the VCG outcome can be computed efficiently. We prove improved upper bounds on the welfare loss for restrictions to additive bids and upper and lower bounds for restrictions to non-additive bids. These bounds show that the welfare loss increases in expressiveness. All our bounds apply to equilibrium concepts that can be computed in polynomial time as well as to learning outcomes.},
  author       = {Dütting, Paul and Henzinger, Monika H and Starnberger, Martin},
  booktitle    = {9th International Conference on Web and Internet Economics},
  isbn         = {9783642450457},
  issn         = {1611-3349},
  location     = {Cambridge, MA, USA},
  pages        = {146–159},
  publisher    = {Springer Nature},
  title        = {{Valuation compressions in VCG-based combinatorial auctions}},
  doi          = {10.1007/978-3-642-45046-4_13},
  volume       = {8289},
  year         = {2013},
}

@inproceedings{11792,
  abstract     = {We study the problem of maximizing a monotone submodular function with viability constraints. This problem originates from computational biology, where we are given a phylogenetic tree over a set of species and a directed graph, the so-called food web, encoding viability constraints between these species. These food webs usually have constant depth. The goal is to select a subset of k species that satisfies the viability constraints and has maximal phylogenetic diversity. As this problem is known to be NP-hard, we investigate approximation algorithm. We present the first constant factor approximation algorithm if the depth is constant. Its approximation ratio is (1−1𝑒√). This algorithm not only applies to phylogenetic trees with viability constraints but for arbitrary monotone submodular set functions with viability constraints. Second, we show that there is no (1 − 1/e + ε)-approximation algorithm for our problem setting (even for additive functions) and that there is no approximation algorithm for a slight extension of this setting.},
  author       = {Dvořák, Wolfgang and Henzinger, Monika H and Williamson, David P.},
  booktitle    = {21st Annual European Symposium on Algorithms},
  isbn         = {9783642404498},
  issn         = {1611-3349},
  location     = {Sophia Antipolis, France},
  pages        = {409 -- 420},
  publisher    = {Springer Nature},
  title        = {{Maximizing a submodular function with viability constraints}},
  doi          = {10.1007/978-3-642-40450-4_35},
  volume       = {8125},
  year         = {2013},
}

@inproceedings{11793,
  abstract     = {We study the problem of maintaining a breadth-first spanning tree (BFS tree) in partially dynamic distributed networks modeling a sequence of either failures or additions of communication links (but not both). We show (1 + ε)-approximation algorithms whose amortized time (over some number of link changes) is sublinear in D, the maximum diameter of the network. This breaks the Θ(D) time bound of recomputing “from scratch”.

Our technique also leads to a (1 + ε)-approximate incremental algorithm for single-source shortest paths (SSSP) in the sequential (usual RAM) model. Prior to our work, the state of the art was the classic exact algorithm of [9] that is optimal under some assumptions [27]. Our result is the first to show that, in the incremental setting, this bound can be beaten in certain cases if a small approximation is allowed.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {40th International Colloquium on Automata, Languages, and Programming},
  isbn         = {9783642392115},
  issn         = {1611-3349},
  location     = {Riga, Latvia},
  pages        = {607–619},
  publisher    = {Springer Nature},
  title        = {{Sublinear-time maintenance of breadth-first spanning tree in partially dynamic networks}},
  doi          = {10.1007/978-3-642-39212-2_53},
  volume       = {7966},
  year         = {2013},
}

@inproceedings{11856,
  abstract     = {We study dynamic (1 + ϵ)-approximation algorithms for the all-pairs shortest paths problem in unweighted undirected n-node m-edge graphs under edge deletions. The fastest algorithm for this problem is a randomized algorithm with a total update time of Ȏ(mn) and constant query time by Roditty and Zwick (FOCS 2004). The fastest deterministic algorithm is from a 1981 paper by Even and Shiloach (JACM 1981); it has a total update time of O(mn 2 ) and constant query time. We improve these results as follows: (1) We present an algorithm with a total update time of Ȏ(n 5/2 ) and constant query time that has an additive error of two in addition to the 1 + ϵ multiplicative error. This beats the previous Ȏ(mn) time when m = Ω(n 3/2 ). Note that the additive error is unavoidable since, even in the static case, an O(n 3-δ )-time (a so-called truly sub cubic) combinatorial algorithm with 1 + ϵ multiplicative error cannot have an additive error less than 2 - ϵ, unless we make a major breakthrough for Boolean matrix multiplication (Dor, Halperin and Zwick FOCS 1996) and many other long-standing problems (Vassilevska Williams and Williams FOCS 2010). The algorithm can also be turned into a (2 + ϵ)-approximation algorithm (without an additive error) with the same time guarantees, improving the recent (3 + ϵ)-approximation algorithm with Ȏ(n 5/2+O(1√(log n)) ) running time of Bernstein and Roditty (SODA 2011) in terms of both approximation and time guarantees. (2) We present a deterministic algorithm with a total update time of Ȏ(mn) and a query time of O(log log n). The algorithm has a multiplicative error of 1 + ϵ and gives the first improved deterministic algorithm since 1981. It also answers an open question raised by Bernstein in his STOC 2013 paper. In order to achieve our results, we introduce two new techniques: (1) A lazy Even-Shiloach tree algorithm which maintains a bounded-distance shortest-paths tree on a certain type of emulator called locally persevering emulator. (2) A derandomization technique based on moving Even-Shiloach trees as a way to derandomize the standard random set argument. These techniques might be of independent interest.},
  author       = {Henzinger, Monika H and Krinninger, Sebastian and Nanongkai, Danupon},
  booktitle    = {54th Annual Symposium on Foundations of Computer Science},
  issn         = {0272-5428},
  location     = {Berkeley, CA, United States},
  pages        = {538--547},
  publisher    = {Institute of Electrical and Electronics Engineers},
  title        = {{Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization}},
  doi          = {10.1109/focs.2013.64},
  year         = {2013},
}

@article{11902,
  abstract     = {We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions ui,j(pj) expressing his utility of being matched to item j at price pj. For this setting we prove that a bidder optimal outcome always exists, even when the utility functions are non-linear and non-continuous. We give sufficient conditions under
which every mechanism that finds a bidder optimal outcome is incentive compatible. We also give a mechanism that finds a bidder optimal outcome if the conditions for incentive compatibility are satisfied. The running time of this mechanism is exponential in the number of items, but polynomial in the number of bidders.},
  author       = {Dütting, Paul and Henzinger, Monika H and Weber, Ingmar},
  issn         = {0304-3975},
  journal      = {Theoretical Computer Science},
  number       = {3},
  pages        = {22--32},
  publisher    = {Elsevier},
  title        = {{Bidder optimal assignments for general utilities}},
  doi          = {10.1016/j.tcs.2013.01.030},
  volume       = {478},
  year         = {2013},
}

@article{11959,
  abstract     = {No catalyst required! A highly efficient, catalyst-free process to generate diimide in situ from hydrazine monohydrate and molecular oxygen for the selective reduction of alkenes has been developed. The use of a gas–liquid segmented flow system allowed safe operating conditions and dramatically enhanced this atom-economical reaction, resulting in short processing times.},
  author       = {Pieber, Bartholomäus and Martinez, Sabrina Teixeira and Cantillo, David and Kappe, C. Oliver},
  issn         = {1521-3773},
  journal      = {Angewandte Chemie International Edition},
  number       = {39},
  pages        = {10241--10244},
  publisher    = {Wiley},
  title        = {{In situ generation of diimide from hydrazine and oxygen: Continuous-flow transfer hydrogenation of olefins}},
  doi          = {10.1002/anie.201303528},
  volume       = {52},
  year         = {2013},
}

@article{11960,
  abstract     = {It's not magic! The effects observed in microwave-irradiated chemical transformations can in most cases be rationalized by purely bulk thermal phenomena associated with rapid heating to elevated temperatures. As discussed in this Essay, the existence of so-called nonthermal or specific microwave effects is highly doubtful.},
  author       = {Kappe, C. Oliver and Pieber, Bartholomäus and Dallinger, Doris},
  issn         = {1521-3773},
  journal      = {Angewandte Chemie International Edition},
  number       = {4},
  pages        = {1088--1094},
  publisher    = {Wiley},
  title        = {{Microwave effects in organic synthesis: Myth or reality?}},
  doi          = {10.1002/anie.201204103},
  volume       = {52},
  year         = {2013},
}

@article{11973,
  abstract     = {The use of high-temperature/pressure gas–liquid continuous flow conditions dramatically enhances the iron-catalyzed aerobic oxidation of 2-benzylpyridines to their corresponding ketones. Pressurized air serves as a readily available oxygen source and propylene carbonate as a green solvent in this radically intensified preparation of synthetically valuable 2-aroylpyridines.},
  author       = {Pieber, Bartholomäus and Kappe, C. Oliver},
  issn         = {1463-9270},
  journal      = {Green Chemistry},
  number       = {2},
  pages        = {320--324},
  publisher    = {Royal Society of Chemistry},
  title        = {{Direct aerobic oxidation of 2-benzylpyridines in a gas-liquid continuous-flow regime using propylene carbonate as a solvent}},
  doi          = {10.1039/c2gc36896j},
  volume       = {15},
  year         = {2013},
}

@article{2690,
  abstract     = {Establishing the spatiotemporal concentration profile of neurotransmitter following synaptic vesicular release is essential for our understanding of inter-neuronal communication. Such profile is a determinant of synaptic strength, short-term plasticity and inter-synaptic crosstalk. Synaptically released glutamate has been suggested to reach a few millimolar in concentration and last for <1 ms. The synaptic cleft is often conceived as a single concentration compartment, whereas a huge gradient likely exists. Modelling studies have attempted to describe this gradient, but two key parameters, the number of glutamate in a vesicle (NGlu) and its diffusion coefficient (DGlu) in the extracellular space, remained unresolved. To determine this profile, the rat calyx of Held synapse at postnatal day 12-16 was studied where diffusion of glutamate occurs two-dimensionally and where quantification of AMPA receptor distribution on individual postsynaptic specialization on medial nucleus of the trapezoid body principal cells is possible using SDS-digested freeze-fracture replica labelling. To assess the performance of these receptors as glutamate sensors, a kinetic model of the receptors was constructed from outside-out patch recordings. From here, we simulated synaptic responses and compared them with the EPSC recordings. Combinations of NGlu and DGlu with an optimum of 7000 and 0.3 μm2 ms-1 reproduced the data, suggesting slow diffusion. Further simulations showed that a single vesicle does not saturate the synaptic receptors, and that glutamate spillover does not affect the conductance amplitude at this synapse. Using the estimated profile, we also evaluated how the number of multiple vesicle releases at individual active zones affects the amplitude of postsynaptic signals.},
  author       = {Budisantoso, Timotheus and Harumi Harada and Kamasawa, Naomi and Fukazawa, Yugo and Ryuichi Shigemoto and Matsui, Ko},
  journal      = {Journal of Physiology},
  number       = {1},
  pages        = {219 -- 239},
  publisher    = {Wiley-Blackwell},
  title        = {{Evaluation of glutamate concentration transient in the synaptic cleft of the rat calyx of Held}},
  doi          = {10.1113/jphysiol.2012.241398},
  volume       = {591},
  year         = {2013},
}

@article{2691,
  abstract     = {P/Q-type voltage-dependent calcium channels play key roles in transmitter release, integration of dendritic signals, generation of dendritic spikes, and gene expression. High intracellular calcium concentration transient produced by these channels is restricted to tens to hundreds of nanometers from the channels. Therefore, precise localization of these channels along the plasma membrane was long sought to decipher how each neuronal cell function is controlled. Here, we analyzed the distribution of Cav2.1 subunit of the P/Q-type channel using highly sensitive SDS-digested freeze-fracture replica labeling in the rat cerebellar Purkinje cells. The labeling efficiency was such that the number of immunogold particles in each parallel fiber active zone was comparable to that of functional channels calculated from previous reports. Two distinct patterns of Cav2.1 distribution, scattered and clustered, were found in Purkinje cells. The scattered Cav2.1 had a somatodendritic gradient with the density of immunogold particles increasing 2.5-fold from soma to distal dendrites. The other population with 74-fold higher density than the scattered particles was found within clusters of intramembrane particles on the P-face of soma and primary dendrites. Both populations of Cav2.1 were found as early as P3 and increased in the second postnatal week to a mature level. Using double immunogold labeling, we found that virtually all of the Cav2.1 clusters were colocalized with two types of calcium-activated potassium channels, BK and SK2, with the nearest neighbor distance of 40∼nm. Calcium nanodomain created by the opening of Cav2.1 channels likely activates the two channels that limit the extent of depolarization.},
  author       = {Indriati, Dwi Wahyu and Kamasawa, Naomi and Matsui, Ko and Meredith, Andrea L and Watanabe, Masahiko and Ryuichi Shigemoto},
  journal      = {Journal of Neuroscience},
  number       = {8},
  pages        = {3668 -- 3678},
  publisher    = {Society for Neuroscience},
  title        = {{Quantitative localization of Cav2.1 (P/Q-Type) voltage-dependent calcium channels in Purkinje cells: Somatodendritic gradient and distinct somatic coclustering with calcium-activated potassium channels}},
  doi          = {10.1523/JNEUROSCI.2921-12.2013},
  volume       = {33},
  year         = {2013},
}

@article{2692,
  abstract     = {The group III metabotropic glutamate (mGlu) receptors mGlu7 and mGlu8 are receiving increased attention as potential novel therapeutic targets for anxiety disorders. The effects mediated by these receptors appear to result from a complex interplay of facilitatory and inhibitory actions at different brain sites in the anxiety/fear circuits. To better understand the effect of mGlu7 and mGlu8 receptors on extinction of contextual fear and their critical sites of action in the fear networks, we focused on the amygdala. Direct injection into the basolateral complex of the amygdala of the mGlu7 receptor agonist AMN082 facilitated extinction, whereas the mGlu8 receptor agonist (S)-3,4-DCPG sustained freezing during the extinction acquisition trial. We also determined at the ultrastructural level the synaptic distribution of these receptors in the basal nucleus (BA) and intercalated cell clusters (ITCs) of the amygdala. Both areas are thought to exert key roles in fear extinction. We demonstrate that mGlu7 and mGlu8 receptors are located in different presynaptic terminals forming both asymmetric and symmetric synapses, and that they preferentially target neurons expressing mGlu1α receptors mostly located around ITCs. In addition we show that mGlu7 and mGlu8 receptors were segregated to different inputs to a significant extent. In particular, mGlu7a receptors were primarily onto glutamatergic afferents arising from the BA or midline thalamic nuclei, but not the medial prefrontal cortex (mPFC), as revealed by combined anterograde tracing and pre-embedding electron microscopy. On the other hand, mGlu8a showed a more restricted distribution in the BA and appeared absent from thalamic, mPFC and intrinsic inputs. This segregation of mGlu7 and mGlu8 receptors in different neuronal pathways of the fear circuit might explain the distinct effects on fear extinction training observed with mGlu7 and mGlu8 receptor agonists.},
  author       = {Dobi, Alice and Sartori, Simone B and Busti, Daniela and Van Der Putten, Herman V and Singewald, Nicolas and Ryuichi Shigemoto and Ferraguti, Francesco},
  journal      = {Neuropharmacology},
  pages        = {274 -- 289},
  publisher    = {Elsevier},
  title        = {{Neural substrates for the distinct effects of presynaptic group III metabotropic glutamate receptors on extinction of contextual fear conditioning in mice}},
  doi          = {10.1016/j.neuropharm.2012.05.025},
  volume       = {66},
  year         = {2013},
}

@article{2693,
  abstract     = {Inhibitory parvalbumin-containing interneurons (PVIs) control neuronal discharge and support the generation of theta- and gammafrequency oscillations in cortical networks. Fast GABAergic input onto PVIs is crucial for their synchronization and oscillatory entrainment, but the role of metabotropic GABAB receptors (GABABRs) in mediating slow presynaptic and postsynaptic inhibition remains unknown. In this study, we have combined high-resolution immunoelectron microscopy, whole-cell patch-clamp recording, and computational modeling to investigate the subcellular distribution and effects of GABABRs and their postsynaptic effector Kir3 channels in rat hippocampal PVIs. Pre-embedding immunogold labeling revealed that the receptors and channels localize at high levels to the extrasynaptic membrane of parvalbumin-immunoreactive dendrites. Immunoreactivity forGABABRs was also present at lower levels on PVI axon terminals. Whole-cell recordings further showed that synaptically released GABA in response to extracellular stimulation evokes large GABABR-mediated slow IPSCs in perisomatic-targeting (PT) PVIs, but only small or no currents in dendrite-targeting (DT) PVIs. In contrast, paired recordings demonstrated that GABABR activation results in presynaptic inhibition at the output synapses of both PT and DT PVIs, but more strongly in the latter. Finally, computational analysis indicated that GABAB IPSCs can phasically modulate the discharge of PT interneurons at theta frequencies. In summary, our results show that GABABRs differentially mediate slow presynaptic and postsynaptic inhibition in PVIs and can contribute to the dynamic modulation of their activity during oscillations. Furthermore, these data provide evidence for a compartment-specific molecular divergence of hippocampal PVI subtypes, suggesting that activation of GABABRs may shift the balance between perisomatic and dendritic inhibition.},
  author       = {Booker, Sam A and Gross, Anna and Althof, Daniel and Ryuichi Shigemoto and Bettler, Bernhard and Frotscher, Michael and Hearing, Matthew C and Wickman, Kevin D and Watanabe, Masahiko and Kulik, Ákos and Vida, Imre},
  journal      = {Journal of Neuroscience},
  number       = {18},
  pages        = {7961 -- 7974},
  publisher    = {Society for Neuroscience},
  title        = {{Differential GABAB-receptor-mediated effects in perisomatic- and dendrite-targeting parvalbumin interneurons}},
  doi          = {10.1523/JNEUROSCI.1186-12.2013},
  volume       = {33},
  year         = {2013},
}

@article{2697,
  abstract     = {We consider Hermitian and symmetric random band matrices H = (h xy ) in d⩾1 d ⩾ 1 dimensions. The matrix entries h xy , indexed by x,y∈(Z/LZ)d x , y ∈ ( Z / L Z ) d , are independent, centred random variables with variances sxy=E|hxy|2 s x y = E | h x y | 2 . We assume that s xy is negligible if |x − y| exceeds the band width W. In one dimension we prove that the eigenvectors of H are delocalized if W≫L4/5 W ≫ L 4 / 5 . We also show that the magnitude of the matrix entries |Gxy|2 | G x y | 2 of the resolvent G=G(z)=(H−z)−1 G = G ( z ) = ( H - z ) - 1 is self-averaging and we compute E|Gxy|2 E | G x y | 2 . We show that, as L→∞ L → ∞ and W≫L4/5 W ≫ L 4 / 5 , the behaviour of E|Gxy|2 E | G x y | 2 is governed by a diffusion operator whose diffusion constant we compute. Similar results are obtained in higher dimensions.},
  author       = {László Erdös and Knowles, Antti and Yau, Horng-Tzer and Yin, Jun},
  journal      = {Communications in Mathematical Physics},
  number       = {1},
  pages        = {367 -- 416},
  publisher    = {Springer},
  title        = {{Delocalization and diffusion profile for random band matrices}},
  doi          = {10.1007/s00220-013-1773-3},
  volume       = {323},
  year         = {2013},
}

@article{2698,
  abstract     = {We consider non-interacting particles subject to a fixed external potential V and a self-generated magnetic field B. The total energy includes the field energy β∫B2 and we minimize over all particle states and magnetic fields. In the case of spin-1/2 particles this minimization leads to the coupled Maxwell-Pauli system. The parameter β tunes the coupling strength between the field and the particles and it effectively determines the strength of the field. We investigate the stability and the semiclassical asymptotics, h→0, of the total ground state energy E(β,h,V). The relevant parameter measuring the field strength in the semiclassical limit is κ=βh. We are not able to give the exact leading order semiclassical asymptotics uniformly in κ or even for fixed κ. We do however give upper and lower bounds on E with almost matching dependence on κ. In the simultaneous limit h→0 and κ→∞ we show that the standard non-magnetic Weyl asymptotics holds. The same result also holds for the spinless case, i.e. where the Pauli operator is replaced by the Schrödinger operator.},
  author       = {Erdös, László and Fournais, Søren and Solovej, Jan},
  journal      = {Journal of the European Mathematical Society},
  number       = {6},
  pages        = {2093 -- 2113},
  publisher    = {European Mathematical Society},
  title        = {{Stability and semiclassics in self-generated fields}},
  doi          = {10.4171/JEMS/416},
  volume       = {15},
  year         = {2013},
}

@inproceedings{2718,
  abstract     = {Even though both population and quantitative genetics, and evolutionary computation, deal with the same questions, they have developed largely independently of each other. I review key results from each field, emphasising those that apply independently of the (usually unknown) relation between genotype and phenotype. The infinitesimal model provides a simple framework for predicting the response of complex traits to selection, which in biology has proved remarkably successful. This allows one to choose the schedule of population sizes and selection intensities that will maximise the response to selection, given that the total number of individuals realised, C = ∑t Nt, is constrained. This argument shows that for an additive trait (i.e., determined by the sum of effects of the genes), the optimum population size and the maximum possible response (i.e., the total change in trait mean) are both proportional to √C.},
  author       = {Barton, Nicholas H and Paixao, Tiago},
  booktitle    = {Proceedings of the 15th annual conference on Genetic and evolutionary computation},
  location     = {Amsterdam, Netherlands},
  pages        = {1573 -- 1580},
  publisher    = {ACM},
  title        = {{Can quantitative and population genetics help us understand evolutionary computation?}},
  doi          = {10.1145/2463372.2463568},
  year         = {2013},
}

@inproceedings{2719,
  abstract     = {Prediction of the evolutionary process is a long standing problem both in the theory of evolutionary biology and evolutionary computation (EC). It has long been realized that heritable variation is crucial to both the response to selection and the success of genetic algorithms. However, not all variation contributes in the same way to the response. Quantitative genetics has developed a large body of work trying to estimate and understand how different components of the variance in fitness in the population contribute to the response to selection. We illustrate how to apply some concepts of quantitative genetics to the analysis of genetic algorithms. In particular, we derive estimates for the short term prediction of the response to selection and we use variance decomposition to gain insight on local aspects of the landscape. Finally, we propose a new population based genetic algorithm that uses these methods to improve its operation.},
  author       = {Paixao, Tiago and Barton, Nicholas H},
  booktitle    = {Proceedings of the 15th annual conference on Genetic and evolutionary computation},
  location     = {Amsterdam, Netherlands},
  pages        = {845 -- 852},
  publisher    = {ACM},
  title        = {{A variance decomposition approach to the analysis of genetic algorithms}},
  doi          = {10.1145/2463372.2463470},
  year         = {2013},
}

@article{2720,
  abstract     = {Knowledge of the rate and fitness effects of mutations is essential for understanding the process of evolution. Mutations are inherently difficult to study because they are rare and are frequently eliminated by natural selection. In the ciliate Tetrahymena thermophila, mutations can accumulate in the germline genome without being exposed to selection. We have conducted a mutation accumulation (MA) experiment in this species. Assuming that all mutations are deleterious and have the same effect, we estimate that the deleterious mutation rate per haploid germline genome per generation is U = 0.0047 (95% credible interval: 0.0015, 0.0125), and that germline mutations decrease fitness by s = 11% when expressed in a homozygous state (95% CI: 4.4%, 27%). We also estimate that deleterious mutations are partially recessive on average (h = 0.26; 95% CI: –0.022, 0.62) and that the rate of lethal mutations is <10% of the deleterious mutation rate. Comparisons between the observed evolutionary responses in the germline and somatic genomes and the results from individual-based simulations of MA suggest that the two genomes have similar mutational parameters. These are the first estimates of the deleterious mutation rate and fitness effects from the eukaryotic supergroup Chromalveolata and are within the range of those of other eukaryotes.},
  author       = {Long, Hongan and Paixao, Tiago and Azevedo, Ricardo and Zufall, Rebecca},
  journal      = {Genetics},
  number       = {2},
  pages        = {527--540},
  publisher    = {Genetics Society of America},
  title        = {{Accumulation of spontaneous mutations in the ciliate Tetrahymena thermophila}},
  doi          = {10.1534/genetics.113.153536},
  volume       = {195},
  year         = {2013},
}