| 1992 | Sorting and/by Merging Finger Trees. | Alistair Moffat, Ola Petersson, Nicholas C. Wormald |
| 1992 | Competitive Analysis of the Round Robin Algorithm. | Tsuyoshi Matsumoto |
| 1992 | Generalized Assignment Problems. | Silvano Martello, Paolo Toth |
| 1992 | Generating Small Convergent Systems Can Be Extremely Hard. | Klaus Madlener, Friedrich Otto, Andrea Sattler-Klein |
| 1992 | On Symmetry of Information and Polynomial Time Invertibility. | Luc Longpr, Osamu Watanabe |
| 1992 | Approximating Vertices of a Convex Polygon with Grid Points in the Polygon. | Hsuan-Shih Lee, Ruei Chuan Chang |
| 1992 | Rectilinear Paths among Rectilinear Obstacles. | D. T. Lee |
| 1992 | Self-Adjusting Augmented Search Trees. | Tony W. Lau |
| 1992 | The Implicit Dictionary Problem Revisited. | Tak Wah Lam, Ka Hing Lee |
| 1992 | Computational and Statistical Indistinguishabilities. | Kaoru Kurosawa, Osamu Watanabe |
| 1992 | On Malign Input Distributions for Algorithms. | Kojiro Kobayashi |
| 1992 | Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. | Ton Kloks, Hans L. Bodlaender |
| 1992 | Selection Networks with 8 | Shuji Jimbo, Akira Maruoka |
| 1992 | On the Relationship among Constrained Geometric Structures. | Esther Jennings, Andrzej Lingas |
| 1992 | Routing Problems on the Mesh of Buses. | Kazuo Iwama, Eiji Miyano |
| 1992 | On the Complexity of Composite Numbers. | Toshiya Itoh, Kenji Horikawa |
| 1992 | How to Generate Realistic Sample Problems for Network Optimization. | Masao Iri |
| 1992 | The Application of the Searching over Separators Strategy to Solve Some NP-Complete Problems on Planar Graphs. | R. Z. Hwang, Richard C. T. Lee |
| 1992 | A Simple Test for the Consecutive Ones Property. | Wen-Lian Hsu |
| 1992 | Algorithms for Rectilinear Optimal Multicast Tree Problem. | Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung |
| 1992 | Fault-Tolerant Broadcasting in Binary Jumping Networks. | Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura |
| 1992 | Parallel and On-line Graph Coloring Algorithms. | Magns M. Halldrsson |
| 1992 | The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. | Koji Hakata, Hiroshi Imai |
| 1992 | Recognizing an Envelope of Lines in Linear Time. | Eric Guvremont, Jack Snoeyink |
| 1992 | Alhorithms for a Class of Min-Cut and Max-Cut Problem. | Teofilo F. Gonzalez, Toshio Murayama |