Volume 127, Number 1, 1 April 2003

• 
  Tatsuya Akutsu, Kyotetsu Kanaya, Akira Ohyama, Asao Fujiyama: Point matching under non-uniform distortions. 5-21
• 
  Chandrajit L. Bajaj, Valerio Pascucci, Ariel Shamir, Robert J. Holt, Arun N. Netravali: Dynamic maintenance and visualization of molecular surfaces. 23-51
• 
  Peter Damaschke: Point placement on the line by distance data. 53-62
• 
  François Denis, Olivier Gascuel: On the consistency of the minimum evolution principle of phylogenetic inference. 63-77
• 
  István Miklós: Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution. 79-84
• 
  Rudi Pendavingh, Petra Schuurman, Gerhard J. Woeginger: Recognizing DNA graphs is difficult. 85-94
• 
  Benno Schwikowski, Martin Vingron: Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions. 95-117
• 
  Vamsi Veeramachaneni, Piotr Berman, Webb Miller: Aligning two fragmented sequences. 119-143
• 
  Vijay Chandru, Abhi Dattasharma, V. S. Anil Kumar: The algorithmics of folding proteins on lattices. 145-161
• 
  Volker Heun: Approximate protein folding in the HP side chain model on extended cubic lattices. 163-177

Volume 127, Number 2, 15 April 2003

Ordinal, Symbolic Data Analysis (OSDA '98), Univ. of Massachusetts, Amherst, Sept. 28-30, 1998

• 
  Melvin F. Janowitz: Preface. 179-180
• 
  Fuad Aleskerov, Yusufcan Masatlioglu: Utility Representation via Additive or Multiplicative Error Functions. 181-197
• 
  Patrice Bertrand, Melvin F. Janowitz: The k-weak Hierarchical Representations: An Extension of the Indexed Closed Weak Hierarchies. 199-220
• 
  Silke Brandt, Dietrich Albert, Cord Hockemeyer: Surmise Relations Between Tests - Mathematical Considerations. 221-239
• 
  Nathalie Caspard, Bernard Monjardet: The Lattices of Closure Systems, Closure Operators, and Implicational Systems on a Finite Set: A Survey. 241-269
• 
  Edwin Diday, Richard Emilion: Maximal and Stochastic Galois Lattices. 271-284
• 
  Bruno Leclerc: The Median Procedure in the Semilattice of Orders. 285-302
• 
  Lutz Leischner: Additive Similarity Measures. 303-318
• 
  Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers: The Median Function on Distributive Semilattices. 319-324
• 
  Robert C. Powers: Medians and Majorities in Semimodular Posets. 325-336
• 
  Susanne Prediger: Formal Concept Analysis for General Objects. 337-355
• 
  Fred S. Roberts, Shaoji Xu: Characterizations of Consistent Marked Graphs. 357-371
• 
  Reinhard Suck: Parsimonious Set Representations of Orders, a Generalization of the Interval Order Concept, and Knowledge Spaces. 373-386
• 
  Alexis Tsoukiàs, Philippe Vincke: A Characterization of PQI Interval Orders. 387-397

Volume 127, Number 3, 1 May 2003

• 
  Jean-Claude Bermond, Johny Bond, David Peleg, Stephane Perennes: The Power of Small Coalitions in Graphs. 399-414
• 
  Leizhen Cai: Parameterized Complexity of Vertex Colouring. 415-429
• 
  Satoshi Fujita, Arthur M. Farley: Sparse Hypercube - Minimal k-line Broadcast Graph. 431-446
• 
  T. S. Michael, Thomas Quint: Sphere of Influence Graphs and the L-metric. 447-460
• 
  Aziz Moukrim: Scheduling Unitary Task Systems with Zero-one Communication Delays for Quasi-interval Orders. 461-476
• 
  Mohammad R. Salavatipour: On Sum Coloring of Graphs. 477-488
• 
  Charles Semple: Reconstructing Minimal Rooted Trees. 489-503
• 
  Igor Averbakh: Complexity of Robust Single Facility Location Problems on Networks with Uncertain Edge Lengths. 505-522
• 
  Renato Bruni, Antonio Sassano: A Complete Adaptive Algorithm for Propositional Satisfiability. 523-534
• 
  Marco Budinich: Exact Bounds on the Order of the Maximum Clique of a Graph. 535-543
• 
  Yaojun Chen, Feng Tian: A New Proof of Wojcicka's Conjecture. 545-554
• 
  Qizhi Fang, Mao-cheng Cai, Xiaotie Deng: Total Balancedness Condition for Steiner Tree Games. 555-563
• 
  Fedor V. Fomin, Dieter Kratsch, Haiko Müller: On the Domination Search Number. 565-580
• 
  Van Bang Le: Bipartite-perfect Graphs. 581-599
• 
  Jixiang Meng: Connectivity of Vertex and Edge Transitive Graphs. 601-613
• 
  Ljiljana Pavlovic: Maximal Value of the Zeroth-order Randic Index. 615-626
• 
  Y. T. Yeh, S. S. Yu: The Disjunctivities of w-languages. 627-641
• 
  Uriel Feige, Robert Krauthgamer, Kobbi Nissim: On Cutting a Few Vertices from a Graph. 643-649
• 
  Martin Gavalec, Ján Plávka: An O(n²) Algorithm for Maximum Cycle Mean of Monge Matrices in Max-algebra. 651-656
• 
  Boaz Tsaban: Bernoulli Numbers and the Probability of a Birthday Surprise. 657-663
• 
  Rafael Martí, Manuel Laguna: Heuristics and Meta-heuristics for 2-layer Straight Line Crossing Minimization. 665-678
• 
  Yash P. Aneja, R. Chandrasekaran, Kunhiraman Nair: Parametric Min-cuts Analysis in a Network. 679-689