Sixt, M. K., &; Lämmermann, T. (2011). In vitro analysis of chemotactic leukocyte migration in 3D environments. Cell Migration. Springer.https://doi.org/10.1007/978-1-61779-207-6_11 
LibreCat: https://research-explorer.ista.ac.at/record/3505
DOI: 10.1007/978-1-61779-207-6_11

Palero, F., Guerao, G., Clark, P., &; Abello, P. (2011). Scyllarus arctus (Crustacea: Decapoda: Scyllaridae) final stage phyllosoma identified by DNA analysis, with morphological description. Journal of the Marine Biological Association of the United Kingdom. Cambridge University Press.https://doi.org/10.1017/S0025315410000287 
LibreCat: https://research-explorer.ista.ac.at/record/3784
DOI: 10.1017/S0025315410000287

Edelsbrunner, H., &; Kerber, M. (2011). Covering and packing with spheres by diagonal distortion in R^n. In C. Calude, G. Rozenberg, &; A. Salomaa (Eds.), Rainbow of Computer Science (Vol. 6570, pp. 20–35). Springer.https://doi.org/10.1007/978-3-642-19391-0_2 
LibreCat: https://research-explorer.ista.ac.at/record/3796
DOI: 10.1007/978-3-642-19391-0_2

Henzinger, T. A., Jobstmann, B., &; Wolf, V. (2011). Formalisms for specifying Markovian population models. IJFCS: International Journal of Foundations of Computer Science. World Scientific Publishing.https://doi.org/10.1142/S0129054111008441 
LibreCat: https://research-explorer.ista.ac.at/record/3381
DOI: 10.1142/S0129054111008441

Chatterjee, K., Henzinger, T. A., &; Prabhu, V. (2011). Timed parity games: Complexity and robustness. Logical Methods in Computer Science. International Federation of Computational Logic.https://doi.org/10.2168/LMCS-7(4:8)2011 
LibreCat: https://research-explorer.ista.ac.at/record/3315
DOI: 10.2168/LMCS-7(4:8)2011

Raveendran, K., Wojtan, C., &; Turk, G. (2011). Hybrid smoothed particle hydrodynamics. In S. Spencer (Ed.) (pp. 33–42). Presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Vancouver, Canada: ACM.https://doi.org/10.1145/2019406.2019411 
LibreCat: https://research-explorer.ista.ac.at/record/3298
DOI: 10.1145/2019406.2019411

Wojtan, C., Müller Fischer, M., &; Brochu, T. (2011). Liquid simulation with mesh-based surface tracking. Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Vancouver, BC, Canada: ACM.https://doi.org/10.1145/2037636.2037644 
LibreCat: https://research-explorer.ista.ac.at/record/3297
DOI: 10.1145/2037636.2037644

Lohse, K., Harrison, R., &; Barton, N. H. (2011). A general method for calculating likelihoods under the coalescent process. Genetics. Genetics Society of America.https://doi.org/10.1534/genetics.111.129569 
LibreCat: https://research-explorer.ista.ac.at/record/3290
DOI: 10.1534/genetics.111.129569

Zheng, Y., Gu, S., Edelsbrunner, H., Tomasi, C., &; Benfey, P. (2011). Detailed reconstruction of 3D plant root shape. Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126475 
LibreCat: https://research-explorer.ista.ac.at/record/3312
DOI: 10.1109/ICCV.2011.6126475

Chen, C., &; Edelsbrunner, H. (2011). Diffusion runs low on persistence fast. In Proceedings of the IEEE International Conference on Computer Vision. Barcelona, Spain: IEEE.https://doi.org/10.1109/ICCV.2011.6126271 
LibreCat: https://research-explorer.ista.ac.at/record/3313
DOI: 10.1109/ICCV.2011.6126271

Edelsbrunner, H. (n.d.). Alpha shapes - a survey. In R. van de Weygaert, G. Vegter, J. Ritzerveld, &; V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. Springer.
LibreCat: https://research-explorer.ista.ac.at/record/3311

