_id,doi,title
14043,10.1007/s00453-023-01154-8,A combinatorial cut-toggling algorithm for solving Laplacian linear systems
12086,10.1007/s00453-022-01027-6,A simple algorithm for higher-order Delaunay mosaics and alpha shapes
8286,10.1007/s00453-021-00905-9,Dynamic averaging load balancing on cycles
11674,10.1007/s00453-020-00721-7,Dynamic clustering to minimize the sum of radii
11675,10.1007/s00453-019-00630-4,Deterministic dynamic matching in O(1) update time
11676,10.1007/s00453-015-0066-y,Maximizing a submodular function with viability constraints
11679,10.1007/pl00009268,"Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology"
11680,10.1007/pl00009186,Average-case analysis of dynamic graph algorithms
11681,10.1007/pl00009228,Lower bounds for fully dynamic connectivity problems in graphs
11677,10.1007/bf01189067,Fully dynamic biconnectivity in graphs
4075,10.1007/BF01840404,Searching for empty convex polygons
3580,10.1007/BF01840438,Edge-skeletons in arrangements with applications