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

Algorithms and Computation

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

Regular Papers

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

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

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