Almagor, S., Boker, U., &; Kupferman, O. (2011). What’s decidable about weighted automatahttps://doi.org/10.1007/978-3-642-24372-1_37__(Vol. 6996, pp. 482–491). Presented at the ATVA: Automated Technology for Verification and Analysis, Taipei, Taiwan: Springer.https://doi.org/10.1007/978-3-642-24372-1_37 
LibreCat: https://research-explorer.ista.ac.at/record/3326
DOI: 10.1007/978-3-642-24372-1_37

Piskac, R., &; Wies, T. (2011). Decision procedures for automating termination proofs. In R. Jhala &; D. Schmidt (Eds.) (Vol. 6538, pp. 371–386). Presented at the VMCAI: Verification Model Checking and Abstract Interpretation, Texas, USA: Springer.https://doi.org/10.1007/978-3-642-18275-4_26 
LibreCat: https://research-explorer.ista.ac.at/record/3324
DOI: 10.1007/978-3-642-18275-4_26

Chatterjee, K., De Alfaro, L., &; Pritam, R. (2011). Magnifying lens abstraction for stochastic games with discounted and long-run average objectives. arXiv. ArXiv.
LibreCat: https://research-explorer.ista.ac.at/record/3339
arXiv: 1107.2132

Chatterjee, K., Henzinger, M. H., Joglekar, M., &; Nisarg, S. (2011). Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. In G. Gopalakrishnan &; S. Qadeer (Eds.) (Vol. 6806, pp. 260–276). Presented at the CAV: Computer Aided Verification, Snowbird, USA: Springer.https://doi.org/10.1007/978-3-642-22110-1_21 
LibreCat: https://research-explorer.ista.ac.at/record/3342
DOI: 10.1007/978-3-642-22110-1_21
arXiv: 1104.3348

Chatterjee, K., &; Fijalkow, N. (2011). Finitary languages (Vol. 6638, pp. 216–226). Presented at the LATA: Language and Automata Theory and Applications, Tarragona, Spain: Springer.https://doi.org/10.1007/978-3-642-21254-3_16 
LibreCat: https://research-explorer.ista.ac.at/record/3347
DOI: 10.1007/978-3-642-21254-3_16
arXiv: 1101.1727

Brázdil, T., Broeek, V., Chatterjee, K., Forejt, V., &; Kudera, A. (2011). Two views on multiple mean payoff objectives in Markov Decision Processes. Presented at the LICS: Logic in Computer Science, Toronto, Canada: IEEE.https://doi.org/10.1109/LICS.2011.10 
LibreCat: https://research-explorer.ista.ac.at/record/3346
DOI: 10.1109/LICS.2011.10

Chatterjee, K., &; Prabhu, V. (2011). Synthesis of memory efficient real time controllers for safety objectives (pp. 221–230). Presented at the HSCC: Hybrid Systems - Computation and Control, Chicago, USA: Springer.https://doi.org/10.1145/1967701.1967734 
LibreCat: https://research-explorer.ista.ac.at/record/3348
DOI: 10.1145/1967701.1967734

Chatterjee, K., &; Henzinger, M. H. (2011). Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification (pp. 1318–1336). Presented at the SODA: Symposium on Discrete Algorithms, San Francisco, SA, United States: SIAM.https://doi.org/10.1137/1.9781611973082.101 
LibreCat: https://research-explorer.ista.ac.at/record/3343
DOI: 10.1137/1.9781611973082.101

Boker, U., &; Henzinger, T. A. (2011). Determinizing discounted-sum automata (Vol. 12, pp. 82–96). Presented at the CSL: Computer Science Logic, Bergen, Norway: Springer.https://doi.org/10.4230/LIPIcs.CSL.2011.82 
LibreCat: https://research-explorer.ista.ac.at/record/3360
DOI: 10.4230/LIPIcs.CSL.2011.82