no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs
|
Bera, |
|
Inc. |
36 |
1 |
p. 17-27 |
article |
2 |
An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs
|
Bera, Debashis |
|
2002 |
36 |
1 |
p. 17-27 |
article |
3 |
Graph Complexity and Slice Functions
|
V. Lokam, |
|
Inc. |
36 |
1 |
p. 71-88 |
article |
4 |
Graph Complexity and Slice Functions
|
V. Lokam, Satyanarayana |
|
2002 |
36 |
1 |
p. 71-88 |
article |
5 |
Polynomial Time Introreducibility
|
Cintioli, |
|
Inc. |
36 |
1 |
p. 1-15 |
article |
6 |
Polynomial Time Introreducibility
|
Cintioli, Patrizio |
|
2002 |
36 |
1 |
p. 1-15 |
article |
7 |
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables
|
Straubing, |
|
Inc. |
36 |
1 |
p. 29-69 |
article |
8 |
Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables
|
Straubing, Howard |
|
2002 |
36 |
1 |
p. 29-69 |
article |
9 |
The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet
|
Honkala, |
|
Inc. |
36 |
1 |
p. 89-103 |
article |
10 |
The Equivalence Problem of Polynomially Bounded D0L Systems— a Bound Depending Only on the Size of the Alphabet
|
Honkala, Juha |
|
2002 |
36 |
1 |
p. 89-103 |
article |