[{"acknowledgement":"K. C., M. H., and W. D. are partially supported by the Vienna\r\nScience and Technology Fund (WWTF) through project ICT15-003.\r\nK. C. is partially supported by the Austrian Science Fund (FWF)\r\nNFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Start grant\r\n(279307: Graph Games). For W. D., M. H., and V. L. the research\r\nleading to these results has received funding from the European\r\nResearch Council under the European Union’s Seventh Framework\r\nProgramme (FP/2007-2013) / ERC Grant Agreement no. 340506.","month":"07","page":"197 - 206","status":"public","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Dvoák, Wolfgang","last_name":"Dvoák","first_name":"Wolfgang"},{"first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"last_name":"Loitzenbauer","first_name":"Veronika","full_name":"Loitzenbauer, Veronika"}],"alternative_title":["Proceedings Symposium on Logic in Computer Science"],"publication":"Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science","publist_id":"6219","date_updated":"2025-09-22T14:12:05Z","date_published":"2016-07-05T00:00:00Z","citation":{"apa":"Chatterjee, K., Dvoák, W., Henzinger, M., & Loitzenbauer, V. (2016). Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 197–206). New York, NY, USA: IEEE. https://doi.org/10.1145/2933575.2935304","mla":"Chatterjee, Krishnendu, et al. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206, doi:10.1145/2933575.2935304.","ieee":"K. Chatterjee, W. Dvoák, M. Henzinger, and V. Loitzenbauer, “Model and objective separation with conditional lower bounds: disjunction is harder than conjunction,” in Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, New York, NY, USA, 2016, pp. 197–206.","short":"K. Chatterjee, W. Dvoák, M. Henzinger, V. Loitzenbauer, in:, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2016, pp. 197–206.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvoák, Monika Henzinger, and Veronika Loitzenbauer. “Model and Objective Separation with Conditional Lower Bounds: Disjunction Is Harder than Conjunction.” In Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 197–206. IEEE, 2016. https://doi.org/10.1145/2933575.2935304.","ama":"Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. In: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. IEEE; 2016:197-206. doi:10.1145/2933575.2935304","ista":"Chatterjee K, Dvoák W, Henzinger M, Loitzenbauer V. 2016. Model and objective separation with conditional lower bounds: disjunction is harder than conjunction. Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, Proceedings Symposium on Logic in Computer Science, , 197–206."},"abstract":[{"lang":"eng","text":"Given a model of a system and an objective, the model-checking question asks whether the model satisfies the objective. We study polynomial-time problems in two classical models, graphs and Markov Decision Processes (MDPs), with respect to several fundamental -regular objectives, e.g., Rabin and Streett objectives. For many of these problems the best-known upper bounds are quadratic or cubic, yet no super-linear lower bounds are known. In this work our contributions are two-fold: First, we present several improved algorithms, and second, we present the first conditional super-linear lower bounds based on widely believed assumptions about the complexity of CNF-SAT and combinatorial Boolean matrix multiplication. A separation result for two models with respect to an objective means a conditional lower bound for one model that is strictly higher than the existing upper bound for the other model, and similarly for two objectives with respect to a model. Our results establish the following separation results: (1) A separation of models (graphs and MDPs) for disjunctive queries of reachability and Büchi objectives. (2) Two kinds of separations of objectives, both for graphs and MDPs, namely, (2a) the separation of dual objectives such as Streett/Rabin objectives, and (2b) the separation of conjunction and disjunction of multiple objectives of the same type such as safety, Büchi, and coBüchi. In summary, our results establish the first model and objective separation results for graphs and MDPs for various classical -regular objectives. Quite strikingly, we establish conditional lower bounds for the disjunction of objectives that are strictly higher than the existing upper bounds for the conjunction of the same objectives. © 2016 ACM."}],"conference":{"start_date":"2016-07-05","end_date":"2016-07-08","name":"LICS: Logic in Computer Science","location":"New York, NY, USA"},"article_processing_charge":"No","title":"Model and objective separation with conditional lower bounds: disjunction is harder than conjunction","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"publication_status":"published","year":"2016","publisher":"IEEE","department":[{"_id":"KrCh"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1602.02670"}],"type":"conference","external_id":{"arxiv":["1602.02670"],"isi":["000387609200020"]},"day":"05","oa":1,"project":[{"grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","date_created":"2018-12-11T11:50:22Z","isi":1,"language":[{"iso":"eng"}],"doi":"10.1145/2933575.2935304","_id":"1140","scopus_import":"1","oa_version":"Preprint"},{"page":"249 - 260","acknowledgement":"The work presented in this paper was partially supported by Polish National Science Centre grant nos. DEC-2012/05/N/ST6/03433 and DEC-2011/03/B/ST6/01393. Radosław Łazarz was supported by Polish National Science Centre grant no. DEC-2013/10/M/ST6/00531.","volume":17,"month":"11","publication":"Journal of Computational Science","issue":"1","status":"public","author":[{"full_name":"Łazarz, Radosław","first_name":"Radosław","last_name":"Łazarz"},{"last_name":"Idzik","first_name":"Michał","full_name":"Idzik, Michał"},{"first_name":"Konrad","last_name":"Gądek","full_name":"Gądek, Konrad"},{"last_name":"Gajda-Zagorska","first_name":"Ewa P","id":"47794CF0-F248-11E8-B48F-1D18A9856A87","full_name":"Gajda-Zagorska, Ewa P"}],"publist_id":"6217","date_updated":"2025-09-22T14:11:23Z","intvolume":" 17","abstract":[{"lang":"eng","text":"In this paper we introduce the Multiobjective Optimization Hierarchic Genetic Strategy with maturing (MO-mHGS), a meta-algorithm that performs evolutionary optimization in a hierarchy of populations. The maturing mechanism improves growth and reduces redundancy. The performance of MO-mHGS with selected state-of-the-art multiobjective evolutionary algorithms as internal algorithms is analysed on benchmark problems and their modifications for which single fitness evaluation time depends on the solution accuracy. We compare the proposed algorithm with the Island Model Genetic Algorithm as well as with single-deme methods, and discuss the impact of internal algorithms on the MO-mHGS meta-algorithm. © 2016 Elsevier B.V."}],"citation":{"ista":"Łazarz R, Idzik M, Gądek K, Gajda-Zagorska EP. 2016. Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization. Journal of Computational Science. 17(1), 249–260.","ama":"Łazarz R, Idzik M, Gądek K, Gajda-Zagorska EP. Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization. Journal of Computational Science. 2016;17(1):249-260. doi:10.1016/j.jocs.2016.03.004","chicago":"Łazarz, Radosław, Michał Idzik, Konrad Gądek, and Ewa P Gajda-Zagorska. “Hierarchic Genetic Strategy with Maturing as a Generic Tool for Multiobjective Optimization.” Journal of Computational Science. Elsevier, 2016. https://doi.org/10.1016/j.jocs.2016.03.004.","short":"R. Łazarz, M. Idzik, K. Gądek, E.P. Gajda-Zagorska, Journal of Computational Science 17 (2016) 249–260.","ieee":"R. Łazarz, M. Idzik, K. Gądek, and E. P. Gajda-Zagorska, “Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization,” Journal of Computational Science, vol. 17, no. 1. Elsevier, pp. 249–260, 2016.","mla":"Łazarz, Radosław, et al. “Hierarchic Genetic Strategy with Maturing as a Generic Tool for Multiobjective Optimization.” Journal of Computational Science, vol. 17, no. 1, Elsevier, 2016, pp. 249–60, doi:10.1016/j.jocs.2016.03.004.","apa":"Łazarz, R., Idzik, M., Gądek, K., & Gajda-Zagorska, E. P. (2016). Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization. Journal of Computational Science. Elsevier. https://doi.org/10.1016/j.jocs.2016.03.004"},"date_published":"2016-11-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","title":"Hierarchic genetic strategy with maturing as a generic tool for multiobjective optimization","type":"journal_article","day":"01","external_id":{"isi":["000390625600021"]},"publication_status":"published","year":"2016","publisher":"Elsevier","department":[{"_id":"ChWo"}],"date_created":"2018-12-11T11:50:22Z","isi":1,"quality_controlled":"1","doi":"10.1016/j.jocs.2016.03.004","_id":"1141","scopus_import":"1","oa_version":"None","language":[{"iso":"eng"}]},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions","article_processing_charge":"No","oa":1,"external_id":{"isi":["000388056400006"]},"day":"01","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://ora.ox.ac.uk/objects/uuid:f53a464e-1e5b-4f08-a7d8-b6749b852b9d"}],"department":[{"_id":"MiSi"},{"_id":"PeJo"}],"publisher":"Nature Publishing Group","publication_status":"published","year":"2016","isi":1,"date_created":"2018-12-11T11:50:22Z","quality_controlled":"1","oa_version":"Submitted Version","scopus_import":"1","_id":"1142","doi":"10.1038/ni.3590","language":[{"iso":"eng"}],"page":"1361 - 1372","month":"12","volume":17,"acknowledgement":"Y. Fukui (Medical Institute of Bioregulation, Kyushu University) and J. Stein (Theodor Kocher Institute, University of Bern) are acknowledged for providing the DOCK8 deficient bone marrow. and H. Häcker (St. Judes Children's Research Hospital) for providing the ERHBD-HoxB8-encoding retroviral construct. pSpCas9(BB)-2a-Puro (PX459) was a gift from F. Zhang (Massachusetts Institute of Technology) (Addgene plasmid # 48139) and pGRG36 was a gift from N. Craig (Johns Hopkins University School of Medicine) (Addgene plasmid # 16666). LifeAct-GFP-encoding retrovirus was kindly provided by A. Leithner (Institute of Science and Technology Austria). pSIM8 and TKC E. coli were gifts from D.L. Court (Center for Cancer Research, National Cancer Institute). We acknowledge M. Gröger and S. Rauscher for excellent technical support (Core imaging facility, Medical University of Vienna). We thank D.P. Barlow and L.R. Cheever for critical reading of the manuscript. This work was supported by the Austrian Academy of Sciences, the Science Fund of the Austrian National Bank (14107) and the Austrian Science Fund FWF (I1620-B22) in the Infect-ERA framework (to S.Knapp).","issue":"12","publication":"Nature Immunology","author":[{"first_name":"Rui","last_name":"Martins","full_name":"Martins, Rui"},{"last_name":"Maier","first_name":"Julia","full_name":"Maier, Julia"},{"full_name":"Gorki, Anna","last_name":"Gorki","first_name":"Anna"},{"last_name":"Huber","first_name":"Kilian","full_name":"Huber, Kilian"},{"last_name":"Sharif","first_name":"Omar","full_name":"Sharif, Omar"},{"last_name":"Starkl","first_name":"Philipp","full_name":"Starkl, Philipp"},{"full_name":"Saluzzo, Simona","first_name":"Simona","last_name":"Saluzzo"},{"first_name":"Federica","last_name":"Quattrone","full_name":"Quattrone, Federica"},{"full_name":"Gawish, Riem","last_name":"Gawish","first_name":"Riem"},{"full_name":"Lakovits, Karin","first_name":"Karin","last_name":"Lakovits"},{"first_name":"Michael","last_name":"Aichinger","full_name":"Aichinger, Michael"},{"last_name":"Radic Sarikas","first_name":"Branka","full_name":"Radic Sarikas, Branka"},{"full_name":"Lardeau, Charles","first_name":"Charles","last_name":"Lardeau"},{"first_name":"Anastasiya","last_name":"Hladik","full_name":"Hladik, Anastasiya"},{"full_name":"Korosec, Ana","first_name":"Ana","last_name":"Korosec"},{"first_name":"Markus","last_name":"Brown","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Markus"},{"full_name":"Vaahtomeri, Kari","id":"368EE576-F248-11E8-B48F-1D18A9856A87","first_name":"Kari","orcid":"0000-0001-7829-3518","last_name":"Vaahtomeri"},{"first_name":"Michelle","last_name":"Duggan","id":"2EDEA62C-F248-11E8-B48F-1D18A9856A87","full_name":"Duggan, Michelle"},{"full_name":"Kerjaschki, Dontscho","last_name":"Kerjaschki","first_name":"Dontscho"},{"first_name":"Harald","last_name":"Esterbauer","full_name":"Esterbauer, Harald"},{"last_name":"Colinge","first_name":"Jacques","full_name":"Colinge, Jacques"},{"full_name":"Eisenbarth, Stephanie","last_name":"Eisenbarth","first_name":"Stephanie"},{"full_name":"Decker, Thomas","first_name":"Thomas","last_name":"Decker"},{"full_name":"Bennett, Keiryn","first_name":"Keiryn","last_name":"Bennett"},{"first_name":"Stefan","last_name":"Kubicek","full_name":"Kubicek, Stefan"},{"last_name":"Sixt","orcid":"0000-0002-6620-9179","first_name":"Michael K","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Giulio","last_name":"Superti Furga","full_name":"Superti Furga, Giulio"},{"full_name":"Knapp, Sylvia","last_name":"Knapp","first_name":"Sylvia"}],"status":"public","date_updated":"2025-09-22T14:10:50Z","publist_id":"6216","intvolume":" 17","citation":{"ieee":"R. Martins et al., “Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions,” Nature Immunology, vol. 17, no. 12. Nature Publishing Group, pp. 1361–1372, 2016.","mla":"Martins, Rui, et al. “Heme Drives Hemolysis-Induced Susceptibility to Infection via Disruption of Phagocyte Functions.” Nature Immunology, vol. 17, no. 12, Nature Publishing Group, 2016, pp. 1361–72, doi:10.1038/ni.3590.","short":"R. Martins, J. Maier, A. Gorki, K. Huber, O. Sharif, P. Starkl, S. Saluzzo, F. Quattrone, R. Gawish, K. Lakovits, M. Aichinger, B. Radic Sarikas, C. Lardeau, A. Hladik, A. Korosec, M. Brown, K. Vaahtomeri, M. Duggan, D. Kerjaschki, H. Esterbauer, J. Colinge, S. Eisenbarth, T. Decker, K. Bennett, S. Kubicek, M.K. Sixt, G. Superti Furga, S. Knapp, Nature Immunology 17 (2016) 1361–1372.","apa":"Martins, R., Maier, J., Gorki, A., Huber, K., Sharif, O., Starkl, P., … Knapp, S. (2016). Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions. Nature Immunology. Nature Publishing Group. https://doi.org/10.1038/ni.3590","ama":"Martins R, Maier J, Gorki A, et al. Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions. Nature Immunology. 2016;17(12):1361-1372. doi:10.1038/ni.3590","chicago":"Martins, Rui, Julia Maier, Anna Gorki, Kilian Huber, Omar Sharif, Philipp Starkl, Simona Saluzzo, et al. “Heme Drives Hemolysis-Induced Susceptibility to Infection via Disruption of Phagocyte Functions.” Nature Immunology. Nature Publishing Group, 2016. https://doi.org/10.1038/ni.3590.","ista":"Martins R, Maier J, Gorki A, Huber K, Sharif O, Starkl P, Saluzzo S, Quattrone F, Gawish R, Lakovits K, Aichinger M, Radic Sarikas B, Lardeau C, Hladik A, Korosec A, Brown M, Vaahtomeri K, Duggan M, Kerjaschki D, Esterbauer H, Colinge J, Eisenbarth S, Decker T, Bennett K, Kubicek S, Sixt MK, Superti Furga G, Knapp S. 2016. Heme drives hemolysis-induced susceptibility to infection via disruption of phagocyte functions. Nature Immunology. 17(12), 1361–1372."},"abstract":[{"text":"Hemolysis drives susceptibility to bacterial infections and predicts poor outcome from sepsis. These detrimental effects are commonly considered to be a consequence of heme-iron serving as a nutrient for bacteria. We employed a Gram-negative sepsis model and found that elevated heme levels impaired the control of bacterial proliferation independently of heme-iron acquisition by pathogens. Heme strongly inhibited phagocytosis and the migration of human and mouse phagocytes by disrupting actin cytoskeletal dynamics via activation of the GTP-binding Rho family protein Cdc42 by the guanine nucleotide exchange factor DOCK8. A chemical screening approach revealed that quinine effectively prevented heme effects on the cytoskeleton, restored phagocytosis and improved survival in sepsis. These mechanistic insights provide potential therapeutic targets for patients with sepsis or hemolytic disorders.","lang":"eng"}],"date_published":"2016-12-01T00:00:00Z"},{"article_processing_charge":"No","title":"Ground states of large bosonic systems: The gross Pitaevskii limit revisited","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"year":"2016","publication_status":"published","publisher":"Mathematical Sciences Publishers","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1503.07061"}],"department":[{"_id":"RoSe"}],"type":"journal_article","day":"24","external_id":{"isi":["000378287000006"],"arxiv":["1503.07061"]},"oa":1,"project":[{"grant_number":"291734","call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"quality_controlled":"1","date_created":"2018-12-11T11:50:23Z","isi":1,"language":[{"iso":"eng"}],"doi":"10.2140/apde.2016.9.459","_id":"1143","scopus_import":"1","oa_version":"Preprint","volume":9,"ec_funded":1,"month":"03","page":"459 - 485","status":"public","author":[{"first_name":"Phan","last_name":"Nam","id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan"},{"first_name":"Nicolas","last_name":"Rougerie","full_name":"Rougerie, Nicolas"},{"first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"issue":"2","publication":"Analysis and PDE","intvolume":" 9","publist_id":"6215","date_updated":"2025-09-22T14:10:16Z","date_published":"2016-03-24T00:00:00Z","citation":{"chicago":"Nam, Phan, Nicolas Rougerie, and Robert Seiringer. “Ground States of Large Bosonic Systems: The Gross Pitaevskii Limit Revisited.” Analysis and PDE. Mathematical Sciences Publishers, 2016. https://doi.org/10.2140/apde.2016.9.459.","ama":"Nam P, Rougerie N, Seiringer R. Ground states of large bosonic systems: The gross Pitaevskii limit revisited. Analysis and PDE. 2016;9(2):459-485. doi:10.2140/apde.2016.9.459","apa":"Nam, P., Rougerie, N., & Seiringer, R. (2016). Ground states of large bosonic systems: The gross Pitaevskii limit revisited. Analysis and PDE. Mathematical Sciences Publishers. https://doi.org/10.2140/apde.2016.9.459","short":"P. Nam, N. Rougerie, R. Seiringer, Analysis and PDE 9 (2016) 459–485.","ieee":"P. Nam, N. Rougerie, and R. Seiringer, “Ground states of large bosonic systems: The gross Pitaevskii limit revisited,” Analysis and PDE, vol. 9, no. 2. Mathematical Sciences Publishers, pp. 459–485, 2016.","mla":"Nam, Phan, et al. “Ground States of Large Bosonic Systems: The Gross Pitaevskii Limit Revisited.” Analysis and PDE, vol. 9, no. 2, Mathematical Sciences Publishers, 2016, pp. 459–85, doi:10.2140/apde.2016.9.459.","ista":"Nam P, Rougerie N, Seiringer R. 2016. Ground states of large bosonic systems: The gross Pitaevskii limit revisited. Analysis and PDE. 9(2), 459–485."},"abstract":[{"lang":"eng","text":"We study the ground state of a dilute Bose gas in a scaling limit where the Gross-Pitaevskii functional emerges. This is a repulsive nonlinear Schrödinger functional whose quartic term is proportional to the scattering length of the interparticle interaction potential. We propose a new derivation of this limit problem, with a method that bypasses some of the technical difficulties that previous derivations had to face. The new method is based on a combination of Dyson\\'s lemma, the quantum de Finetti theorem and a second moment estimate for ground states of the effective Dyson Hamiltonian. It applies equally well to the case where magnetic fields or rotation are present."}]},{"doi":"10.1021/acssynbio.6b00013","_id":"1008","oa_version":"None","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:49:40Z","isi":1,"quality_controlled":"1","type":"journal_article","external_id":{"isi":["000386196100008"]},"day":"05","publication_status":"published","year":"2016","publisher":"American Chemical Society","department":[{"_id":"CaGu"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","title":"An orthogonal permease–inducer–repressor feedback loop shows bistability","abstract":[{"text":"Feedback loops in biological networks, among others, enable differentiation and cell cycle progression, and increase robustness in signal transduction. In natural networks, feedback loops are often complex and intertwined, making it challenging to identify which loops are mainly responsible for an observed behavior. However, minimal synthetic replicas could allow for such identification. Here, we engineered a synthetic permease-inducer-repressor system in Saccharomyces cerevisiae to analyze if a transport-mediated positive feedback loop could be a core mechanism for the switch-like behavior in the regulation of metabolic gene networks such as the S. cerevisiae GAL system or the Escherichia coli lac operon. We characterized the synthetic circuit using deterministic and stochastic mathematical models. Similar to its natural counterparts, our synthetic system shows bistable and hysteretic behavior, and the inducer concentration range for bistability as well as the switching rates between the two stable states depend on the repressor concentration. Our results indicate that a generic permease–inducer–repressor circuit with a single feedback loop is sufficient to explain the experimentally observed bistable behavior of the natural systems. We anticipate that the approach of reimplementing natural systems with orthogonal parts to identify crucial network components is applicable to other natural systems such as signaling pathways.","lang":"eng"}],"citation":{"apa":"Gnügge, R., Dharmarajan, L., Lang, M., & Stelling, J. (2016). An orthogonal permease–inducer–repressor feedback loop shows bistability. ACS Synthetic Biology. American Chemical Society. https://doi.org/10.1021/acssynbio.6b00013","ieee":"R. Gnügge, L. Dharmarajan, M. Lang, and J. Stelling, “An orthogonal permease–inducer–repressor feedback loop shows bistability,” ACS Synthetic Biology, vol. 5, no. 10. American Chemical Society, pp. 1098–1107, 2016.","short":"R. Gnügge, L. Dharmarajan, M. Lang, J. Stelling, ACS Synthetic Biology 5 (2016) 1098–1107.","mla":"Gnügge, Robert, et al. “An Orthogonal Permease–Inducer–Repressor Feedback Loop Shows Bistability.” ACS Synthetic Biology, vol. 5, no. 10, American Chemical Society, 2016, pp. 1098–107, doi:10.1021/acssynbio.6b00013.","chicago":"Gnügge, Robert, Lekshmi Dharmarajan, Moritz Lang, and Jörg Stelling. “An Orthogonal Permease–Inducer–Repressor Feedback Loop Shows Bistability.” ACS Synthetic Biology. American Chemical Society, 2016. https://doi.org/10.1021/acssynbio.6b00013.","ama":"Gnügge R, Dharmarajan L, Lang M, Stelling J. An orthogonal permease–inducer–repressor feedback loop shows bistability. ACS Synthetic Biology. 2016;5(10):1098-1107. doi:10.1021/acssynbio.6b00013","ista":"Gnügge R, Dharmarajan L, Lang M, Stelling J. 2016. An orthogonal permease–inducer–repressor feedback loop shows bistability. ACS Synthetic Biology. 5(10), 1098–1107."},"date_published":"2016-05-05T00:00:00Z","publist_id":"6390","date_updated":"2025-09-22T14:20:45Z","intvolume":" 5","publication":"ACS Synthetic Biology","issue":"10","status":"public","author":[{"first_name":"Robert","last_name":"Gnügge","full_name":"Gnügge, Robert"},{"last_name":"Dharmarajan","first_name":"Lekshmi","full_name":"Dharmarajan, Lekshmi"},{"full_name":"Lang, Moritz","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","last_name":"Lang","first_name":"Moritz"},{"first_name":"Jörg","last_name":"Stelling","full_name":"Stelling, Jörg"}],"page":"1098 - 1107","volume":5,"acknowledgement":"We thank Julio Polaina (Instituto de Agroqu ı ́ mica y Tecnolog ı ́ a de Alimentos, C.S.I.C., Paterna, Spain) for the gift of plasmid pMR4, Gregor W. Schmidt for provision of and support with the micro fl uidic device, Markus Du ̈ rr for the cell tracking R script, and Lukas Widmer for the script for MEIGO using “ parfor ” in MATLAB. We acknowledge the members of the Stelling group for discussions, comments, and support.","month":"05"},{"issue":"1822","publication":"Proceedings of the Royal Society of London Series B Biological Sciences","author":[{"first_name":"Qin","last_name":"Qi","orcid":"0000-0002-6148-2416","id":"3B22D412-F248-11E8-B48F-1D18A9856A87","full_name":"Qi, Qin"},{"full_name":"Toll Riera, Macarena","first_name":"Macarena","last_name":"Toll Riera"},{"full_name":"Heilbron, Karl","first_name":"Karl","last_name":"Heilbron"},{"full_name":"Preston, Gail","last_name":"Preston","first_name":"Gail"},{"full_name":"Maclean, R Craig","first_name":"R Craig","last_name":"Maclean"}],"status":"public","file":[{"content_type":"application/pdf","file_size":626804,"file_id":"4899","file_name":"IST-2016-488-v1+1_20152452.full.pdf","checksum":"78ffe70c1c88af3856d31ca6b7195a27","relation":"main_file","date_created":"2018-12-12T10:11:43Z","access_level":"open_access","date_updated":"2020-07-14T12:45:02Z","creator":"system"}],"month":"01","ddc":["570"],"article_number":"20152452","volume":283,"acknowledgement":"We thank the High-Throughput Genomics Group at the Wellcome Trust Centre for Human Genetics funded by Wellcome\r\nTrust grant reference 090532/Z/09/Z and Medical Research Council Hub grant no. G0900747 91070 for generation of the high-throughput sequencing data. We thank Wook Kim and two anonymous reviewers for their constructive feedback on previous versions of our manuscript.","abstract":[{"lang":"eng","text":"Antibiotic resistance carries a fitness cost that must be overcome in order for resistance to persist over the long term. Compensatory mutations that recover the functional defects associated with resistance mutations have been argued to play a key role in overcoming the cost of resistance, but compensatory mutations are expected to be rare relative to generally beneficial mutations that increase fitness, irrespective of antibiotic resistance. Given this asymmetry, population genetics theory predicts that populations should adapt by compensatory mutations when the cost of resistance is large, whereas generally beneficial mutations should drive adaptation when the cost of resistance is small. We tested this prediction by determining the genomic mechanisms underpinning adaptation to antibiotic-free conditions in populations of the pathogenic bacterium Pseudomonas aeruginosa that carry costly antibiotic resistance mutations. Whole-genome sequencing revealed that populations founded by high-cost rifampicin-resistant mutants adapted via compensatory mutations in three genes of the RNA polymerase core enzyme, whereas populations founded by low-cost mutants adapted by generally beneficial mutations, predominantly in the quorum-sensing transcriptional regulator gene lasR. Even though the importance of compensatory evolution in maintaining resistance has been widely recognized, our study shows that the roles of general adaptation in maintaining resistance should not be underestimated and highlights the need to understand how selection at other sites in the genome influences the dynamics of resistance alleles in clinical settings."}],"citation":{"ista":"Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. 2016. The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. Proceedings of the Royal Society of London Series B Biological Sciences. 283(1822), 20152452.","chicago":"Qi, Qin, Macarena Toll Riera, Karl Heilbron, Gail Preston, and R Craig Maclean. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin Resistance in Pseudomonas Aeruginosa.” Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, The, 2016. https://doi.org/10.1098/rspb.2015.2452.","ama":"Qi Q, Toll Riera M, Heilbron K, Preston G, Maclean RC. The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. Proceedings of the Royal Society of London Series B Biological Sciences. 2016;283(1822). doi:10.1098/rspb.2015.2452","apa":"Qi, Q., Toll Riera, M., Heilbron, K., Preston, G., & Maclean, R. C. (2016). The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa. Proceedings of the Royal Society of London Series B Biological Sciences. Royal Society, The. https://doi.org/10.1098/rspb.2015.2452","mla":"Qi, Qin, et al. “The Genomic Basis of Adaptation to the Fitness Cost of Rifampicin Resistance in Pseudomonas Aeruginosa.” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 283, no. 1822, 20152452, Royal Society, The, 2016, doi:10.1098/rspb.2015.2452.","ieee":"Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, and R. C. Maclean, “The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa,” Proceedings of the Royal Society of London Series B Biological Sciences, vol. 283, no. 1822. Royal Society, The, 2016.","short":"Q. Qi, M. Toll Riera, K. Heilbron, G. Preston, R.C. Maclean, Proceedings of the Royal Society of London Series B Biological Sciences 283 (2016)."},"has_accepted_license":"1","date_published":"2016-01-13T00:00:00Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-09-18T11:03:28Z","publist_id":"5619","pubrep_id":"488","intvolume":" 283","oa":1,"external_id":{"isi":["000368441200022"]},"day":"13","type":"journal_article","department":[{"_id":"ToBo"}],"publisher":"Royal Society, The","year":"2016","publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"The genomic basis of adaptation to the fitness cost of rifampicin resistance in Pseudomonas aeruginosa","article_processing_charge":"No","scopus_import":"1","oa_version":"Published Version","_id":"1552","doi":"10.1098/rspb.2015.2452","file_date_updated":"2020-07-14T12:45:02Z","language":[{"iso":"eng"}],"isi":1,"date_created":"2018-12-11T11:52:40Z","quality_controlled":"1"},{"article_processing_charge":"No","title":"Structure preserving signatures and commitments to group elements","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","year":"2016","publisher":"Springer","department":[{"_id":"KrPi"}],"type":"journal_article","external_id":{"isi":["000371077900004"]},"day":"01","quality_controlled":"1","date_created":"2018-12-11T11:52:54Z","isi":1,"language":[{"iso":"eng"}],"doi":"10.1007/s00145-014-9196-7","_id":"1592","oa_version":"None","scopus_import":"1","volume":29,"acknowledgement":"The authors would like to thank the anonymous reviewers of this paper. We also would like to express our appreciation to the program committee and the anonymous reviewers for CRYPTO 2010. The first author thanks Sherman S. M. Chow for his comment on group signatures in Sect. 7.1.","month":"04","page":"363 - 421","status":"public","author":[{"last_name":"Abe","first_name":"Masayuki","full_name":"Abe, Masayuki"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","last_name":"Fuchsbauer","first_name":"Georg"},{"last_name":"Groth","first_name":"Jens","full_name":"Groth, Jens"},{"first_name":"Kristiyan","last_name":"Haralambiev","full_name":"Haralambiev, Kristiyan"},{"last_name":"Ohkubo","first_name":"Miyako","full_name":"Ohkubo, Miyako"}],"issue":"2","publication":"Journal of Cryptology","intvolume":" 29","publist_id":"5579","date_updated":"2025-09-18T11:02:49Z","date_published":"2016-04-01T00:00:00Z","abstract":[{"lang":"eng","text":"A modular approach to constructing cryptographic protocols leads to simple designs but often inefficient instantiations. On the other hand, ad hoc constructions may yield efficient protocols at the cost of losing conceptual simplicity. We suggest a new design paradigm, structure-preserving cryptography, that provides a way to construct modular protocols with reasonable efficiency while retaining conceptual simplicity. A cryptographic scheme over a bilinear group is called structure-preserving if its public inputs and outputs consist of elements from the bilinear groups and their consistency can be verified by evaluating pairing-product equations. As structure-preserving schemes smoothly interoperate with each other, they are useful as building blocks in modular design of cryptographic applications. This paper introduces structure-preserving commitment and signature schemes over bilinear groups with several desirable properties. The commitment schemes include homomorphic, trapdoor and length-reducing commitments to group elements, and the structure-preserving signature schemes are the first ones that yield constant-size signatures on multiple group elements. A structure-preserving signature scheme is called automorphic if the public keys lie in the message space, which cannot be achieved by compressing inputs via a cryptographic hash function, as this would destroy the mathematical structure we are trying to preserve. Automorphic signatures can be used for building certification chains underlying privacy-preserving protocols. Among a vast number of applications of structure-preserving protocols, we present an efficient round-optimal blind-signature scheme and a group signature scheme with an efficient and concurrently secure protocol for enrolling new members."}],"citation":{"apa":"Abe, M., Fuchsbauer, G., Groth, J., Haralambiev, K., & Ohkubo, M. (2016). Structure preserving signatures and commitments to group elements. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-014-9196-7","short":"M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, M. Ohkubo, Journal of Cryptology 29 (2016) 363–421.","ieee":"M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev, and M. Ohkubo, “Structure preserving signatures and commitments to group elements,” Journal of Cryptology, vol. 29, no. 2. Springer, pp. 363–421, 2016.","mla":"Abe, Masayuki, et al. “Structure Preserving Signatures and Commitments to Group Elements.” Journal of Cryptology, vol. 29, no. 2, Springer, 2016, pp. 363–421, doi:10.1007/s00145-014-9196-7.","chicago":"Abe, Masayuki, Georg Fuchsbauer, Jens Groth, Kristiyan Haralambiev, and Miyako Ohkubo. “Structure Preserving Signatures and Commitments to Group Elements.” Journal of Cryptology. Springer, 2016. https://doi.org/10.1007/s00145-014-9196-7.","ama":"Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. Structure preserving signatures and commitments to group elements. Journal of Cryptology. 2016;29(2):363-421. doi:10.1007/s00145-014-9196-7","ista":"Abe M, Fuchsbauer G, Groth J, Haralambiev K, Ohkubo M. 2016. Structure preserving signatures and commitments to group elements. Journal of Cryptology. 29(2), 363–421."}},{"page":"567 - 581","ec_funded":1,"acknowledgement":"This work was supported by the Boehringer Ingelheim Fonds, the European Research Council (ERC StG 281556), and a START Award of the Austrian Science Foundation (FWF). We thank Robert Hauschild, Anne Reversat, and Jack Merrin for valuable input and the Imaging Facility of IST Austria for excellent support.","volume":570,"month":"01","publication":"Methods in Enzymology","author":[{"first_name":"Jan","last_name":"Schwarz","full_name":"Schwarz, Jan","id":"346C1EC6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt"}],"status":"public","publist_id":"5573","date_updated":"2025-09-18T11:02:13Z","intvolume":" 570","corr_author":"1","abstract":[{"text":"Chemokines are the main guidance cues directing leukocyte migration. Opposed to early assumptions, chemokines do not necessarily act as soluble cues but are often immobilized within tissues, e.g., dendritic cell migration toward lymphatic vessels is guided by a haptotactic gradient of the chemokine CCL21. Controlled assay systems to quantitatively study haptotaxis in vitro are still missing. In this chapter, we describe an in vitro haptotaxis assay optimized for the unique properties of dendritic cells. The chemokine CCL21 is immobilized in a bioactive state, using laser-assisted protein adsorption by photobleaching. The cells follow this immobilized CCL21 gradient in a haptotaxis chamber, which provides three dimensionally confined migration conditions.","lang":"eng"}],"citation":{"ista":"Schwarz J, Sixt MK. 2016. Quantitative analysis of dendritic cell haptotaxis. Methods in Enzymology. 570, 567–581.","chicago":"Schwarz, Jan, and Michael K Sixt. “Quantitative Analysis of Dendritic Cell Haptotaxis.” Methods in Enzymology. Elsevier, 2016. https://doi.org/10.1016/bs.mie.2015.11.004.","ama":"Schwarz J, Sixt MK. Quantitative analysis of dendritic cell haptotaxis. Methods in Enzymology. 2016;570:567-581. doi:10.1016/bs.mie.2015.11.004","apa":"Schwarz, J., & Sixt, M. K. (2016). Quantitative analysis of dendritic cell haptotaxis. Methods in Enzymology. Elsevier. https://doi.org/10.1016/bs.mie.2015.11.004","short":"J. Schwarz, M.K. Sixt, Methods in Enzymology 570 (2016) 567–581.","ieee":"J. Schwarz and M. K. Sixt, “Quantitative analysis of dendritic cell haptotaxis,” Methods in Enzymology, vol. 570. Elsevier, pp. 567–581, 2016.","mla":"Schwarz, Jan, and Michael K. Sixt. “Quantitative Analysis of Dendritic Cell Haptotaxis.” Methods in Enzymology, vol. 570, Elsevier, 2016, pp. 567–81, doi:10.1016/bs.mie.2015.11.004."},"date_published":"2016-01-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Quantitative analysis of dendritic cell haptotaxis","article_processing_charge":"No","type":"journal_article","pmid":1,"external_id":{"pmid":["26921962"],"isi":["000375648700025"]},"day":"01","publisher":"Elsevier","publication_status":"published","year":"2016","department":[{"_id":"MiSi"}],"date_created":"2018-12-11T11:52:56Z","isi":1,"project":[{"name":"Cytoskeletal force generation and force transduction of migrating leukocytes","_id":"25A603A2-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"281556"},{"call_identifier":"FWF","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","grant_number":"Y 564-B12"}],"quality_controlled":"1","acknowledged_ssus":[{"_id":"Bio"}],"doi":"10.1016/bs.mie.2015.11.004","scopus_import":"1","oa_version":"None","_id":"1597","article_type":"original","language":[{"iso":"eng"}]},{"quality_controlled":"1","project":[{"grant_number":"281556","call_identifier":"FP7","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","_id":"25A603A2-B435-11E9-9278-68D0E5697425"},{"grant_number":"289720","call_identifier":"FP7","name":"Stromal Cell-immune Cell Interactions in Health and Disease","_id":"25A76F58-B435-11E9-9278-68D0E5697425"},{"grant_number":"Y 564-B12","call_identifier":"FWF","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","_id":"25A8E5EA-B435-11E9-9278-68D0E5697425"}],"isi":1,"date_created":"2018-12-11T11:52:57Z","language":[{"iso":"eng"}],"article_type":"original","scopus_import":"1","oa_version":"Submitted Version","_id":"1599","doi":"10.1126/science.aad0512","acknowledged_ssus":[{"_id":"SSU"}],"title":"Polysialylation controls dendritic cell trafficking by regulating chemokine recognition","article_processing_charge":"No","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MiSi"}],"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5583642/"}],"publisher":"American Association for the Advancement of Science","publication_status":"published","year":"2016","oa":1,"external_id":{"isi":["000367806500045"],"pmid":["26657283"]},"pmid":1,"day":"08","type":"journal_article","intvolume":" 351","date_updated":"2025-09-18T11:01:30Z","publist_id":"5570","date_published":"2016-01-08T00:00:00Z","citation":{"apa":"Kiermaier, E., Moussion, C., Veldkamp, C., Gerardy  Schahn, R., de Vries, I., Williams, L., … Sixt, M. K. (2016). Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. Science. American Association for the Advancement of Science. https://doi.org/10.1126/science.aad0512","ieee":"E. Kiermaier et al., “Polysialylation controls dendritic cell trafficking by regulating chemokine recognition,” Science, vol. 351, no. 6269. American Association for the Advancement of Science, pp. 186–190, 2016.","mla":"Kiermaier, Eva, et al. “Polysialylation Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” Science, vol. 351, no. 6269, American Association for the Advancement of Science, 2016, pp. 186–90, doi:10.1126/science.aad0512.","short":"E. Kiermaier, C. Moussion, C. Veldkamp, R. Gerardy  Schahn, I. de Vries, L. Williams, G. Chaffee, A. Phillips, F. Freiberger, R. Imre, D. Taleski, R. Payne, A. Braun, R. Förster, K. Mechtler, M. Mühlenhoff, B. Volkman, M.K. Sixt, Science 351 (2016) 186–190.","chicago":"Kiermaier, Eva, Christine Moussion, Christopher Veldkamp, Rita Gerardy  Schahn, Ingrid de Vries, Larry Williams, Gary Chaffee, et al. “Polysialylation Controls Dendritic Cell Trafficking by Regulating Chemokine Recognition.” Science. American Association for the Advancement of Science, 2016. https://doi.org/10.1126/science.aad0512.","ama":"Kiermaier E, Moussion C, Veldkamp C, et al. Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. Science. 2016;351(6269):186-190. doi:10.1126/science.aad0512","ista":"Kiermaier E, Moussion C, Veldkamp C, Gerardy  Schahn R, de Vries I, Williams L, Chaffee G, Phillips A, Freiberger F, Imre R, Taleski D, Payne R, Braun A, Förster R, Mechtler K, Mühlenhoff M, Volkman B, Sixt MK. 2016. Polysialylation controls dendritic cell trafficking by regulating chemokine recognition. Science. 351(6269), 186–190."},"abstract":[{"text":"The addition of polysialic acid to N- and/or O-linked glycans, referred to as polysialylation, is a rare posttranslational modification that is mainly known to control the developmental plasticity of the nervous system. Here we show that CCR7, the central chemokine receptor controlling immune cell trafficking to secondary lymphatic organs, carries polysialic acid. This modification is essential for the recognition of the CCR7 ligand CCL21. As a consequence, dendritic cell trafficking is abrogated in polysialyltransferase-deficient mice, manifesting as disturbed lymph node homeostasis and unresponsiveness to inflammatory stimuli. Structure-function analysis of chemokine-receptor interactions reveals that CCL21 adopts an autoinhibited conformation, which is released upon interaction with polysialic acid. Thus, we describe a glycosylation-mediated immune cell trafficking disorder and its mechanistic basis.\r\n","lang":"eng"}],"corr_author":"1","month":"01","volume":351,"acknowledgement":"We thank S. Schüchner and E. Ogris for kindly providing the antibody to GFP, M. Helmbrecht and A. Huber for providing Nrp2−/− mice, the IST Scientific Support Facilities for excellent services, and J. Renkawitz and K. Vaahtomeri for critically reading the manuscript. ","ec_funded":1,"page":"186 - 190","author":[{"first_name":"Eva","last_name":"Kiermaier","orcid":"0000-0001-6165-5738","full_name":"Kiermaier, Eva","id":"3EB04B78-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Moussion","first_name":"Christine","full_name":"Moussion, Christine","id":"3356F664-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Veldkamp","first_name":"Christopher","full_name":"Veldkamp, Christopher"},{"full_name":"Gerardy Schahn, Rita","first_name":"Rita","last_name":"Gerardy Schahn"},{"full_name":"De Vries, Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","first_name":"Ingrid","last_name":"De Vries"},{"first_name":"Larry","last_name":"Williams","full_name":"Williams, Larry"},{"last_name":"Chaffee","first_name":"Gary","full_name":"Chaffee, Gary"},{"first_name":"Andrew","last_name":"Phillips","full_name":"Phillips, Andrew"},{"first_name":"Friedrich","last_name":"Freiberger","full_name":"Freiberger, Friedrich"},{"full_name":"Imre, Richard","last_name":"Imre","first_name":"Richard"},{"full_name":"Taleski, Deni","first_name":"Deni","last_name":"Taleski"},{"last_name":"Payne","first_name":"Richard","full_name":"Payne, Richard"},{"full_name":"Braun, Asolina","last_name":"Braun","first_name":"Asolina"},{"last_name":"Förster","first_name":"Reinhold","full_name":"Förster, Reinhold"},{"full_name":"Mechtler, Karl","last_name":"Mechtler","first_name":"Karl"},{"last_name":"Mühlenhoff","first_name":"Martina","full_name":"Mühlenhoff, Martina"},{"last_name":"Volkman","first_name":"Brian","full_name":"Volkman, Brian"},{"full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt"}],"status":"public","issue":"6269","publication":"Science"},{"_id":"1608","oa_version":"Preprint","scopus_import":"1","doi":"10.1007/s00023-015-0456-3","language":[{"iso":"eng"}],"isi":1,"date_created":"2018-12-11T11:53:00Z","quality_controlled":"1","project":[{"call_identifier":"FP7","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734"}],"day":"01","external_id":{"isi":["000377994000003"],"arxiv":["1501.04287"]},"oa":1,"type":"journal_article","main_file_link":[{"url":"http://arxiv.org/abs/1501.04287","open_access":"1"}],"department":[{"_id":"LaEr"}],"publication_status":"published","year":"2016","publisher":"Birkhäuser","arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","title":"Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel","abstract":[{"lang":"eng","text":"We show that the Anderson model has a transition from localization to delocalization at exactly 2 dimensional growth rate on antitrees with normalized edge weights which are certain discrete graphs. The kinetic part has a one-dimensional structure allowing a description through transfer matrices which involve some Schur complement. For such operators we introduce the notion of having one propagating channel and extend theorems from the theory of one-dimensional Jacobi operators that relate the behavior of transfer matrices with the spectrum. These theorems are then applied to the considered model. In essence, in a certain energy region the kinetic part averages the random potentials along shells and the transfer matrices behave similar as for a one-dimensional operator with random potential of decaying variance. At d dimensional growth for d>2 this effective decay is strong enough to obtain absolutely continuous spectrum, whereas for some uniform d dimensional growth with d<2 one has pure point spectrum in this energy region. At exactly uniform 2 dimensional growth also some singular continuous spectrum appears, at least at small disorder. As a corollary we also obtain a change from singular spectrum (d≤2) to absolutely continuous spectrum (d≥3) for random operators of the type rΔdr+λ on ℤd, where r is an orthogonal radial projection, Δd the discrete adjacency operator (Laplacian) on ℤd and λ a random potential. "}],"citation":{"ista":"Sadel C. 2016. Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. Annales Henri Poincare. 17(7), 1631–1675.","ama":"Sadel C. Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. Annales Henri Poincare. 2016;17(7):1631-1675. doi:10.1007/s00023-015-0456-3","chicago":"Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees and Spectral Theory for Operators with One Propagating Channel.” Annales Henri Poincare. Birkhäuser, 2016. https://doi.org/10.1007/s00023-015-0456-3.","short":"C. Sadel, Annales Henri Poincare 17 (2016) 1631–1675.","mla":"Sadel, Christian. “Anderson Transition at 2 Dimensional Growth Rate on Antitrees and Spectral Theory for Operators with One Propagating Channel.” Annales Henri Poincare, vol. 17, no. 7, Birkhäuser, 2016, pp. 1631–75, doi:10.1007/s00023-015-0456-3.","ieee":"C. Sadel, “Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel,” Annales Henri Poincare, vol. 17, no. 7. Birkhäuser, pp. 1631–1675, 2016.","apa":"Sadel, C. (2016). Anderson transition at 2 dimensional growth rate on antitrees and spectral theory for operators with one propagating channel. Annales Henri Poincare. Birkhäuser. https://doi.org/10.1007/s00023-015-0456-3"},"corr_author":"1","date_published":"2016-07-01T00:00:00Z","date_updated":"2025-09-18T11:00:43Z","publist_id":"5558","intvolume":" 17","publication":"Annales Henri Poincare","issue":"7","status":"public","author":[{"full_name":"Sadel, Christian","id":"4760E9F8-F248-11E8-B48F-1D18A9856A87","first_name":"Christian","orcid":"0000-0001-8255-3968","last_name":"Sadel"}],"page":"1631 - 1675","month":"07","ec_funded":1,"volume":17},{"arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","title":"CSP for binary conservative relational structures","external_id":{"arxiv":["1112.1099"],"isi":["000375422500006"]},"day":"01","oa":1,"type":"journal_article","main_file_link":[{"url":"http://arxiv.org/abs/1112.1099","open_access":"1"}],"department":[{"_id":"VlKo"}],"publication_status":"published","year":"2016","publisher":"Springer","isi":1,"date_created":"2018-12-11T11:53:01Z","quality_controlled":"1","_id":"1612","scopus_import":"1","oa_version":"Preprint","doi":"10.1007/s00012-015-0358-8","language":[{"iso":"eng"}],"page":"75 - 84","month":"02","volume":75,"issue":"1","publication":"Algebra Universalis","status":"public","author":[{"last_name":"Kazda","first_name":"Alexandr","full_name":"Kazda, Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2025-09-18T11:00:04Z","publist_id":"5554","intvolume":" 75","abstract":[{"text":"We prove that whenever A is a 3-conservative relational structure with only binary and unary relations,then the algebra of polymorphisms of A either has no Taylor operation (i.e.,CSP(A)is NP-complete),or it generates an SD(∧) variety (i.e.,CSP(A)has bounded width).","lang":"eng"}],"citation":{"ama":"Kazda A. CSP for binary conservative relational structures. Algebra Universalis. 2016;75(1):75-84. doi:10.1007/s00012-015-0358-8","chicago":"Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis. Springer, 2016. https://doi.org/10.1007/s00012-015-0358-8.","ieee":"A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1. Springer, pp. 75–84, 2016.","short":"A. Kazda, Algebra Universalis 75 (2016) 75–84.","mla":"Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:10.1007/s00012-015-0358-8.","apa":"Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis. Springer. https://doi.org/10.1007/s00012-015-0358-8","ista":"Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84."},"corr_author":"1","date_published":"2016-02-01T00:00:00Z"},{"date_created":"2018-12-11T11:53:03Z","isi":1,"quality_controlled":"1","doi":"10.1002/hipo.22550","_id":"1616","oa_version":"Published Version","scopus_import":"1","file_date_updated":"2020-07-14T12:45:07Z","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1098-1063"],"issn":["1050-9631"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","article_processing_charge":"No","title":"Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats","type":"journal_article","external_id":{"isi":["000374666700011"]},"day":"01","oa":1,"year":"2016","publication_status":"published","publisher":"Wiley","department":[{"_id":"PeJo"}],"publist_id":"5550","date_updated":"2025-09-18T10:58:31Z","intvolume":" 26","pubrep_id":"469","corr_author":"1","has_accepted_license":"1","abstract":[{"text":"The hippocampus plays a key role in learning and memory. Previous studies suggested that the main types of principal neurons, dentate gyrus granule cells (GCs), CA3 pyramidal neurons, and CA1 pyramidal neurons, differ in their activity pattern, with sparse firing in GCs and more frequent firing in CA3 and CA1 pyramidal neurons. It has been assumed but never shown that such different activity may be caused by differential synaptic excitation. To test this hypothesis, we performed high-resolution whole-cell patch-clamp recordings in anesthetized rats in vivo. In contrast to previous in vitro data, both CA3 and CA1 pyramidal neurons fired action potentials spontaneously, with a frequency of ∼3–6 Hz, whereas GCs were silent. Furthermore, both CA3 and CA1 cells primarily fired in bursts. To determine the underlying mechanisms, we quantitatively assessed the frequency of spontaneous excitatory synaptic input, the passive membrane properties, and the active membrane characteristics. Surprisingly, GCs showed comparable synaptic excitation to CA3 and CA1 cells and the highest ratio of excitation versus hyperpolarizing inhibition. Thus, differential synaptic excitation is not responsible for differences in firing. Moreover, the three types of hippocampal neurons markedly differed in their passive properties. While GCs showed the most negative membrane potential, CA3 pyramidal neurons had the highest input resistance and the slowest membrane time constant. The three types of neurons also differed in the active membrane characteristics. GCs showed the highest action potential threshold, but displayed the largest gain of the input-output curves. In conclusion, our results reveal that differential firing of the three main types of hippocampal principal neurons in vivo is not primarily caused by differences in the characteristics of the synaptic input, but by the distinct properties of synaptic integration and input-output transformation.","lang":"eng"}],"citation":{"mla":"Kowalski, Janina, et al. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” Hippocampus, vol. 26, no. 5, Wiley, 2016, pp. 668–82, doi:10.1002/hipo.22550.","short":"J. Kowalski, J. Gan, P.M. Jonas, A. Pernia-Andrade, Hippocampus 26 (2016) 668–682.","ieee":"J. Kowalski, J. Gan, P. M. Jonas, and A. Pernia-Andrade, “Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats,” Hippocampus, vol. 26, no. 5. Wiley, pp. 668–682, 2016.","apa":"Kowalski, J., Gan, J., Jonas, P. M., & Pernia-Andrade, A. (2016). Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. Wiley. https://doi.org/10.1002/hipo.22550","ama":"Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. 2016;26(5):668-682. doi:10.1002/hipo.22550","chicago":"Kowalski, Janina, Jian Gan, Peter M Jonas, and Alejandro Pernia-Andrade. “Intrinsic Membrane Properties Determine Hippocampal Differential Firing Pattern in Vivo in Anesthetized Rats.” Hippocampus. Wiley, 2016. https://doi.org/10.1002/hipo.22550.","ista":"Kowalski J, Gan J, Jonas PM, Pernia-Andrade A. 2016. Intrinsic membrane properties determine hippocampal differential firing pattern in vivo in anesthetized rats. Hippocampus. 26(5), 668–682."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)"},"date_published":"2016-05-01T00:00:00Z","page":"668 - 682","file":[{"content_type":"application/pdf","file_size":905348,"file_id":"5033","file_name":"IST-2016-469-v1+1_Kowalski_et_al-Hippocampus.pdf","checksum":"284b72b12fbe15474833ed3d4549f86b","relation":"main_file","date_created":"2018-12-12T10:13:47Z","access_level":"open_access","date_updated":"2020-07-14T12:45:07Z","creator":"system"}],"acknowledgement":"The authors thank Jose Guzman for critically reading prior versions of the manuscript. They also thank T. Asenov for\r\nengineering mechanical devices, A. Schlögl for efficient pro-gramming, F. Marr for technical assistance, and E. Kramberger for manuscript editing.","volume":26,"ddc":["570"],"month":"05","publication":"Hippocampus","issue":"5","status":"public","author":[{"full_name":"Kowalski, Janina","id":"3F3CA136-F248-11E8-B48F-1D18A9856A87","first_name":"Janina","last_name":"Kowalski"},{"id":"3614E438-F248-11E8-B48F-1D18A9856A87","full_name":"Gan, Jian","first_name":"Jian","last_name":"Gan"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","first_name":"Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"},{"full_name":"Pernia-Andrade, Alejandro","id":"36963E98-F248-11E8-B48F-1D18A9856A87","last_name":"Pernia-Andrade","first_name":"Alejandro"}]},{"citation":{"ama":"Pausinger F, Steinerberger S. On the discrepancy of jittered sampling. Journal of Complexity. 2016;33:199-216. doi:10.1016/j.jco.2015.11.003","chicago":"Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered Sampling.” Journal of Complexity. Academic Press, 2016. https://doi.org/10.1016/j.jco.2015.11.003.","mla":"Pausinger, Florian, and Stefan Steinerberger. “On the Discrepancy of Jittered Sampling.” Journal of Complexity, vol. 33, Academic Press, 2016, pp. 199–216, doi:10.1016/j.jco.2015.11.003.","ieee":"F. Pausinger and S. Steinerberger, “On the discrepancy of jittered sampling,” Journal of Complexity, vol. 33. Academic Press, pp. 199–216, 2016.","short":"F. Pausinger, S. Steinerberger, Journal of Complexity 33 (2016) 199–216.","apa":"Pausinger, F., & Steinerberger, S. (2016). On the discrepancy of jittered sampling. Journal of Complexity. Academic Press. https://doi.org/10.1016/j.jco.2015.11.003","ista":"Pausinger F, Steinerberger S. 2016. On the discrepancy of jittered sampling. Journal of Complexity. 33, 199–216."},"abstract":[{"text":"We study the discrepancy of jittered sampling sets: such a set P⊂ [0,1]d is generated for fixed m∈ℕ by partitioning [0,1]d into md axis aligned cubes of equal measure and placing a random point inside each of the N=md cubes. We prove that, for N sufficiently large, 1/10 d/N1/2+1/2d ≤EDN∗(P)≤ √d(log N) 1/2/N1/2+1/2d, where the upper bound with an unspecified constant Cd was proven earlier by Beck. Our proof makes crucial use of the sharp Dvoretzky-Kiefer-Wolfowitz inequality and a suitably taylored Bernstein inequality; we have reasons to believe that the upper bound has the sharp scaling in N. Additional heuristics suggest that jittered sampling should be able to improve known bounds on the inverse of the star-discrepancy in the regime N≳dd. We also prove a partition principle showing that every partition of [0,1]d combined with a jittered sampling construction gives rise to a set whose expected squared L2-discrepancy is smaller than that of purely random points.","lang":"eng"}],"date_published":"2016-04-01T00:00:00Z","publist_id":"5549","date_updated":"2025-09-18T10:57:52Z","intvolume":" 33","publication":"Journal of Complexity","author":[{"orcid":"0000-0002-8379-3768","last_name":"Pausinger","first_name":"Florian","full_name":"Pausinger, Florian","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Steinerberger, Stefan","first_name":"Stefan","last_name":"Steinerberger"}],"status":"public","page":"199 - 216","acknowledgement":"We are grateful to the referee whose suggestions greatly improved the quality and clarity of the exposition.","volume":33,"month":"04","doi":"10.1016/j.jco.2015.11.003","scopus_import":"1","oa_version":"Submitted Version","_id":"1617","language":[{"iso":"eng"}],"date_created":"2018-12-11T11:53:03Z","isi":1,"quality_controlled":"1","type":"journal_article","oa":1,"external_id":{"isi":["000370090400011"],"arxiv":["1510.00251"]},"day":"01","publisher":"Academic Press","year":"2016","publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1510.00251","open_access":"1"}],"department":[{"_id":"HeEd"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","arxiv":1,"title":"On the discrepancy of jittered sampling","article_processing_charge":"No"},{"isi":1,"date_created":"2018-12-11T11:53:04Z","quality_controlled":"1","oa_version":"Submitted Version","scopus_import":"1","_id":"1620","doi":"10.1007/s00220-015-2526-2","language":[{"iso":"eng"}],"arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"The external field dependence of the BCS critical temperature","article_processing_charge":"No","oa":1,"day":"01","external_id":{"isi":["000369965600006"],"arxiv":["1410.2352"]},"type":"journal_article","department":[{"_id":"RoSe"}],"main_file_link":[{"url":"http://arxiv.org/abs/1410.2352","open_access":"1"}],"publisher":"Springer","publication_status":"published","year":"2016","date_updated":"2025-09-18T10:57:14Z","publist_id":"5546","intvolume":" 342","citation":{"ista":"Frank R, Hainzl C, Seiringer R, Solovej J. 2016. The external field dependence of the BCS critical temperature. Communications in Mathematical Physics. 342(1), 189–216.","ama":"Frank R, Hainzl C, Seiringer R, Solovej J. The external field dependence of the BCS critical temperature. Communications in Mathematical Physics. 2016;342(1):189-216. doi:10.1007/s00220-015-2526-2","chicago":"Frank, Rupert, Christian Hainzl, Robert Seiringer, and Jan Solovej. “The External Field Dependence of the BCS Critical Temperature.” Communications in Mathematical Physics. Springer, 2016. https://doi.org/10.1007/s00220-015-2526-2.","mla":"Frank, Rupert, et al. “The External Field Dependence of the BCS Critical Temperature.” Communications in Mathematical Physics, vol. 342, no. 1, Springer, 2016, pp. 189–216, doi:10.1007/s00220-015-2526-2.","ieee":"R. Frank, C. Hainzl, R. Seiringer, and J. Solovej, “The external field dependence of the BCS critical temperature,” Communications in Mathematical Physics, vol. 342, no. 1. Springer, pp. 189–216, 2016.","short":"R. Frank, C. Hainzl, R. Seiringer, J. Solovej, Communications in Mathematical Physics 342 (2016) 189–216.","apa":"Frank, R., Hainzl, C., Seiringer, R., & Solovej, J. (2016). The external field dependence of the BCS critical temperature. Communications in Mathematical Physics. Springer. https://doi.org/10.1007/s00220-015-2526-2"},"abstract":[{"text":"We consider the Bardeen–Cooper–Schrieffer free energy functional for particles interacting via a two-body potential on a microscopic scale and in the presence of weak external fields varying on a macroscopic scale. We study the influence of the external fields on the critical temperature. We show that in the limit where the ratio between the microscopic and macroscopic scale tends to zero, the next to leading order of the critical temperature is determined by the lowest eigenvalue of the linearization of the Ginzburg–Landau equation.","lang":"eng"}],"date_published":"2016-02-01T00:00:00Z","page":"189 - 216","month":"02","volume":342,"acknowledgement":"The authors are grateful to I. M. Sigal for useful discussions. Financial support from the US National Science Foundation through Grants PHY-1347399 and DMS-1363432 (R.L.F.), from the Danish council for independent research and from ERC Advanced Grant 321029 (J.P.S.) is acknowledged.","publication":"Communications in Mathematical Physics","issue":"1","author":[{"full_name":"Frank, Rupert","first_name":"Rupert","last_name":"Frank"},{"full_name":"Hainzl, Christian","last_name":"Hainzl","first_name":"Christian"},{"full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521"},{"first_name":"Jan","last_name":"Solovej","full_name":"Solovej, Jan"}],"status":"public"},{"language":[{"iso":"eng"}],"oa_version":"Submitted Version","scopus_import":"1","_id":"1622","doi":"10.1007/s00205-015-0923-5","quality_controlled":"1","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"isi":1,"date_created":"2018-12-11T11:53:05Z","department":[{"_id":"RoSe"}],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1501.04570"}],"publisher":"Springer","publication_status":"published","year":"2016","oa":1,"day":"01","external_id":{"isi":["000368535400010"],"arxiv":["1501.04570"]},"type":"journal_article","title":"Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems","article_processing_charge":"No","arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2016-03-01T00:00:00Z","citation":{"ama":"Lundholm D, Nam P, Portmann F. Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. Archive for Rational Mechanics and Analysis. 2016;219(3):1343-1382. doi:10.1007/s00205-015-0923-5","chicago":"Lundholm, Douglas, Phan Nam, and Fabian Portmann. “Fractional Hardy–Lieb–Thirring and Related Inequalities for Interacting Systems.” Archive for Rational Mechanics and Analysis. Springer, 2016. https://doi.org/10.1007/s00205-015-0923-5.","ieee":"D. Lundholm, P. Nam, and F. Portmann, “Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems,” Archive for Rational Mechanics and Analysis, vol. 219, no. 3. Springer, pp. 1343–1382, 2016.","short":"D. Lundholm, P. Nam, F. Portmann, Archive for Rational Mechanics and Analysis 219 (2016) 1343–1382.","mla":"Lundholm, Douglas, et al. “Fractional Hardy–Lieb–Thirring and Related Inequalities for Interacting Systems.” Archive for Rational Mechanics and Analysis, vol. 219, no. 3, Springer, 2016, pp. 1343–82, doi:10.1007/s00205-015-0923-5.","apa":"Lundholm, D., Nam, P., & Portmann, F. (2016). Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. Archive for Rational Mechanics and Analysis. Springer. https://doi.org/10.1007/s00205-015-0923-5","ista":"Lundholm D, Nam P, Portmann F. 2016. Fractional Hardy–Lieb–Thirring and related Inequalities for interacting systems. Archive for Rational Mechanics and Analysis. 219(3), 1343–1382."},"abstract":[{"lang":"eng","text":"We prove analogues of the Lieb–Thirring and Hardy–Lieb–Thirring inequalities for many-body quantum systems with fractional kinetic operators and homogeneous interaction potentials, where no anti-symmetry on the wave functions is assumed. These many-body inequalities imply interesting one-body interpolation inequalities, and we show that the corresponding one- and many-body inequalities are actually equivalent in certain cases."}],"corr_author":"1","intvolume":" 219","date_updated":"2025-09-18T10:52:35Z","publist_id":"5542","author":[{"first_name":"Douglas","last_name":"Lundholm","full_name":"Lundholm, Douglas"},{"id":"404092F4-F248-11E8-B48F-1D18A9856A87","full_name":"Nam, Phan","last_name":"Nam","first_name":"Phan"},{"first_name":"Fabian","last_name":"Portmann","full_name":"Portmann, Fabian"}],"status":"public","issue":"3","publication":"Archive for Rational Mechanics and Analysis","month":"03","volume":219,"ec_funded":1,"acknowledgement":"We thank Jan Philip Solovej, Robert Seiringer and Vladimir Maz’ya for helpful discussions, as well as Rupert Frank\r\nand the anonymous referee for useful comments. Part of this work has been carried out during a visit at the Institut Mittag-Leffler (Stockholm). D.L. acknowledges financial support by the grant KAW 2010.0063 from the Knut and Alice Wallenberg Foundation and the Swedish Research Council grant no. 2013-4734. P.T.N. is supported by the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. 291734. F.P. acknowledges support from the ERC project no. 321029 “The\r\nmathematics of the structure of matter”.","page":"1343 - 1382"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Spread of pedigree versus genetic ancestry in spatially distributed populations","article_processing_charge":"No","type":"journal_article","oa":1,"day":"01","external_id":{"isi":["000372560000001"]},"publisher":"Academic Press","publication_status":"published","year":"2016","department":[{"_id":"NiBa"}],"date_created":"2018-12-11T11:53:08Z","isi":1,"project":[{"_id":"25B07788-B435-11E9-9278-68D0E5697425","name":"Limits to selection in biology and in evolutionary computation","call_identifier":"FP7","grant_number":"250152"}],"quality_controlled":"1","doi":"10.1016/j.tpb.2015.10.008","oa_version":"Published Version","scopus_import":"1","_id":"1631","file_date_updated":"2020-07-14T12:45:07Z","language":[{"iso":"eng"}],"page":"1 - 12","file":[{"date_updated":"2020-07-14T12:45:07Z","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:11:12Z","relation":"main_file","checksum":"6a65ba187994d4ad86c1c509e0ff482a","file_name":"IST-2016-465-v1+1_1-s2.0-S0040580915001094-main.pdf","file_id":"4865","file_size":1684043,"content_type":"application/pdf"}],"ddc":["576"],"ec_funded":1,"volume":108,"month":"04","publication":"Theoretical Population Biology","author":[{"last_name":"Kelleher","first_name":"Jerome","full_name":"Kelleher, Jerome"},{"full_name":"Etheridge, Alison","last_name":"Etheridge","first_name":"Alison"},{"first_name":"Amandine","last_name":"Véber","full_name":"Véber, Amandine"},{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"}],"status":"public","publist_id":"5524","date_updated":"2025-09-18T10:51:58Z","pubrep_id":"465","intvolume":" 108","has_accepted_license":"1","corr_author":"1","citation":{"apa":"Kelleher, J., Etheridge, A., Véber, A., & Barton, N. H. (2016). Spread of pedigree versus genetic ancestry in spatially distributed populations. Theoretical Population Biology. Academic Press. https://doi.org/10.1016/j.tpb.2015.10.008","short":"J. Kelleher, A. Etheridge, A. Véber, N.H. Barton, Theoretical Population Biology 108 (2016) 1–12.","ieee":"J. Kelleher, A. Etheridge, A. Véber, and N. H. Barton, “Spread of pedigree versus genetic ancestry in spatially distributed populations,” Theoretical Population Biology, vol. 108. Academic Press, pp. 1–12, 2016.","mla":"Kelleher, Jerome, et al. “Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.” Theoretical Population Biology, vol. 108, Academic Press, 2016, pp. 1–12, doi:10.1016/j.tpb.2015.10.008.","chicago":"Kelleher, Jerome, Alison Etheridge, Amandine Véber, and Nicholas H Barton. “Spread of Pedigree versus Genetic Ancestry in Spatially Distributed Populations.” Theoretical Population Biology. Academic Press, 2016. https://doi.org/10.1016/j.tpb.2015.10.008.","ama":"Kelleher J, Etheridge A, Véber A, Barton NH. Spread of pedigree versus genetic ancestry in spatially distributed populations. Theoretical Population Biology. 2016;108:1-12. doi:10.1016/j.tpb.2015.10.008","ista":"Kelleher J, Etheridge A, Véber A, Barton NH. 2016. Spread of pedigree versus genetic ancestry in spatially distributed populations. Theoretical Population Biology. 108, 1–12."},"abstract":[{"lang":"eng","text":"Ancestral processes are fundamental to modern population genetics and spatial structure has been the subject of intense interest for many years. Despite this interest, almost nothing is known about the distribution of the locations of pedigree or genetic ancestors. Using both spatially continuous and stepping-stone models, we show that the distribution of pedigree ancestors approaches a travelling wave, for which we develop two alternative approximations. The speed and width of the wave are sensitive to the local details of the model. After a short time, genetic ancestors spread far more slowly than pedigree ancestors, ultimately diffusing out with radius ## rather than spreading at constant speed. In contrast to the wave of pedigree ancestors, the spread of genetic ancestry is insensitive to the local details of the models."}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2016-04-01T00:00:00Z"},{"quality_controlled":"1","date_created":"2018-12-11T11:53:12Z","isi":1,"language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:08Z","doi":"10.1007/s00344-015-9553-2","_id":"1641","oa_version":"Preprint","scopus_import":"1","article_processing_charge":"No","title":"A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","year":"2016","publication_status":"published","publisher":"Springer","department":[{"_id":"JiFr"}],"type":"journal_article","day":"01","external_id":{"isi":["000376482300015"]},"oa":1,"intvolume":" 35","pubrep_id":"1001","publist_id":"5512","date_updated":"2025-09-18T10:51:26Z","date_published":"2016-06-01T00:00:00Z","has_accepted_license":"1","corr_author":"1","abstract":[{"text":"The plant hormone auxin (indole-3-acetic acid) is a major regulator of plant growth and development including embryo and root patterning, lateral organ formation and growth responses to environmental stimuli. Auxin is directionally transported from cell to cell by the action of specific auxin influx [AUXIN-RESISTANT1 (AUX1)] and efflux [PIN-FORMED (PIN)] transport regulators, whose polar, subcellular localizations are aligned with the direction of the auxin flow. Auxin itself regulates its own transport by modulation of the expression and subcellular localization of the auxin transporters. Increased auxin levels promote the transcription of PIN2 and AUX1 genes as well as stabilize PIN proteins at the plasma membrane, whereas prolonged auxin exposure increases the turnover of PIN proteins and their degradation in the vacuole. In this study, we applied a forward genetic approach, to identify molecular components playing a role in the auxin-mediated degradation. We generated EMS-mutagenized Arabidopsis PIN2::PIN2:GFP, AUX1::AUX1:YFP eir1aux1 populations and designed a screen for mutants with persistently strong fluorescent signals of the tagged PIN2 and AUX1 after prolonged treatment with the synthetic auxin 2,4-dichlorophenoxyacetic acid (2,4-D). This approach yielded novel auxin degradation mutants defective in trafficking and degradation of PIN2 and AUX1 proteins and established a role for auxin-mediated degradation in plant development.","lang":"eng"}],"citation":{"ama":"Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation. 2016;35(2):465-476. doi:10.1007/s00344-015-9553-2","chicago":"Zemová, Radka, Marta Zwiewka, Agnieszka Bielach, Hélène Robert, and Jiří Friml. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” Journal of Plant Growth Regulation. Springer, 2016. https://doi.org/10.1007/s00344-015-9553-2.","mla":"Zemová, Radka, et al. “A Forward Genetic Screen for New Regulators of Auxin Mediated Degradation of Auxin Transport Proteins in Arabidopsis Thaliana.” Journal of Plant Growth Regulation, vol. 35, no. 2, Springer, 2016, pp. 465–76, doi:10.1007/s00344-015-9553-2.","ieee":"R. Zemová, M. Zwiewka, A. Bielach, H. Robert, and J. Friml, “A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana,” Journal of Plant Growth Regulation, vol. 35, no. 2. Springer, pp. 465–476, 2016.","short":"R. Zemová, M. Zwiewka, A. Bielach, H. Robert, J. Friml, Journal of Plant Growth Regulation 35 (2016) 465–476.","apa":"Zemová, R., Zwiewka, M., Bielach, A., Robert, H., & Friml, J. (2016). A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation. Springer. https://doi.org/10.1007/s00344-015-9553-2","ista":"Zemová R, Zwiewka M, Bielach A, Robert H, Friml J. 2016. A forward genetic screen for new regulators of auxin mediated degradation of auxin transport proteins in Arabidopsis thaliana. Journal of Plant Growth Regulation. 35(2), 465–476."},"acknowledgement":"European Social Fund (CZ.1.07/2.3.00/20.0043) and the Czech Science Foundation GAČR (GA13-40637S) to JF. ","volume":35,"ddc":["581"],"month":"06","page":"465 - 476","file":[{"checksum":"0dc6a300cde6536ceedd2bcdd2060efb","relation":"main_file","date_created":"2018-12-12T10:08:34Z","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:45:08Z","content_type":"application/pdf","file_size":5637591,"file_id":"4695","file_name":"IST-2018-1001-v1+1_Zemova_JPlantGrowthRegul_2016_proofs.pdf"}],"status":"public","author":[{"full_name":"Zemová, Radka","first_name":"Radka","last_name":"Zemová"},{"first_name":"Marta","last_name":"Zwiewka","full_name":"Zwiewka, Marta"},{"first_name":"Agnieszka","last_name":"Bielach","full_name":"Bielach, Agnieszka"},{"full_name":"Robert, Hélène","last_name":"Robert","first_name":"Hélène"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","first_name":"Jirí","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"publication":"Journal of Plant Growth Regulation","issue":"2"},{"page":"121 - 145","file":[{"file_id":"4923","file_name":"IST-2016-677-v1+1_869.pdf","content_type":"application/pdf","file_size":580088,"date_created":"2018-12-12T10:12:05Z","access_level":"open_access","creator":"system","date_updated":"2020-07-14T12:45:08Z","checksum":"a57711cb660c5b17b42bb47275a00180","relation":"main_file"}],"volume":9452,"ec_funded":1,"ddc":["000"],"month":"01","alternative_title":["LNCS"],"status":"public","author":[{"last_name":"Okamoto","first_name":"Tatsuaki","full_name":"Okamoto, Tatsuaki"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Waters, Brent","first_name":"Brent","last_name":"Waters"},{"first_name":"Daniel","last_name":"Wichs","full_name":"Wichs, Daniel"}],"publist_id":"5497","date_updated":"2025-09-23T09:40:30Z","intvolume":" 9452","pubrep_id":"677","has_accepted_license":"1","abstract":[{"lang":"eng","text":"A somewhere statistically binding (SSB) hash, introduced by Hubáček and Wichs (ITCS ’15), can be used to hash a long string x to a short digest y = H hk (x) using a public hashing-key hk. Furthermore, there is a way to set up the hash key hk to make it statistically binding on some arbitrary hidden position i, meaning that: (1) the digest y completely determines the i’th bit (or symbol) of x so that all pre-images of y have the same value in the i’th position, (2) it is computationally infeasible to distinguish the position i on which hk is statistically binding from any other position i’. Lastly, the hash should have a local opening property analogous to Merkle-Tree hashing, meaning that given x and y = H hk (x) it should be possible to create a short proof π that certifies the value of the i’th bit (or symbol) of x without having to provide the entire input x. A similar primitive called a positional accumulator, introduced by Koppula, Lewko and Waters (STOC ’15) further supports dynamic updates of the hashed value. These tools, which are interesting in their own right, also serve as one of the main technical components in several recent works building advanced applications from indistinguishability obfuscation (iO).\r\n\r\nThe prior constructions of SSB hashing and positional accumulators required fully homomorphic encryption (FHE) and iO respectively. In this work, we give new constructions of these tools based on well studied number-theoretic assumptions such as DDH, Phi-Hiding and DCR, as well as a general construction from lossy/injective functions."}],"citation":{"ista":"Okamoto T, Pietrzak KZ, Waters B, Wichs D. 2016. New realizations of somewhere statistically binding hashing and positional accumulators. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 9452, 121–145.","ieee":"T. Okamoto, K. Z. Pietrzak, B. Waters, and D. Wichs, “New realizations of somewhere statistically binding hashing and positional accumulators,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand, 2016, vol. 9452, pp. 121–145.","short":"T. Okamoto, K.Z. Pietrzak, B. Waters, D. Wichs, in:, Springer, 2016, pp. 121–145.","mla":"Okamoto, Tatsuaki, et al. New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators. Vol. 9452, Springer, 2016, pp. 121–45, doi:10.1007/978-3-662-48797-6_6.","apa":"Okamoto, T., Pietrzak, K. Z., Waters, B., & Wichs, D. (2016). New realizations of somewhere statistically binding hashing and positional accumulators (Vol. 9452, pp. 121–145). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Auckland, New Zealand: Springer. https://doi.org/10.1007/978-3-662-48797-6_6","ama":"Okamoto T, Pietrzak KZ, Waters B, Wichs D. New realizations of somewhere statistically binding hashing and positional accumulators. In: Vol 9452. Springer; 2016:121-145. doi:10.1007/978-3-662-48797-6_6","chicago":"Okamoto, Tatsuaki, Krzysztof Z Pietrzak, Brent Waters, and Daniel Wichs. “New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators,” 9452:121–45. Springer, 2016. https://doi.org/10.1007/978-3-662-48797-6_6."},"conference":{"end_date":"2015-12-03","start_date":"2015-11-29","location":"Auckland, New Zealand","name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"date_published":"2016-01-08T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"No","title":"New realizations of somewhere statistically binding hashing and positional accumulators","type":"conference","day":"08","external_id":{"isi":["000375148100006"]},"oa":1,"year":"2016","publication_status":"published","publisher":"Springer","department":[{"_id":"KrPi"}],"date_created":"2018-12-11T11:53:16Z","isi":1,"project":[{"call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","name":"Provable Security for Physical Cryptography","grant_number":"259668"}],"quality_controlled":"1","doi":"10.1007/978-3-662-48797-6_6","_id":"1653","oa_version":"Submitted Version","scopus_import":"1","file_date_updated":"2020-07-14T12:45:08Z","language":[{"iso":"eng"}]},{"date_updated":"2025-09-18T10:50:19Z","publist_id":"5431","intvolume":" 18","pubrep_id":"457","citation":{"chicago":"Bogomolov, Sergiy, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor Johnson, Hamed Ladan, Andreas Podelski, and Martin Wehrle. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.” International Journal on Software Tools for Technology Transfer. Springer, 2016. https://doi.org/10.1007/s10009-015-0393-y.","ama":"Bogomolov S, Donzé A, Frehse G, et al. Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. 2016;18(4):449-467. doi:10.1007/s10009-015-0393-y","apa":"Bogomolov, S., Donzé, A., Frehse, G., Grosu, R., Johnson, T., Ladan, H., … Wehrle, M. (2016). Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. Springer. https://doi.org/10.1007/s10009-015-0393-y","ieee":"S. Bogomolov et al., “Guided search for hybrid systems based on coarse-grained space abstractions,” International Journal on Software Tools for Technology Transfer, vol. 18, no. 4. Springer, pp. 449–467, 2016.","short":"S. Bogomolov, A. Donzé, G. Frehse, R. Grosu, T. Johnson, H. Ladan, A. Podelski, M. Wehrle, International Journal on Software Tools for Technology Transfer 18 (2016) 449–467.","mla":"Bogomolov, Sergiy, et al. “Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.” International Journal on Software Tools for Technology Transfer, vol. 18, no. 4, Springer, 2016, pp. 449–67, doi:10.1007/s10009-015-0393-y.","ista":"Bogomolov S, Donzé A, Frehse G, Grosu R, Johnson T, Ladan H, Podelski A, Wehrle M. 2016. Guided search for hybrid systems based on coarse-grained space abstractions. International Journal on Software Tools for Technology Transfer. 18(4), 449–467."},"abstract":[{"text":"Hybrid systems represent an important and powerful formalism for modeling real-world applications such as embedded systems. A verification tool like SpaceEx is based on the exploration of a symbolic search space (the region space). As a verification tool, it is typically optimized towards proving the absence of errors. In some settings, e.g., when the verification tool is employed in a feedback-directed design cycle, one would like to have the option to call a version that is optimized towards finding an error trajectory in the region space. A recent approach in this direction is based on guided search. Guided search relies on a cost function that indicates which states are promising to be explored, and preferably explores more promising states first. In this paper, we propose an abstraction-based cost function based on coarse-grained space abstractions for guiding the reachability analysis. For this purpose, a suitable abstraction technique that exploits the flexible granularity of modern reachability analysis algorithms is introduced. The new cost function is an effective extension of pattern database approaches that have been successfully applied in other areas. The approach has been implemented in the SpaceEx model checker. The evaluation shows its practical potential.","lang":"eng"}],"corr_author":"1","has_accepted_license":"1","date_published":"2016-08-01T00:00:00Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"relation":"main_file","checksum":"31561d7705599a9bd4ea816accc0752e","date_updated":"2020-07-14T12:45:13Z","creator":"system","date_created":"2018-12-12T10:15:26Z","access_level":"open_access","file_size":2296522,"content_type":"application/pdf","file_name":"IST-2016-457-v1+1_s10009-015-0393-y.pdf","file_id":"5146"}],"page":"449 - 467","month":"08","volume":18,"ec_funded":1,"ddc":["000"],"issue":"4","publication":"International Journal on Software Tools for Technology Transfer","status":"public","author":[{"full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0686-0365","last_name":"Bogomolov","first_name":"Sergiy"},{"last_name":"Donzé","first_name":"Alexandre","full_name":"Donzé, Alexandre"},{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"full_name":"Grosu, Radu","first_name":"Radu","last_name":"Grosu"},{"full_name":"Johnson, Taylor","last_name":"Johnson","first_name":"Taylor"},{"first_name":"Hamed","last_name":"Ladan","full_name":"Ladan, Hamed"},{"full_name":"Podelski, Andreas","last_name":"Podelski","first_name":"Andreas"},{"last_name":"Wehrle","first_name":"Martin","full_name":"Wehrle, Martin"}],"isi":1,"date_created":"2018-12-11T11:53:34Z","quality_controlled":"1","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989"},{"grant_number":"Z211","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"_id":"1705","oa_version":"Published Version","scopus_import":"1","doi":"10.1007/s10009-015-0393-y","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:45:13Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_processing_charge":"Yes (via OA deal)","title":"Guided search for hybrid systems based on coarse-grained space abstractions","day":"01","external_id":{"isi":["000379708300007"]},"oa":1,"type":"journal_article","department":[{"_id":"ToHe"}],"year":"2016","publication_status":"published","publisher":"Springer"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","title":"Optimal geospatial allocation of volunteers for crisis management","article_number":"7402041","acknowledgement":"The DRIVER FP7 project has received funding from the European Unions Seventh Framework Programme for research, technological development and demonstration under grant agreement no 607798. RE-ACTA was funded within the framework of the Austrian Security Research Programme KIRAS by the Federal Ministry for Transport, Innovation and Technology.","month":"02","type":"conference","day":"11","publisher":"IEEE","publication_status":"published","year":"2016","author":[{"full_name":"Pielorz, Jasmin","id":"49BC895A-F248-11E8-B48F-1D18A9856A87","last_name":"Pielorz","first_name":"Jasmin"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"status":"public","department":[{"_id":"ChLa"}],"publist_id":"5429","date_created":"2018-12-11T11:53:35Z","date_updated":"2021-01-12T06:52:39Z","quality_controlled":"1","doi":"10.1109/ICT-DM.2015.7402041","scopus_import":1,"conference":{"start_date":"2015-11-30","end_date":"2015-12-02","location":"Rennes, France","name":"ICT-DM: Information and Communication Technologies for Disaster Management"},"oa_version":"None","citation":{"ista":"Pielorz J, Lampert C. 2016. Optimal geospatial allocation of volunteers for crisis management. ICT-DM: Information and Communication Technologies for Disaster Management, 7402041.","apa":"Pielorz, J., & Lampert, C. (2016). Optimal geospatial allocation of volunteers for crisis management. Presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France: IEEE. https://doi.org/10.1109/ICT-DM.2015.7402041","ieee":"J. Pielorz and C. Lampert, “Optimal geospatial allocation of volunteers for crisis management,” presented at the ICT-DM: Information and Communication Technologies for Disaster Management, Rennes, France, 2016.","mla":"Pielorz, Jasmin, and Christoph Lampert. Optimal Geospatial Allocation of Volunteers for Crisis Management. 7402041, IEEE, 2016, doi:10.1109/ICT-DM.2015.7402041.","short":"J. Pielorz, C. Lampert, in:, IEEE, 2016.","chicago":"Pielorz, Jasmin, and Christoph Lampert. “Optimal Geospatial Allocation of Volunteers for Crisis Management.” IEEE, 2016. https://doi.org/10.1109/ICT-DM.2015.7402041.","ama":"Pielorz J, Lampert C. Optimal geospatial allocation of volunteers for crisis management. In: IEEE; 2016. doi:10.1109/ICT-DM.2015.7402041"},"_id":"1707","abstract":[{"text":"Volunteer supporters play an important role in modern crisis and disaster management. In the times of mobile Internet devices, help from thousands of volunteers can be requested within a short time span, thus relieving professional helpers from minor chores or geographically spread-out tasks. However, the simultaneous availability of many volunteers also poses new problems. In particular, the volunteer efforts must be well coordinated, or otherwise situations might emerge in which too many idle volunteers at one location become more of a burden than a relief to the professionals.\r\nIn this work, we study the task of optimally assigning volunteers to selected locations, e.g. in order to perform regular measurements, to report on damage, or to distribute information or resources to the population in a crisis situation. We formulate the assignment tasks as an optimization problem and propose an effective and efficient solution procedure. Experiments on real data of the Team Österreich, consisting of over 36,000 Austrian volunteers, show the effectiveness and efficiency of our approach.","lang":"eng"}],"language":[{"iso":"eng"}],"date_published":"2016-02-11T00:00:00Z"}]