Volume 296; Issue 1

Theoretical Computer Science

Volume 296; Issue 1
1

Preface

Year:
2003
Language:
english
File:
PDF, 41 KB
english, 2003
2

Towards compatible triangulations

Year:
2003
Language:
english
File:
PDF, 147 KB
english, 2003
3

On testing for zero polynomials by a set of points with bounded precision

Year:
2003
Language:
english
File:
PDF, 140 KB
english, 2003
4

On-line stream merging in a general setting

Year:
2003
Language:
english
File:
PDF, 650 KB
english, 2003
5

Computing farthest neighbors on a convex polytope

Year:
2003
Language:
english
File:
PDF, 302 KB
english, 2003
7

Polynomial time algorithms for three-label point labeling

Year:
2003
Language:
english
File:
PDF, 155 KB
english, 2003
8

Lower bounds on the minus domination and k-subdomination numbers

Year:
2003
Language:
english
File:
PDF, 118 KB
english, 2003
9

PC trees and circular-ones arrangements

Year:
2003
Language:
english
File:
PDF, 188 KB
english, 2003
10

Log-space constructible universal traversal sequences for cycles of length O(n4.03)

Year:
2003
Language:
english
File:
PDF, 268 KB
english, 2003
11

Generating well-shaped d-dimensional Delaunay Meshes

Year:
2003
Language:
english
File:
PDF, 193 KB
english, 2003
12

Finding the most vital node of a shortest path

Year:
2003
Language:
english
File:
PDF, 171 KB
english, 2003
13

Non-approximability of weighted multiple sequence alignment

Year:
2003
Language:
english
File:
PDF, 167 KB
english, 2003
14

Editorial board v-ix

Year:
2003
Language:
english
File:
PDF, 55 KB
english, 2003