DOI,IST REx ID,Research Group,Title of publication
10.1016/j.ipl.2026.106663,22812,MoHe,Tight bounds on the performance of dynamic directed cutset data structures based on OMv
10.1016/j.ipl.2017.02.003,1065,"KrCh,HeEd",Pushdown reachability with constant treewidth
10.1016/j.ipl.2012.11.006,11759,,"Sponsored search, market equilibria, and the Hungarian Method"
10.1016/j.ipl.2010.11.022,11760,,Offline file assignments for online load balancing
10.1016/0020-0190(96)00079-8,11761,,On the number of small cuts in a graph
10.1016/0020-0190(92)90005-G,4517,,Sooner Is Safer Than Later
10.1016/0020-0190(92)90133-G,4048,,Optimal time bounds for some proximity problems in the plane
10.1016/0020-0190(87)90038-X,4094,,A tight lower bound on the size of visibility graphs
10.1016/0020-0190(87)90120-7,4101,,Zooming by repeated range detection
10.1016/0020-0190(86)90088-8,4099,,Halfplanar range search in linear space and O(n0.695) query time
10.1016/0020-0190(85)90107-3,4111,,Finding extreme-points in 3-dimensions and solving the post-office problem in the plane
10.1016/0020-0190(82)90090-4,4130,,Polygonal intersection searching
10.1016/0020-0190(81)90053-3,4132,,On the intersection of Orthogonal objects
