Henzinger MH, Krinninger S, Nanongkai D. 2014. Decremental single-source shortest paths on undirected graphs in near-linear total update time. 55th Annual Symposium on Foundations of Computer Science. FOCS: Annual Symposium on Foundations of Computer Science, 146–155.
LibreCat: https://research-explorer.ista.ac.at/record/11855
DOI: 10.1109/focs.2014.24
arXiv: 1402.0054

Henzinger MH, Krinninger S, Nanongkai D. 2014. Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs. 46th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 674–683.
LibreCat: https://research-explorer.ista.ac.at/record/11870
DOI: 10.1145/2591796.2591869
arXiv: 1504.07959

Henzinger MH, Krinninger S, Nanongkai D. 2014. A subquadratic-time algorithm for decremental single-source shortest paths. 25th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1053–1072.
LibreCat: https://research-explorer.ista.ac.at/record/11876
DOI: 10.1137/1.9781611973402.79

Bhattacharya S, Henzinger MH, Italiano GF. 2014. Deterministic fully dynamic data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.
LibreCat: https://research-explorer.ista.ac.at/record/11875
DOI: 10.1137/1.9781611973730.54
arXiv: 1412.1318

Waitukaitis SR, Lee V, Pierson J, Forman S, Jaeger H. 2014. Size-dependent same-material tribocharging in insulating grains. APS Physics, Physical Review Letters. 112(21), 218001.
LibreCat: https://research-explorer.ista.ac.at/record/119
DOI: 10.1103/PhysRevLett.112.218001
arXiv: 1309.2578

Hofbauer HF, Schopf FH, Schleifer H, Knittelfelder OL, Pieber B, Rechberger GN, Wolinski H, Gaspar ML, Kappe CO, Stadlmann J, Mechtler K, Zenz A, Lohner K, Tehlivets O, Henry SA, Kohlwein SD. 2014. Regulation of gene expression through a transcriptional repressor that senses acyl-chain length in membrane phospholipids. Developmental Cell. 29(6), 9-739.
LibreCat: https://research-explorer.ista.ac.at/record/11968
DOI: 10.1016/j.devcel.2014.04.025
PMID: 24960695

Chatterjee K, Henzinger MH, Krinninger S, Loitzenbauer V, Raskin M. 2014. Approximating the minimum cycle mean. Theoretical Computer Science. 547(C), 104–116.
LibreCat: https://research-explorer.ista.ac.at/record/1375
DOI: 10.1016/j.tcs.2014.06.031
arXiv: 1307.4473

Dragoi C, Henzinger TA, Veith H, Widder J, Zufferey D. 2014. A logic-based framework for verifying consensus algorithms. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 8318, 161–181.
LibreCat: https://research-explorer.ista.ac.at/record/1392
DOI: 10.1007/978-3-642-54013-4_10

Gordon A, Henzinger TA, Nori A, Rajamani S. 2014. Probabilistic programming. Proceedings of the on Future of Software Engineering. FOSE: Future of Software Engineering, 167–181.
LibreCat: https://research-explorer.ista.ac.at/record/1393
DOI: 10.1145/2593882.2593900

Bräunlich G, Hainzl C, Seiringer R. 2014. On the BCS gap equation for superfluid fermionic gases. Proceedings of the QMat Conference. QMath: Mathematical Results in Quantum Physics, 127–137.
LibreCat: https://research-explorer.ista.ac.at/record/1516
DOI: 10.1142/9789814618144_0007
arXiv: 1403.2563

Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.
LibreCat: https://research-explorer.ista.ac.at/record/1629
DOI: 10.1145/2591010

Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.
LibreCat: https://research-explorer.ista.ac.at/record/1643
DOI: 10.1007/978-3-319-10879-7_7

Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.
LibreCat: https://research-explorer.ista.ac.at/record/1702
DOI: 10.4204/EPTCS.169.5

Mongillo M, Spathis P, Katsaros G, De Franceschi S, Gentile P, Rurali R, Cartoixà X. 2014. PtSi clustering in silicon probed by transport spectroscopy. Physical Review X. 3(4).
LibreCat: https://research-explorer.ista.ac.at/record/1761
DOI: 10.1103/PhysRevX.3.041025

Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.
LibreCat: https://research-explorer.ista.ac.at/record/1816
DOI: 10.1142/S0218195914500034

Seiringer R. 2014. Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. Journal of Mathematical Physics. 55(7), 1.4881536.
LibreCat: https://research-explorer.ista.ac.at/record/1821
DOI: 10.1063/1.4881536

Risso V, Manssour Triedo F, Delgado Delgado A, Arco R, Barroso Deljesús A, Inglés Prieto Á, Godoy Ruiz R, Gavira J, Gaucher E, Ibarra Molero B, Sánchez Ruiz J. 2014. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. 32(2), 440–455.
LibreCat: https://research-explorer.ista.ac.at/record/1844
DOI: 10.1093/molbev/msu312

Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete &; Computational Geometry. 53(1), 64–79.
LibreCat: https://research-explorer.ista.ac.at/record/1842
DOI: 10.1007/s00454-014-9646-x

Guerrero P, Auzinger T, Wimmer M, Jeschke S. 2014. Partial shape matching using transformation parameter similarity. Computer Graphics Forum. 34(1), 239–252.
LibreCat: https://research-explorer.ista.ac.at/record/1854
DOI: 10.1111/cgf.12509

Sassi M, Ali O, Boudon F, Cloarec G, Abad U, Cellier C, Chen X, Gilles B, Milani P, Friml J, Vernoux T, Godin C, Hamant O, Traas J. 2014. An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. Current Biology. 24(19), 2335–2342.
LibreCat: https://research-explorer.ista.ac.at/record/1852
DOI: 10.1016/j.cub.2014.08.036