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