Volume 12; Issue 1

Journal of Algorithms

Volume 12; Issue 1
1

Editorial Board

Year:
1991
File:
PDF, 31 KB
1991
2

Algorithms finding tree-decompositions of graphs

Year:
1991
Language:
english
File:
PDF, 1.27 MB
english, 1991
3

An improved algorithm for the planar 3-cut problem

Year:
1991
Language:
english
File:
PDF, 838 KB
english, 1991
4

Finding k points with minimum diameter and related problems

Year:
1991
Language:
english
File:
PDF, 1.13 MB
english, 1991
5

Efficient maintenance of the union of intervals on a line, with applications

Year:
1991
Language:
english
File:
PDF, 985 KB
english, 1991
6

Computing the visibility polygon from a convex set and related problems

Year:
1991
Language:
english
File:
PDF, 1.05 MB
english, 1991
7

Parallel algorithms for parity graphs

Year:
1991
Language:
english
File:
PDF, 782 KB
english, 1991
8

Transitive compaction in parallel via branchings

Year:
1991
Language:
english
File:
PDF, 1000 KB
english, 1991
9

Average case analysis of heap building by repeated insertion

Year:
1991
Language:
english
File:
PDF, 1.13 MB
english, 1991
10

A necessary and sufficient condition for the existence of a complete stable matching

Year:
1991
Language:
english
File:
PDF, 1.35 MB
english, 1991
11

Two algorithms for the sieve method

Year:
1991
Language:
english
File:
PDF, 191 KB
english, 1991
12

Problems

Year:
1991
Language:
english
File:
PDF, 143 KB
english, 1991
13

Papers to appear in forthcoming issues

Year:
1991
Language:
english
File:
PDF, 72 KB
english, 1991