| 1994 | Resource Bounded Randomness and Weakly Complete Problems. | Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng |
| 1994 | On the Approximation of Largest Common Subtrees and Largest Common Point Sets. | Tatsuya Akutsu, Magns M. Halldrsson |
| 1994 | On Determining the Congruity of Point Sets in Higher Dimensions. | Tatsuya Akutsu |
| 1994 | Are Fibonacci Heaps Optimal? | Diab Abuaiadh, Jeffrey H. Kingston |
| 1993 | Recent Developments on the Approximability of Combinatorial Problems. | Mihalis Yannakakis |
| 1993 | Multicommodity Flows in Even, Planar Networks. | Karsten Weihe |
| 1993 | Plane Sweep Algorithms for the Polygonal Approximation Problems with Applications. | D. P. Wang, N. F. Huang, H. S. Chao, Richard C. T. Lee |
| 1993 | The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams. | Seiichiro Tani, Kiyoharu Hamaguchi, Shuzo Yajima |
| 1993 | Constructing Shortest Watchman Routes by Divide-and-Conquer. | Xuehou Tan, Tomio Hirata |
| 1993 | Finding Shortest Non-Crossing Rectilinear Paths in Plane Regions. | Jun-ya Takahashi, Hitoshi Suzuki, Takao Nishizeki |
| 1993 | On Quadratic Lattice Approximations. | Anand Srivastav, Peter Stangier |
| 1993 | Simple Combinatorial Gray Codes Constructed by Reversing Sublists. | Frank Ruskey |
| 1993 | Linear Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. | Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe |
| 1993 | On the Relationship among Cryptographic Physical Assumptions. | Tatsuaki Okamoto |
| 1993 | Mapping Dynamic Data and Algorithm Structures into Product Networks. | Sabine R. hring, Sajal K. Das |
| 1993 | On the Power of Reading and Writing Simultaneously in Parallel Computation. | Rolf Niedermeier, Peter Rossmanith |
| 1993 | Separating Complexity Classes Related to Bounded Alternating omega-Branching Programs. | Christoph Meinel, Stephan Waack |
| 1993 | An Introduction to Perpetual Gossiping. | Arthur L. Liestman, Dana S. Richards |
| 1993 | Separating Exponentially Ambiguous NFA from Polynomially Ambiguous NFA. | Hing Leung |
| 1993 | Randomized On-line Algorithms for the Page Replication Problem. | Hisashi Koga |
| 1993 | Treewidth of Circle Graphs. | Ton Kloks |
| 1993 | Double-Ended Binomial Queues. | C. M. Khoong, H. W. Leong |
| 1993 | On Horn Envelopes and Hypergraph Transversals. | Dimitris J. Kavvadias, Christos H. Papadimitriou, Martha Sideri |
| 1993 | Vehicle Scheduling on a Tree with Release and Handling Times. | Yoshiyuki Karuno, Hiroshi Nagamochi, Toshihide Ibaraki |
| 1993 | A Probabilistic Selection Network with Butterfly Networks. | Takahiro Ikeda |