DOI,IST REx ID,Research Group,Title of publication
10.1137/20m1378223,12563,UlWa,Topology and adjunction in promise constraint satisfaction
10.1137/21M1412918,12960,HeEd,"Tracing isomanifolds in Rd in time polynomial in d using Coxeter–Freudenthal–Kuhn triangulations"
10.1137/20M1375851,14364,DaAl,Why extension-based proofs fail
10.1137/21M1428649,14558,MoHe,Deterministic near-optimal approximation algorithms for dynamic set cover
10.1137/16m1097808,11886,,A deterministic almost-tight distributed algorithm for approximating single-source shortest paths
10.1137/18m1180335,11889,,Local flow partitioning for faster edge connectivity
10.1137/16m109332x,7412,VlKo,A local lemma for focused stochastical algorithms
10.1137/17m1152292,6672,,Anisotropic triangulations via discrete Riemannian Voronoi diagrams
10.1137/16m1093306,5975,VlKo,Commutativity in the algorithmic Lovász local lemma
10.1137/140998925,11890,,Deterministic fully dynamic data structures for vertex cover and matching
10.1137/140957299,11891,,Dynamic approximate all-pairs shortest paths: Breaking the O(mn) barrier and derandomization
10.1137/s0097539797327209,11892,,Maintaining minimum spanning forests in dynamic graphs
10.1137/s009753979732428x,11694,,Exploring unknown environments
10.1137/s0097539794263907,11893,,Improved data structures for fully dynamic biconnectivity
10.1137/S0097539790179919 ,4033,,Selecting heavily covered points
10.1137/0222077 ,4036,,Computing a face in an arrangement of line segments and related problems
10.1137/0222031,4041,,On the zone theorem for hyperplane arrangements
10.1137/0222036 ,4042,,A quadratic time algorithm for the minmax length triangulation
10.1137/0913058,4043,,An O(n^2 log n) time algorithm for the MinMax angle triangulation
10.1137/0220016 ,4051,,An O(n log^2 h) time algorithm for the three-dimensional convex hull problem