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