223 | -- | 265 | Raffaele Giancarlo, Roberto Grossi. Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms |
266 | -- | 286 | Nili Guttmann-Beck, Refael Hassin. Approximation Algorithms for Min-Max Tree Partition |
287 | -- | 309 | J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner. Designing Least-Cost Nonblocking Broadband Networks |
310 | -- | 324 | Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young. A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees |
325 | -- | 339 | Amihood Amir, Alberto Apostolico, Moshe Lewenstein. Inverse Pattern Matching |
340 | -- | 353 | Dany Breslauer, Tao Jiang, Zhigen Jiang. Rotations of Periodic Strings and Short Superstrings |
354 | -- | 379 | Amihood Amir, Gary Benson, Martin Farach. Optimal Two-Dimensional Compressed Matching |
380 | -- | 394 | R. Balasubramanian, Venkatesh Raman, G. Srinivasaragavan. Finding Scores in Tournaments |
395 | -- | 420 | O. Dubios, Yacine Boufkhad. A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae |