Pallottini, A., Ferrara, A., Pacucci, F., Gallerani, S., Salvadori, S., Schneider, R.,https://doi.org/10.1093/mnras/stv1795__Matthee, J. J. (2015). The brightest Ly;1 emitter: Pop III or black hole? Monthly Notices of the Royal Astronomical Society. Oxford University Press.https://doi.org/10.1093/mnras/stv1795 

Colini-Baldeschi, R., Leonardi, S., Henzinger, M. H., &; Starnberger, M. (2015). On multiple keyword sponsored search auctions with budgets. ACM Transactions on Economics and Computation. Association for Computing Machinery.https://doi.org/10.1145/2818357 

Dütting, P., Henzinger, M. H., &; Starnberger, M. (2015). Auctions for heterogeneous items and budget limits. ACM Transactions on Economics and Computation. Association for Computing Machinery.https://doi.org/10.1145/2818351 

Dütting, P., Henzinger, M. H., &; Weber, I. (2015). An expressive mechanism for auctions on the web. ACM Transactions on Economics and Computation. Association for Computing Machinery.https://doi.org/10.1145/2716312 

Cheung, Y. K., Henzinger, M. H., Hoefer, M., &; Starnberger, M. (2015). Combinatorial auctions with conflict-based externalities. In 11th International Conference on Web and Internet Economics (Vol. 9470, pp. 230–243). Amsterdam, Netherlands: Springer Nature.https://doi.org/10.1007/978-3-662-48995-6_17 

Ben-Zwi, O., Henzinger, M. H., &; Loitzenbauer, V. (2015). Ad exchange: Envy-free auctions with mediators. In 11th International Conference on Web and Internet Economics (Vol. 9470, pp. 104–117). Amsterdam, Netherlands: Springer Nature.https://doi.org/10.1007/978-3-662-48995-6_8 

Henzinger, M. H., Krinninger, S., &; Nanongkai, D. (2015). Improved algorithms for decremental single-source reachability on directed graphs. In 42nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 725–736). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47672-7_59 

Henzinger, M. H., Krinninger, S., &; Loitzenbauer, V. (2015). Finding 2-edge and 2-vertex strongly connected components in quadratic time. In 2nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 713–724). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47672-7_58 

Dvoák, W., &; Henzinger, M. H. (2015). Online ad assignment with an ad exchange. In 12th International Workshop of Approximation and Online Algorithms (Vol. 8952, pp. 156–167). Wroclaw, Poland: Springer Nature.https://doi.org/10.1007/978-3-319-18263-6_14 

Bhattacharya, S., Henzinger, M. H., &; Italiano, G. F. (2015). Design of dynamic algorithms via primal-dual method. In 42nd International Colloquium on Automata, Languages and Programming (Vol. 9134, pp. 206–218). Kyoto, Japan: Springer Nature.https://doi.org/10.1007/978-3-662-47672-7_17 

Chernomor, O., Minh, B. Q., Forest, F., Klaere, S., Ingram, T., Henzinger, M. H., &; von Haeseler, A. (2015). Split diversity in constrained conservation prioritization using integer linear programming. Methods in Ecology and Evolution. Wiley.https://doi.org/10.1111/2041-210x.12299 

Henzinger, M. H., Krinninger, S., Nanongkai, D., &; Saranurak, T. (2015). Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In 47th Annual ACM Symposium on Theory of Computing. Portland, OR, United States: Association for Computing Machinery.https://doi.org/10.1145/2746539.2746609 

Bhattacharya, S., Henzinger, M. H., Nanongkai, D., &; Tsourakakis, C. (2015). Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In 47th Annual ACM Symposium on Theory of Computing (pp. 173–182). Portland, OR, United States: Association for Computing Machinery.https://doi.org/10.1145/2746539.2746592 

Bhattacharya, S., Dvorák, W., Henzinger, M. H., &; Starnberger,https://doi.org/10.4230/LIPICS.STACS.2015.90__Martin. (2015). Welfare maximization with friends-of-friends network externalities. In 32nd International Symposium on Theoretical Aspects of Computer Science (Vol. 30, pp. 90–102). Garching, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.https://doi.org/10.4230/LIPICS.STACS.2015.90 

Henzinger, M. H., &; Loitzenbauer, V. (2015). Truthful unit-demand auctions with budgets revisited. Theoretical Computer Science. Elsevier.https://doi.org/10.1016/j.tcs.2015.01.033 

Pieber, B., Glasnov, T., &; Kappe, C. O. (2015). Continuous flow reduction of artemisinic acid utilizing multi-injection strategies-closing the gap towards a fully continuous synthesis of antimalarial drugs. Chemistry - A European Journal. Wiley.https://doi.org/10.1002/chem.201406439 

Salvador, C. E. M., Pieber, B., Neu, P. M., Torvisco, A., Kleber Z. Andrade, C., &; Kappe, C. O. (2015). A sequential Ugi multicomponent/Cu-catalyzed azide–alkyne cycloaddition approach for the continuous flow generation of cyclic peptoids. The Journal of Organic Chemistry. American Chemical Society.https://doi.org/10.1021/acs.joc.5b00445 

Pieber, B., &; Kappe, C. O. (2015). Aerobic oxidations in continuous flow. In T. Noël (Ed.), Organometallic Flow Chemistry (1st ed., Vol. 57, pp. 97–136). Cham: Springer Nature.https://doi.org/10.1007/3418_2015_133 

Lee, V., Waitukaitis, S. R., Miskin, M., &; Jaeger, H. (2015). Direct observation of particle interactions and clustering in charged granular streams. Nature Physics. Nature Publishing Group.https://doi.org/10.1038/nphys3396 

Waitukaitis, S. R., Menaut, R., Chen, B., &; Van Hecke, M. (2015). Origami multistability: From single vertices to metasheets. APS Physics, Physical Review Letters. American Physical Society.https://doi.org/10.1103/PhysRevLett.114.055503