FliPer: Classifying TESS pulsating stars
L.A. Bugnet, R.A. García, G.R. Davies, S. Mathur, O.J. Hall, B.M. Rendle, ArXiv (n.d.).

Practical minimum cut algorithms
M.H. Henzinger, A. Noe, C. Schulz, D. Strash, ACM Journal of Experimental Algorithmics 23 (2018) 1–22.

Incremental exact min-cut in polylogarithmic amortized update time
G. Goranci, M.H. Henzinger, M. Thorup, ACM Transactions on Algorithms 14 (2018).

Valuation compressions in VCG-based combinatorial auctions
P. Dütting, M.H. Henzinger, M. Starnberger, ACM Transactions on Economics and Computation 6 (2018).

Dynamic algorithms via the primal-dual method
S. Bhattacharya, M.H. Henzinger, G. Italiano, Information and Computation 261 (2018) 219–239.

Decremental single-source shortest paths on undirected graphs in near-linear total update time
M.H. Henzinger, S. Krinninger, D. Nanongkai, Journal of the ACM 65 (2018) 1–40.

A tree structure for dynamic facility location
G. Goranci, M.H. Henzinger, D. Leniowski, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Dynamic effective resistances and approximate schur complement on separable graphs
G. Goranci, M.H. Henzinger, P. Peng, in:, 26th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Dynamic algorithms for graph coloring
S. Bhattacharya, D. Chakrabarty, M.H. Henzinger, D. Nanongkai, in:, 29th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2018, pp. 1–20.

Practical minimum cut algorithms
M.H. Henzinger, A. Noe, C. Schulz, D. Strash, in:, 20th Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2018, pp. 48–61.

Deterministic fully dynamic data structures for vertex cover and matching
S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887.

Memetic graph clustering
S. Biedermann, M.H. Henzinger, C. Schulz, B. Schuster, in:, 17th International Symposium on Experimental Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.

Continuous heterogeneous photocatalysis in serial micro-batch reactors
B. Pieber, M. Shalom, M. Antonietti, P.H. Seeberger, K. Gilmore, Angewandte Chemie International Edition 57 (2018) 9976–9979.

CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds
K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transaction on Graphics 37 (2018).

Infinite-dimensional calculus under weak spatial regularity of the processes
F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826.

Distributionally linearizable data structures
D.-A. Alistarh, T.A. Brown, J. Kopinsky, J.Z. Li, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 133–142.

The transactional conflict problem
D.-A. Alistarh, S.K. Haider, R. Kübler, G. Nadiradze, in:, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures  - SPAA ’18, ACM Press, 2018, pp. 383–392.

The Big Match with a clock and a bit of memory
K.A. Hansen, R. Ibsen-Jensen, A. Neyman, in:, Proceedings of the 2018 ACM Conference on Economics and Computation  - EC ’18, ACM Press, 2018, pp. 149–150.

Bounds on the norm of Wigner-type random matrices
L. Erdös, P. Mühlbacher, Random Matrices: Theory and Applications (2018).

Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.