DOI,IST REx ID,Research Group,Title of publication
10.1007/s00453-025-01306-y,19603,MaKw,Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound
10.1007/s00453-022-01027-6,12086,HeEd,A simple algorithm for higher-order Delaunay mosaics and alpha shapes
10.1007/s00453-023-01154-8,14043,MoHe,A combinatorial cut-toggling algorithm for solving Laplacian linear systems
10.1007/s00453-021-00905-9,8286,DaAl,Dynamic averaging load balancing on cycles
10.1007/s00453-020-00721-7,11674,,Dynamic clustering to minimize the sum of radii
10.1007/s00453-019-00630-4,11675,,Deterministic dynamic matching in O(1) update time
10.1007/s00453-015-0066-y,11676,,Maximizing a submodular function with viability constraints
10.1007/s00453-016-0212-1,1336,"NiBa,CaGu",Towards a runtime comparison of natural and artificial evolution
10.1007/pl00009268,11679,,"Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology"
10.1007/pl00009186,11680,,Average-case analysis of dynamic graph algorithms
10.1007/pl00009228,11681,,Lower bounds for fully dynamic connectivity problems in graphs
10.1007/BF01975867,4026,,Incremental topological flipping works for regular triangulations
10.1007/BF01955043,4027,,Lines in space: Combinatorics and algorithms
10.1007/bf01189067,11677,,Fully dynamic biconnectivity in graphs
10.1007/BF01182771,4038,,Algorithms for bichromatic line-segment problems and polyhedral terrains
10.1007/BF01377183,4039,,Ray shooting in polygons using geodesic triangulations
10.1007/BF01840404,4075,,Searching for empty convex polygons
10.1007/BF01840438,3580,,Edge-skeletons in arrangements with applications