nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A constructive proof for the induction of M-convex functions through networks
|
Shioura, A. |
|
1998 |
82 |
1-3 |
p. 271-278 8 p. |
artikel |
2 |
A graph-theoretic result for a model of neural computation
|
Gerbessiotis, Alexandros V. |
|
1998 |
82 |
1-3 |
p. 257-262 6 p. |
artikel |
3 |
An approximation scheme for strip packing of rectangles with bounded dimensions
|
de La Vega, W.Fernandez |
|
1998 |
82 |
1-3 |
p. 93-101 9 p. |
artikel |
4 |
A strongly polynomial algorithm for the inverse shortest arborescence problem
|
Zhiquan, Hu |
|
1998 |
82 |
1-3 |
p. 135-154 20 p. |
artikel |
5 |
Author index
|
|
|
1998 |
82 |
1-3 |
p. 279-280 2 p. |
artikel |
6 |
Characterizing and edge-colouring split-indifference graphs
|
Carmen Ortiz, Z. |
|
1998 |
82 |
1-3 |
p. 209-217 9 p. |
artikel |
7 |
Editorial Board
|
|
|
1998 |
82 |
1-3 |
p. iii-iv nvt p. |
artikel |
8 |
Fast equi-partitioning of rectangular domains using stripe decomposition
|
Martin, Wayne |
|
1998 |
82 |
1-3 |
p. 193-207 15 p. |
artikel |
9 |
On aggregating two linear Diophantine equations
|
Zhu, Nan |
|
1998 |
82 |
1-3 |
p. 231-246 16 p. |
artikel |
10 |
On the covering radius of an unrestricted code as a function of the rate and dual distance
|
Litsyn, Simon |
|
1998 |
82 |
1-3 |
p. 177-191 15 p. |
artikel |
11 |
On the double competition number
|
Füredi, Zoltán |
|
1998 |
82 |
1-3 |
p. 251-255 5 p. |
artikel |
12 |
On the quality of local search for the quadratic assignment problem
|
Angel, Eric |
|
1998 |
82 |
1-3 |
p. 15-25 11 p. |
artikel |
13 |
On trees and noncrossing partitions
|
Klazar, Martin |
|
1998 |
82 |
1-3 |
p. 263-269 7 p. |
artikel |
14 |
Polyhedral analysis and decompositions for capacitated plant location-type problems
|
Chena, Bintong |
|
1998 |
82 |
1-3 |
p. 79-91 13 p. |
artikel |
15 |
Properly coloured Hamiltonian paths in edge-coloured complete graphs
|
Bang-Jensen, J. |
|
1998 |
82 |
1-3 |
p. 247-250 4 p. |
artikel |
16 |
Some general aspects of the framing number of a digraph
|
Henning, Michael A. |
|
1998 |
82 |
1-3 |
p. 115-133 19 p. |
artikel |
17 |
T-choosability in graphs
|
Alon, Noga |
|
1998 |
82 |
1-3 |
p. 1-13 13 p. |
artikel |
18 |
The algorithmic use of hypertree structure and maximum neighbourhood orderings
|
Brandstädt, Andreas |
|
1998 |
82 |
1-3 |
p. 43-77 35 p. |
artikel |
19 |
The Gergonne p-pile problem and the dynamics of the function x |→ ⌊ (x + r) p ⌋
|
Harrison, John |
|
1998 |
82 |
1-3 |
p. 103-113 11 p. |
artikel |
20 |
The Metropolis algorithm for graph bisection
|
Jerrum, Mark |
|
1998 |
82 |
1-3 |
p. 155-175 21 p. |
artikel |
21 |
The scheduling of maintenance service
|
Anily, Shoshana |
|
1998 |
82 |
1-3 |
p. 27-42 16 p. |
artikel |
22 |
The single loop representations of regular languages
|
Shyr, H.J. |
|
1998 |
82 |
1-3 |
p. 219-229 11 p. |
artikel |