_id,doi,title
10374,10.1039/c7sc01965c,Scaling behaviour and rate-determining steps in filamentous self-assembly
10375,10.1039/c7sm00433h,Curvature variation controls particle aggregation on fluid vesicles
10416,10.1145/3158118,Optimal Dyck reachability for data-dependence and Alias analysis
10417,10.1145/3158119,Data-centric dynamic partial order reduction
10418,10.1145/3158121,A new proof rule for almost-sure termination
1061,10.1186/s12934-017-0645-5,Ethylene production with engineered Synechocystis sp PCC 6803 strains
1062,10.1113/JP273735,Low pH inf o boosts burst firing and catecholamine release by blocking TASK-1 and BK channels while preserving Cav1 channels in mouse chromaffin cells
1063,10.1111/evo.13191,"Evolutionary rescue in randomly mating, selfing, and clonal populations"
1065,10.1016/j.ipl.2017.02.003,Pushdown reachability with constant treewidth
1180,10.1016/j.aim.2016.12.026,Algebraic vertices of non-convex polyhedra
11829,10.4230/LIPICS.ITCS.2017.26,Conditional hardness for sensitivity problems
11831,10.4230/LIPICS.ESA.2017.44,Improved guarantees for vertex sparsification in planar graphs
11832,10.4230/LIPICS.ESA.2017.48,Dynamic clustering to minimize the sum of radii
11833,10.4230/LIPICS.ESA.2017.45,The power of vertex sparsifiers in dynamic graph algorithms
1187,10.1007/s00145-016-9247-3,Efficient authentication from hard learning problems
11873,10.1137/1.9781611974782.125,Local flow partitioning for faster edge connectivity
11874,10.1137/1.9781611974782.30,Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time
11903,10.1007/s00224-017-9759-8,Welfare maximization with friends-of-friends network externalities
1191,10.1007/s11538-016-0244-3,"Existence of traveling waves for the generalized F–KPP equation"
1192,10.1137/1.9781611974782.20,Even delta-matroids and the complexity of planar Boolean CSPs