| 1995 | A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets. Siu-Wing Cheng, Chi-Keung Tang |
| 1995 | A Fast and Simple Algorithm for Identifying 2-Monotonic Positive Boolean Functions. Kazuhisa Makino, Toshihide Ibaraki |
| 1995 | A Fast and Space - Economical Algorithm for Length - Limited Coding. Jyrki Katajainen, Alistair Moffat, Andrew Turpin |
| 1995 | A Hard Problem That is Almost Always Easy. George Havas, Bohdan S. Majewski |
| 1995 | A Linear Time Algorithm For Finding Maximal Planar Subgraphs. Wen-Lian Hsu |
| 1995 | A Resource Assignment Problem on Graphs. Satoshi Fujita, Tiko Kameda, Masafumi Yamashita |
| 1995 | Algorithmic Problems Arising from Genome Informatics (Abstract). Satoru Miyano |
| 1995 | Algorithms and Computation, 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995, Proceedings John Staples, Peter Eades, Naoki Katoh, Alistair Moffat |
| 1995 | Algorithms for Finding f-Colorings of Partial k-Trees. Xiao Zhou, Takao Nishizeki |
| 1995 | An Approximation Algorithm for Alphabet Indexing Problem. Shinichi Shimozono |
| 1995 | An Approximation Algorithm for MAX 3-SAT. Takao Ono, Tomio Hirata, Takao Asano |
| 1995 | Competitive Searching in Polygons - Beyond Generalised Streets. Amitava Datta, Christoph A. Hipke, Sven Schuierer |
| 1995 | Computing in Linear Time a Chord from Which a Simple Polygon is Weakly Internally Visible. Binay K. Bhattacharya, Asish Mukhopadhyay |
| 1995 | Computing the Tutte Polynomial of a Graph of Moderate Size. Kyoko Sekine, Hiroshi Imai, Seiichiro Tani |
| 1995 | Constant Ratio Approximations of the Weighted Feedback Vertex Set Problem for Undirected Graphs. Vineet Bafna, Piotr Berman, Toshihiro Fujito |
| 1995 | Deciding Bisimulation and Trace Equivalences for Systems with Many Identical Processes. Hsu-Chun Yen, Shi-Tsuen Jian, Ta-Pang Lao |
| 1995 | Embeddings of Hyper-Rings in Hypercubes. Yukihiro Hamada, Aohan Mei, Yasuaki Nishitani, Yoshihide Igarashi |
| 1995 | Fast Approximate Dictionary Matching. Fei Shi |
| 1995 | Finding Dense Subgraphs. Yuichi Asahiro, Kazuo Iwama |
| 1995 | Finding a Shortest Pair of Paths on the Plane with Obstacles and Crossing Areas. Yoshiyuki Kusakari, Hitoshi Suzuki, Takao Nishizeki |
| 1995 | Finding the Medial Axis of a Simple Polygon in Linear Time. Francis Y. L. Chin, Jack Snoeyink, Cao An Wang |
| 1995 | Greedy Approximations of Independent Sets in Low Degree Graphs. Magnús M. Halldórsson, Kiyohito Yoshihara |
| 1995 | Heap Construction: Optimal in Both Worst and Average Cases? Svante Carlsson, Jingsen Chen |
| 1995 | Illumination with Orthogonal Floodlights. James Abello, Vladimir Estivill-Castro, Thomas C. Shermer, Jorge Urrutia |
| 1995 | Learning of Restricted RNLC Graph Languages. Sei'ichi Tani, Koichi Yamazaki |
| 1995 | Linear matching-time algorithm for the directed graph isomorphism problem. James Jianghai Fu |
| 1995 | Linear-time In-place Selection in Less than 3n Comparisons. Svante Carlsson, Mikael Sundström |
| 1995 | Logspace Verifiers, NC, and NP. Satyanarayana V. Lokam, Meena Mahajan, V. Vinay |
| 1995 | Matching Nuts and Bolts Faster. Phillip G. Bradford, Rudolf Fleischer |
| 1995 | More Efficient Parallel Flow Algorithms. Jürgen Dedorath, Jordan Gergov, Torben Hagerup |
| 1995 | NC Algorithms for Partitioning Sparse Graphs into Induced Forests with an Application. Zhi-Zhong Chen |
| 1995 | No Quadrangulation is Extremely Odd. Prosenjit Bose, Godfried T. Toussaint |
| 1995 | On the Complexity of Testing for Catastrophic Faults. Nicola Santoro, Jiajun Ren, Amiya Nayak |
| 1995 | Optimal Information Delivery. Christos H. Papadimitriou, Srinivas Ramanathan, P. Venkat Rangan |
| 1995 | Orders of Gauss Periods in Finite Fields. Joachim von zur Gathen, Igor E. Shparlinski |
| 1995 | Practical Logic (Abstract). John N. Crossley |
| 1995 | Scheduling Parallel Tasks with Individual Deadlines. Oh-Heum Kwon, Kyung-Yong Chwa |
| 1995 | Searching for a Monotone Function by Independent Threshold Queries. Peter Damaschke |
| 1995 | Should Amdahl's Law Be Repealed? (Abstract). Franco P. Preparata |
| 1995 | Some Geometric Lower Bounds. Hank Chien, William L. Steiger |
| 1995 | Spanning Closed Trail and Hamiltonian Cycle in Grid Graphs. Cho Hwan-Gue, Alexander Zelikovsky |
| 1995 | Structure in Average Case Complexity. Christoph Karg, Rainer Schuler |
| 1995 | The First Subquadratic Algorithm for Complete Linkage Clustering. Drago Krznaric, Christos Levcopoulos |
| 1995 | The I/O - Complexity of Ordered Binary - Decision Diagram Manipulation. Lars Arge |
| 1995 | The Parallel Complexity of Approximating the High Degree Subgraph Problem. Alexander E. Andreev, Andrea Clementi, Pierluigi Crescenzi, Elias Dahlhaus, Sergio De Agostino, José D. P. Rolim |
| 1995 | Two Arc Disjoint Paths in Eulerian Diagraphs. András Frank, Toshihide Ibaraki, Hiroshi Nagamochi |
| 1995 | Undirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation. Tsan-sheng Hsu |
| 1995 | Weighted Domination on Cocomparability Graphs. Maw-Shang Chang |
| 1995 | finding Smallest Supertrees. Arvind Gupta, Naomi Nishimura |