Digital Library
Close
Browse articles from a journal
Search for
Magazine
Article
ISSN
NBN article
NBN magazine
DARE/NARCIS document
with title:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
9 results found
no
title
author
magazine
year
volume
issue
page(s)
type
1
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
Ramalingam, G.
1996
21
2
p. 267-305
39 p.
article
2
Approximation Algorithms for Min-k-Overlap Problems Using the Principal Lattice of Partitions Approach
Narayanan, H.
1996
21
2
p. 306-330
25 p.
article
3
Approximation Algorithms for Network Design Problems on Bounded Subsets
Hochbaum, Dorit S.
1996
21
2
p. 403-414
12 p.
article
4
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
Bodlaender, Hans L.
1996
21
2
p. 358-402
45 p.
article
5
Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
Cohen, Edith
1996
21
2
p. 331-357
27 p.
article
6
Improved Approximation Algorithms for Uniform Connectivity Problems
Khuller, Samir
1996
21
2
p. 434-450
17 p.
article
7
On Computing the Nested Sums and Infimal Convolutions of Convex Piecewise-Linear Functions
Tseng, Paul
1996
21
2
p. 240-266
27 p.
article
8
On-line Planar Graph Embedding
Tamassia, Roberto
1996
21
2
p. 201-239
39 p.
article
9
Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
Hoogeveen, J.A.
1996
21
2
p. 415-433
19 p.
article
9 results found
Koninklijke Bibliotheek -
National Library of the Netherlands