Ibarra, Arkaitz, and Martin Hetzer. “Nuclear Pore Proteins and the Control of Genome Functions.”10.1101/gad.256495.114__Genes &; Development, vol. 29, no. 4, Cold Spring Harbor Laboratory, 2015, pp. 337–49, doi:10.1101/gad.256495.114.

Hatch, Emily M., and Martin Hetzer. “Linking Micronuclei to Chromosome Fragmentation.”10.1016/j.cell.2015.06.005__Cell, vol. 161, no. 7, Elsevier, 2015, pp. 1502–04, doi:10.1016/j.cell.2015.06.005.

Hatch, Emily M., and Martin Hetzer. “Chromothripsis.”10.1016/j.cub.2015.02.033__Current Biology, vol. 25, no. 10, Elsevier, 2015, pp. -9, doi:10.1016/j.cub.2015.02.033.

Sobral, David, et al. “Evidence for PopIII-like Stellar Populations in the Most Luminous Ly;1 Emitters at the Epoch of Reionisation: Spectroscopic Confirmation.”10.1088/0004-637X/808/2/139__The Astrophysical Journal, vol. 808, no. 2, IOP Publishing, 2015, p. 139, doi:10.1088/0004-637X/808/2/139.

Sobral, D., 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 .”10.1093/mnras/stv1076__Monthly Notices of the Royal Astronomical Society, vol. 451, no. 3, Oxford University Press, 2015, pp. 2303–23, doi:10.1093/mnras/stv1076.

Matthee, Jorryt J., et al. “Identification of the Brightest Ly;1 Emitters at z = 6.6: Implications for the Evolution of the Luminosity Function in the Reionization Era.”10.1093/mnras/stv947__Monthly Notices of the Royal Astronomical Society, vol. 451, no. 1, Oxford University Press, 2015, pp. 400–17, doi:10.1093/mnras/stv947.

Pallottini, A., et al. “The Brightest Ly;1 Emitter: Pop III or Black Hole?”10.1093/mnras/stv1795__Monthly Notices of the Royal Astronomical Society, vol. 453, no. 3, Oxford University Press, 2015, pp. 2465–70, doi:10.1093/mnras/stv1795.

Colini-Baldeschi, Riccardo, et al. “On Multiple Keyword Sponsored Search Auctions with Budgets.”10.1145/2818357__ACM Transactions on Economics and Computation, vol. 4, no. 1, 2, Association for Computing Machinery, 2015, doi:10.1145/2818357.

Dütting, Paul, et al. “Auctions for Heterogeneous Items and Budget Limits.”10.1145/2818351__ACM Transactions on Economics and Computation, vol. 4, no. 1, 4, Association for Computing Machinery, 2015, doi:10.1145/2818351.

Cheung, Yun Kuen, et al. “Combinatorial Auctions with Conflict-Based Externalities.”10.1007/978-3-662-48995-6_17__11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 230–243, doi:10.1007/978-3-662-48995-6_17.

Ben-Zwi, Oren, et al. “Ad Exchange: Envy-Free Auctions with Mediators.”10.1007/978-3-662-48995-6_8__11th International Conference on Web and Internet Economics, vol. 9470, Springer Nature, 2015, pp. 104–117, doi:10.1007/978-3-662-48995-6_8.

Henzinger, Monika H., et al. “Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs.”10.1007/978-3-662-47672-7_59__42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 725–36, doi:10.1007/978-3-662-47672-7_59.

Henzinger, Monika H., et al. “Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time.”10.1007/978-3-662-47672-7_58__2nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 713–24, doi:10.1007/978-3-662-47672-7_58.

Dvoák, Wolfgang, and Monika H. Henzinger. “Online Ad Assignment with an Ad Exchange.”10.1007/978-3-319-18263-6_14__12th International Workshop of Approximation and Online Algorithms, vol. 8952, Springer Nature, 2015, pp. 156–167, doi:10.1007/978-3-319-18263-6_14.

Bhattacharya, Sayan, et al. “Design of Dynamic Algorithms via Primal-Dual Method.”10.1007/978-3-662-47672-7_17__42nd International Colloquium on Automata, Languages and Programming, vol. 9134, Springer Nature, 2015, pp. 206–18, doi:10.1007/978-3-662-47672-7_17.

Chernomor, Olga, et al. “Split Diversity in Constrained Conservation Prioritization Using Integer Linear Programming.”10.1111/2041-210x.12299__Methods in Ecology and Evolution, vol. 6, no. 1, Wiley, 2015, pp. 83–91, doi:10.1111/2041-210x.12299.

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.

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.

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.

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.