DOI,IST REx ID,Title of publication
10.1016/j.jalgor.2004.11.001,11763,An online throughput-competitive algorithm for multicast routing and admission control
10.1016/s0196-6774(03)00054-3,11764,Scheduling data transfers in a network and the set scheduling problem
10.1006/jagm.1999.1055,11683,Computing vertex connectivity: New bounds from old techniques
10.1145/301250.301300,11691,Scheduling data transfers in a network and the set scheduling problem
10.1006/jagm.1997.0855,11765,A static 2-approximation algorithm for vertex connectivity and incremental approximation algorithms for edge and vertex connectivity
10.1016/0196-6774(87)90015-0,4102,Space searching for intersecting objects
10.1016/0196-6774(85)90030-6,4112,Batched dynamic solutions to decomposable searching problems
10.1016/0196-6774(85)90039-2,4115,Computing the extreme distances between two convex polygons