Curvature variation controls particle aggregation on fluid vesicles
A. Vahid, A. Sari, T. Idema, Soft Matter 13 (2017) 4924–4930.

Optimal Dyck reachability for data-dependence and Alias analysis
K. Chatterjee, B. Choudhary, A. Pavlogiannis, Proceedings of the ACM on Programming Languages 2 (2017).

Data-centric dynamic partial order reduction
M. Chalupa, K. Chatterjee, A. Pavlogiannis, N. Sinha, K. Vaidya, Proceedings of the ACM on Programming Languages 2 (2017).

A new proof rule for almost-sure termination
A. Mciver, C. Morgan, B.L. Kaminski, J.P. Katoen, Proceedings of the ACM on Programming Languages 2 (2017).

Ethylene production with engineered Synechocystis sp PCC 6803 strains
V. Veetil, A. Angermayr, K. Hellingwerf, Microbial Cell Factories 16 (2017).

Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK channels while preserving Ca channels in mouse chromaffin cells
L. Guarina, D.H. Vandael, V. Carabelli, E. Carbone, Journal of Physiology 595 (2017) 2587–2609.

Evolutionary rescue in randomly mating, selfing, and clonal populations
H. Uecker, Evolution 71 (2017) 845–858.

Pushdown reachability with constant treewidth
K. Chatterjee, G.F. Osang, Information Processing Letters 122 (2017) 25–29.

Algebraic vertices of non-convex polyhedra
A. Akopyan, I. Bárány, S. Robins, Advances in Mathematics 308 (2017) 627–644.

Conditional hardness for sensitivity problems
M.H. Henzinger, A. Lincoln, S. Neumann, V. Vassilevska Williams, in:, 8th Innovations in Theoretical Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Improved guarantees for vertex sparsification in planar graphs
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Dynamic clustering to minimize the sum of radii
M.H. Henzinger, D. Leniowski, C. Mathieu, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

The power of vertex sparsifiers in dynamic graph algorithms
G. Goranci, M.H. Henzinger, P. Peng, in:, 25th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017.

Efficient authentication from hard learning problems
E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.

Local flow partitioning for faster edge connectivity
M.H. Henzinger, S. Rao, D. Wang, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 1919–1938.

Fully dynamic approximate maximum matching and minimum vertex cover in o(lo n) worst case update time
S. Bhattacharya, M.H. Henzinger, D. Nanongkai, in:, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2017, pp. 470–489.

Welfare maximization with friends-of-friends network externalities
S. Bhattacharya, W. Dvoák, M.H. Henzinger, M. Starnberger, Theory of Computing Systems 61 (2017) 948–986.

Existence of traveling waves for the generalized F–KPP equation
R. Kollár, S. Novak, Bulletin of Mathematical Biology 79 (2017) 525–559.

Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.

Stochastic invariants for probabilistic termination
K. Chatterjee, P. Novotný, D. Zikelic, in:, ACM, 2017, pp. 145–160.