E. M. Hatch and M. Hetzer, “Linking micronuclei to chromosome fragmentation,” Cell, vol. 161, no. 7. Elsevier, pp. 1502–1504, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11073
DOI: 10.1016/j.cell.2015.06.005
PMID: 26091034

E. M. Hatch and M. Hetzer, “Chromothripsis,” Current Biology, vol. 25, no. 10. Elsevier, pp. -9, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11074
DOI: 10.1016/j.cub.2015.02.033
PMID: 25989073

D. Sobral et al., “Evidence for PopIII-like stellar populations in the most luminous Ly;1 emitters at the epoch of reionisation: Spectroscopic confirmation,” The Astrophysical Journal, vol. 808, no. 2. IOP Publishing, p. 139, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11519
DOI: 10.1088/0004-637X/808/2/139
arXiv: 1504.01734

D. Sobral et al., “CF-HiZELS, an c10 de emission-line survey with spectroscopic follow-up: H;1, [OIII] + H;2 and [OII] luminosity functions at z = 0.8, 1.4 and 2.2 ,” Monthly Notices of the Royal Astronomical Society, vol. 451, no. 3. Oxford University Press, pp. 2303–2323, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11580
DOI: 10.1093/mnras/stv1076
arXiv: 1502.06602

J. J. Matthee, D. Sobral, S. Santos, H. Röttgering, B. Darvish, and B. Mobasher, “Identification of the brightest Ly;1 emitters at z = 6.6: implications for the evolution of the luminosity function in the reionization era,” Monthly Notices of the Royal Astronomical Society, vol. 451, no. 1. Oxford University Press, pp. 400–417, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11581
DOI: 10.1093/mnras/stv947
arXiv: 1502.07355

A. Pallottini et al., “The brightest Ly;1 emitter: Pop III or black hole?,” Monthly Notices of the Royal Astronomical Society, vol. 453, no. 3. Oxford University Press, pp. 2465–2470, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11579
DOI: 10.1093/mnras/stv1795
arXiv: 1506.07173

R. Colini-Baldeschi, S. Leonardi, M. H. Henzinger, and M. Starnberger, “On multiple keyword sponsored search auctions with budgets,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11668
DOI: 10.1145/2818357

P. Dütting, M. H. Henzinger, and M. Starnberger, “Auctions for heterogeneous items and budget limits,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11669
DOI: 10.1145/2818351
arXiv: 1209.6448

P. Dütting, M. H. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” ACM Transactions on Economics and Computation, vol. 4, no. 1. Association for Computing Machinery, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11670
DOI: 10.1145/2716312

Y. K. Cheung, M. H. Henzinger, M. Hoefer, and M. Starnberger, “Combinatorial auctions with conflict-based externalities,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 230–243.
LibreCat: https://research-explorer.ista.ac.at/record/11774
DOI: 10.1007/978-3-662-48995-6_17
arXiv: 1509.09147

O. Ben-Zwi, M. H. Henzinger, and V. Loitzenbauer, “Ad exchange: Envy-free auctions with mediators,” in 11th International Conference on Web and Internet Economics, Amsterdam, Netherlands, 2015, vol. 9470, pp. 104–117.
LibreCat: https://research-explorer.ista.ac.at/record/11773
DOI: 10.1007/978-3-662-48995-6_8
arXiv: 1604.05562

M. H. Henzinger, S. Krinninger, and D. Nanongkai, “Improved algorithms for decremental single-source reachability on directed graphs,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 725–736.
LibreCat: https://research-explorer.ista.ac.at/record/11785
DOI: 10.1007/978-3-662-47672-7_59
arXiv: 1612.03856

M. H. Henzinger, S. Krinninger, and V. Loitzenbauer, “Finding 2-edge and 2-vertex strongly connected components in quadratic time,” in 2nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 713–724.
LibreCat: https://research-explorer.ista.ac.at/record/11787
DOI: 10.1007/978-3-662-47672-7_58
arXiv: 1412.6466

W. Dvoák and M. H. Henzinger, “Online ad assignment with an ad exchange,” in 12th International Workshop of Approximation and Online Algorithms, Wroclaw, Poland, 2015, vol. 8952, pp. 156–167.
LibreCat: https://research-explorer.ista.ac.at/record/11788
DOI: 10.1007/978-3-319-18263-6_14
arXiv: 1604.05603

S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Design of dynamic algorithms via primal-dual method,” in 42nd International Colloquium on Automata, Languages and Programming, Kyoto, Japan, 2015, vol. 9134, pp. 206–218.
LibreCat: https://research-explorer.ista.ac.at/record/11786
DOI: 10.1007/978-3-662-47672-7_17
arXiv: 1604.05337

O. Chernomor et al., “Split diversity in constrained conservation prioritization using integer linear programming,” Methods in Ecology and Evolution, vol. 6, no. 1. Wiley, pp. 83–91, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11845
DOI: 10.1111/2041-210x.12299
PMID: 25893087

M. H. Henzinger, S. Krinninger, D. Nanongkai, and T. Saranurak, “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, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11868
DOI: 10.1145/2746539.2746609
arXiv: 1511.06773

S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and C. Tsourakakis, “Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams,” in 47th Annual ACM Symposium on Theory of Computing, Portland, OR, United States, 2015, pp. 173–182.
LibreCat: https://research-explorer.ista.ac.at/record/11869
DOI: 10.1145/2746539.2746592
arXiv: 1504.02268

S. Bhattacharya, W. Dvorák, M. H. Henzinger, and  Martin Starnberger, “Welfare maximization with friends-of-friends network externalities,” in 32nd International Symposium on Theoretical Aspects of Computer Science, Garching, Germany, 2015, vol. 30, pp. 90–102.
LibreCat: https://research-explorer.ista.ac.at/record/11837
DOI: 10.4230/LIPICS.STACS.2015.90

M. H. Henzinger and V. Loitzenbauer, “Truthful unit-demand auctions with budgets revisited,” Theoretical Computer Science, vol. 573. Elsevier, pp. 1–15, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/11901
DOI: 10.1016/j.tcs.2015.01.033