1. Efficient reduction for path problems on circular-arc graphs

   • Srinivasa R. Arikati
   • C. Pandu Rangan
   • Glenn K. Manacher

   Part I Computer Science Pages: 181 - 193

2. The recursive structure of some ordering problems

   • M. D. Atkinson

   Part I Computer Science Pages: 194 - 201

3. Finding squares and rectangles in sets of points

   • Marc J. van Kreveld
   • Mark T. De Berg

   Part I Computer Science Pages: 202 - 219

4. A note on optimal multiway split trees

   • L. T. Liu
   • Gen-Huey Chen
   • Yue-Li Wang

   Part I Computer Science Pages: 220 - 229

5. Finding minimal nested polygons

   • Cao An Wang

   Part I Computer Science Pages: 230 - 236

6. Component-wise perturbation analysis and error bounds for linear least squares solutions

   • Å. Björck

   Part II Numerical Mathematics Pages: 237 - 244

7. Finite difference methods for a nonlocal boundary value problem for the heat equation

   • Gunnar Ekolin

   Part II Numerical Mathematics Pages: 245 - 261

8. Improved error bounds for near-minimax approximations

   • David Elliott
   • George M. Phillips

   Part II Numerical Mathematics Pages: 262 - 275

9. Numerical evaluation of analytic functions by Cauchy's theorem

   • N. I. Ioakimidis
   • K. E. Papadakis
   • E. A. Perdios

   Part II Numerical Mathematics Pages: 276 - 285

10. The number of steps in the euclidean algorithm over complex quadratic fields

    • Arnold Knopfmacher
    • John Knopfmacher

    Part II Numerical Mathematics Pages: 286 - 292

11. On resolvent conditions and stability estimates

    • Christian Lubich
    • Olavi Nevanlinna

    Part II Numerical Mathematics Pages: 293 - 313

12. Algebraic characterization ofI-stable Runge-Kutta methods

    • Michael Müller

    Part II Numerical Mathematics Pages: 314 - 320

13. Product integration of singular integrands using Hermite-Fejér interpolation

    • Philip Rabinowitz

    Part II Numerical Mathematics Pages: 321 - 327

14. Convex interval interpolation with cubic splines, II

    • Jochen W. Schmidt

    Part II Numerical Mathematics Pages: 328 - 340

15. Perturbation bounds for the Cholesky andQR factorizations

    • Ji-Guang Sun

    Part II Numerical Mathematics Pages: 341 - 352

16. A linear time and space algorithm for finding isomorphic subtrees of a binary tree

    • Erkki Mäkinen

    Scientific Notes Pages: 353 - 357

17. Perturbation bounds for theLDL ^H andLU decompositions

    • Anders Barrlund

    Scientific Notes Pages: 358 - 363

18. A lower bound for the number of stages of an explicit continuous Runge-Kutta method to obtain convergence of given order

    • J. M. Carnicer

    Scientific Notes Pages: 364 - 368

19. A faster Broyden method

    • Eric Kvaalen

    Scientific Notes Pages: 369 - 372

20. A uniqueness result related to the stability of explicit Runge-Kutta methods

    • Brynjulf Owren
    • Kristian Seip

    Scientific Notes Pages: 373 - 374

21. ImplicitQR factorization of a product of three matrices

    • Hongyuan Zha

    Scientific Notes Pages: 375 - 379