DOI,IST REx ID,Title of publication
10.1145/3146550,11665,Sublinear-time maintenance of breadth-first spanning trees in partially dynamic networks
10.1007/s00453-015-0066-y,11676,Maximizing a submodular function with viability constraints
10.1007/s10260-016-0375-6,1168,D inf s optimality in copula models
10.1534/genetics.116.193946,1169,Spatial gene frequency waves under genotype dependent dispersal
10.1007/s00493-016-3308-y,1173,The Voronoi functional is maximized by the Delaunay triangulation in the plane
10.4230/LIPIcs.STACS.2017.57,1174,Lower bounds on key derivation for square-friendly applications
10.4230/LIPIcs.ITCS.2017.38,1175,Cumulative space in black-white pebbling and resolution
10.1109/EuroSP.2017.47,1176,Towards practical attacks on Argon2i and balloon hashing
10.1007/978-3-319-73117-9_3,11772,The state of the art in dynamic graph algorithms
10.1007/978-3-662-53641-4_7,1178,"Simulating auxiliary inputs, revisited"
10.1016/j.aim.2016.12.026,1180,Algebraic vertices of non-convex polyhedra
10.4230/LIPICS.ITCS.2017.26,11829,Conditional hardness for sensitivity problems
10.4230/LIPICS.ESA.2017.44,11831,Improved guarantees for vertex sparsification in planar graphs
10.4230/LIPICS.ESA.2017.48,11832,Dynamic clustering to minimize the sum of radii
10.4230/LIPICS.ESA.2017.45,11833,The power of vertex sparsifiers in dynamic graph algorithms
10.1007/s00145-016-9247-3,1187,Efficient authentication from hard learning problems
10.1137/1.9781611974782.125,11873,Local flow partitioning for faster edge connectivity
10.1137/1.9781611974782.30,11874,Fully dynamic approximate maximum matching and minimum vertex cover in o(log3 n) worst case update time
10.1007/s00224-017-9759-8,11903,Welfare maximization with friends-of-friends network externalities
10.1007/s11538-016-0244-3,1191,"Existence of traveling waves for the generalized F–KPP equation"