1. Polynomial Time Introreducibility

   • Patrizio Cintioli
   • Riccardo Silvestri

   OriginalPaper 20 January 2003 Pages: 1 - 15

2. An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs

   • Debashis Bera
   • Madhumangal Pal
   • Tapan K. Pal

   OriginalPaper 20 January 2003 Pages: 17 - 27

3. Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables

   • Howard Straubing
   • Denis Thérien

   OriginalPaper 20 January 2003 Pages: 29 - 69

4. Graph Complexity and Slice Functions

   • Satyanarayana V. Lokam

   OriginalPaper 20 January 2003 Pages: 71 - 88

5. The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet

   • Juha Honkala

   OriginalPaper 20 January 2003 Pages: 89 - 103