Volume 21; Issue 2

Journal of Algorithms

Volume 21; Issue 2
1

On-line Planar Graph Embedding

Roberto Tamassia
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 504 KB
english, 1996
2

On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions

Paul Tseng, Zhi-Quan Luo
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 250 KB
english, 1996
3

An Incremental Algorithm for a Generalization of the Shortest-Path Problem

G. Ramalingam, Thomas Reps
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 363 KB
english, 1996
5

Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition

Edith Cohen
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 297 KB
english, 1996
6

Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs

Hans L. Bodlaender, Ton Kloks
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 373 KB
english, 1996
7

Approximation Algorithms for Network Design Problems on Bounded Subsets

Dorit S. Hochbaum, Joseph (Seffi) Naor
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 141 KB
english, 1996
8

Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria

J.A. Hoogeveen
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 210 KB
english, 1996
9

Improved Approximation Algorithms for Uniform Connectivity Problems

Samir Khuller, Balaji Raghavachari
Journal:
Journal of Algorithms
Year:
1996
Language:
english
File:
PDF, 174 KB
english, 1996