Henzinger, Monika H., et al. “Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture.”10.1145/2746539.2746609__47th Annual ACM Symposium on Theory of Computing, 21–30, Association for Computing Machinery, 2015, doi:10.1145/2746539.2746609.
LibreCat: https://research-explorer.ista.ac.at/record/11868
DOI: 10.1145/2746539.2746609
arXiv: 1511.06773

Bhattacharya, Sayan, et al. “Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams.”10.1145/2746539.2746592__47th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2015, pp. 173–82, doi:10.1145/2746539.2746592.
LibreCat: https://research-explorer.ista.ac.at/record/11869
DOI: 10.1145/2746539.2746592
arXiv: 1504.02268

Bhattacharya, Sayan, et al. “Welfare Maximization with Friends-of-Friends Network Externalities.”10.4230/LIPICS.STACS.2015.90__32nd International Symposium on Theoretical Aspects of Computer Science, vol. 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015, pp. 90–102, doi:10.4230/LIPICS.STACS.2015.90.
LibreCat: https://research-explorer.ista.ac.at/record/11837
DOI: 10.4230/LIPICS.STACS.2015.90

Henzinger, Monika H., and Veronika Loitzenbauer. “Truthful Unit-Demand Auctions with Budgets Revisited.”10.1016/j.tcs.2015.01.033__Theoretical Computer Science, vol. 573, Elsevier, 2015, pp. 1–15, doi:10.1016/j.tcs.2015.01.033.
LibreCat: https://research-explorer.ista.ac.at/record/11901
DOI: 10.1016/j.tcs.2015.01.033

Pieber, Bartholomäus, et al. “Continuous Flow Reduction of Artemisinic Acid Utilizing Multi-Injection Strategies-Closing the Gap towards a Fully Continuous Synthesis of Antimalarial Drugs.”10.1002/chem.201406439__Chemistry - A European Journal, vol. 21, no. 11, Wiley, 2015, pp. 4368–76, doi:10.1002/chem.201406439.
LibreCat: https://research-explorer.ista.ac.at/record/11962
DOI: 10.1002/chem.201406439
PMID: 25655090