| 1992 | A Simple Test for the Consecutive Ones Property. Wen-Lian Hsu |
| 1992 | Algorithms and Computation, Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992, Proceedings Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita |
| 1992 | Algorithms for Determining the Geometrical Congruity in Two and Three Dimensions. Tatsuya Akutsu |
| 1992 | Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs. Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
| 1992 | Algorithms for Rectilinear Optimal Multicast Tree Problem. Jan-Ming Ho, Ming-Tat Ko, Tze-Heng Ma, Ting-Yi Sung |
| 1992 | Alhorithms for a Class of Min-Cut and Max-Cut Problem. Teofilo F. Gonzalez, Toshio Murayama |
| 1992 | An Efficient Parallel Algorithm for Geometrically Characterising Drawings of a Class of 3-D Objects. Nick D. Dendris, Iannis A. Kalafatis, Lefteris M. Kirousis |
| 1992 | Approximating Treewidth and Pathwidth of some Classes of Perfect Graphs. Ton Kloks, Hans L. Bodlaender |
| 1992 | Approximating Vertices of a Convex Polygon with Grid Points in the Polygon. Hsuan-Shih Lee, Ruei Chuan Chang |
| 1992 | Approximation of Polygonal Curves with Minimum Number of Line Segments. W. S. Chan, F. Chin |
| 1992 | Boolean Circuit Complexity. Mike Paterson |
| 1992 | Characterizing and Recognizing Visibility Graphs of Funnel-Shaped Polygons. Seung-Hak Choi, Sung Yong Shin, Kyung-Yong Chwa |
| 1992 | Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-. Mizuhito Ogawa |
| 1992 | Competitive Analysis of the On-line Algorithms for Multiple Stacks Sysytems. Been-Chian Chien, Rong-Jaye Chen, Wei-Pang Yang |
| 1992 | Competitive Analysis of the Round Robin Algorithm. Tsuyoshi Matsumoto |
| 1992 | Computational and Statistical Indistinguishabilities. Kaoru Kurosawa, Osamu Watanabe |
| 1992 | Fault-Tolerant Broadcasting in Binary Jumping Networks. Yijie Han, Yoshihide Igarashi, Kumiko Kanai, Kinya Miura |
| 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 | Graph Spanners and Connectivity. Shuichi Ueno, Michihiro Yamazaki |
| 1992 | Higher Order Communication Processes with Value-Passing, Assignment and Return of Results. Dominique Bolignano, Mourad Debbabi |
| 1992 | Honest Iteration Schemes of Randomizing Algorithms. Jie Wang, Jay Belanger |
| 1992 | How to Generate Realistic Sample Problems for Network Optimization. Masao Iri |
| 1992 | Linear Time Algorithms for k-cutwidth Problem. Maw-Hwa Chen, Sing-Ling Lee |
| 1992 | Lowness and the Complexity of Sparse and Tally Descriptions. Vikraman Arvind, Johannes Köbler, Martin Mundhenk |
| 1992 | Methods in Parallel Algorithmics and Who May Need to Know Them? Uzi Vishkin |
| 1992 | On Malign Input Distributions for Algorithms. Kojiro Kobayashi |
| 1992 | On Probabilistic ACC Circuits with an Exact-Threshold Output Gate. Richard Beigel, Jun Tarui, Seinosuke Toda |
| 1992 | On Symmetric Differences of NP-hard Sets with Weakly-P-Selective Sets. Bin Fu, Hong-Zhou Li |
| 1992 | On Symmetry of Information and Polynomial Time Invertibility. Luc Longpré, Osamu Watanabe |
| 1992 | On the Complexity of Composite Numbers. Toshiya Itoh, Kenji Horikawa |
| 1992 | On the Relationship among Constrained Geometric Structures. Esther Jennings, Andrzej Lingas |
| 1992 | Parallel and On-line Graph Coloring Algorithms. Magnús M. Halldórsson |
| 1992 | Principal Lattice of Partition of submodular functions on Graphs: Fast algorithms for Principal Partition and Generic Rigidity. Sachin B. Patkar, H. Narayanan |
| 1992 | Randomized Range-Maxima inNearly-Constant Parallel Time. Omer Berkman, Yossi Matias, Uzi Vishkin |
| 1992 | Recognizing an Envelope of Lines in Linear Time. Eric Guévremont, Jack Snoeyink |
| 1992 | Rectilinear Paths among Rectilinear Obstacles. D. T. Lee |
| 1992 | Relativizations of the Ronald V. Book |
| 1992 | Routing Problems on the Mesh of Buses. Kazuo Iwama, Eiji Miyano |
| 1992 | Rstricted Track Assignment with Applications. Majid Sarrafzadeh, D. T. Lee |
| 1992 | Searching Informed Game Trees. Wim Pijls, Arie de Bruin |
| 1992 | Searching a Solid Pseudo 3-Sided Orthoconvex Grid. Antonios Symvonis, Spyros Tragoudas |
| 1992 | Selection Networks with 8 Shuji Jimbo, Akira Maruoka |
| 1992 | Self-Adjusting Augmented Search Trees. Tony W. Lau |
| 1992 | Sorting Klaus Reinhardt |
| 1992 | Sorting and/by Merging Finger Trees. Alistair Moffat, Ola Petersson, Nicholas C. Wormald |
| 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 | The Implicit Dictionary Problem Revisited. Tak Wah Lam, Ka Hing Lee |
| 1992 | The Longest Common Subsequence Problem for Small Alphabet Size Between Many Strings. Koji Hakata, Hiroshi Imai |
| 1992 | The k-Edge-Connectivity Augmentation Problem of Weighted Graphs. Toshimasa Watanabe, Toshiya Mashima, Satoshi Taoka |
| 1992 | Topologically Consistent Algorithms Realted to Convex Polyhedra. Kokichi Sugihara |
| 1992 | Wiring Knock-Knee Layouts: A Global Appoach. Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, Karsten Weihe |