International Journal of Foundations of Computer Science, Volume 7

Volume 7, Number 1, March 1996

David Sankoff, Gopal Sundaram, John D. Kececioglu: Steiner Points in the Space of Genome Rearrangements. 1-9
Richa Agarwala, David Fernández-Baca: Simple Algorithms for Perfect Phylogeny and Triangulating Colored Graphs. 11-22
Martin Fürer, W. Miller: Alignment-to-Alignment Editing with "Move Gap" Operations. 23-
Kaizhong Zhang, Jason Tsong-Li Wang, Dennis Shasha: On the Editing Distance Between Undirected Acyclic Graphs. 43-58
Liz Hanks, Ron Cytron, Will D. Gillett: On Finding Topologically Valid Matchings in Restriction-Fragment Maps. 59-86
Art M. Duval, William F. Smyth: Covering a Circular String with Substrings of Fixed Length. 87-93

Algorithms and Computation

Heike Ripphausen-Lipa, Dorothea Wagner, Karsten Weihe: Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs. 95-110
Ton Kloks: Treewidth of Circle Graphs. 111-120
Gautam Das, Paul J. Heffernan: Constructing Degree-3 Spanners with Other Sparseness Properties. 121-136
Rudolf Fleischer: A Simple Balanced Search Tree with O(1) Worst-Case Update Time. 137-150

Regular Papers

Keijo Ruohonen: An Effective Cauchy-Peano Existence Theorem for Unique Solutions. 151-160
Raymond Greenlaw: Subtree Isomorphism is in DLOG for Nested Trees. 161-168
Kim S. Larsen, Rolf Fagerberg: Efficient Rebalancing of B-Trees with Relaxed Balance. 169-

Juris Viksna: Inductive Inference of Limiting Programs with Bounded Number of Mind Changes. 187-
Ratko Orlandic, Hosam M. Mahmoud: Storage Overhead of O-Trees, B-Trees and Prefix B-Trees: A Comparative Analysis. 209-226
Lin Chen, René Schott: Optimal Operations on Red-Black Trees. 227-240
Salvatore Caporaso: Safe Turing Machines, Grzegorczyk Classes and Polytime. 241-252
Luca Breveglieri, Alessandra Cherubini, Claudio Citrini, Stefano Crespi-Reghizzi: Multi-Push-Down Languages and Grammars. 253-292
Helmut Prodinger: Depth and Path Length of Heap Ordered Trees. 293-299

P.-K. Wong: An Algorithm for Finding a Maximum Cycle of Bipartite Graphs with Large Degrees. 301-
Satoshi Kobayashi, Takashi Yokomori: Families of Noncounting Languages and Their Learnability from Positive Data. 309-
Ioan I. Macarie: A Note of Multihead Finite-State Automata. 329-
Manindra Agrawal, Srinivasan Venkatesh: On the Isomorphism Conjecture for 2-DFA Reductions. 339-
William Klostermeyer: Scheduling Two Salesmen in a Network. 353-358
Jan A. Plaza: On the Propositional SLDNF-Resolution. 359-