Hon-Chan Chen, Yue-Li Wang A Linear Time Algorithm for Finding Depth-First Spanning Trees on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:1, pp:13-18 [Journal]

Marten van Dijk More Information Theoretical Inequalities to be Used in Secret Sharing? [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:1, pp:41-44 [Journal]

Zoran Ivkovic, Errol L. Lloyd Partially Dynamic bin Packing can be Solved Within 1 + \varepsilon in (Amortized) Polylogarithmic Time. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1997, v:63, n:1, pp:45-50 [Journal]