Volume 82; Issue 1-3

Discrete Applied Mathematics

Volume 82; Issue 1-3
1

Editorial Board

Year:
1998
Language:
english
File:
PDF, 125 KB
english, 1998
2

A graph-theoretic result for a model of neural computation

Year:
1998
Language:
english
File:
PDF, 462 KB
english, 1998
3

Properly coloured Hamiltonian paths in edge-coloured complete graphs

Year:
1998
Language:
english
File:
PDF, 251 KB
english, 1998
4

A constructive proof for the induction of M-convex functions through networks

Year:
1998
Language:
english
File:
PDF, 414 KB
english, 1998
6

On the double competition number

Year:
1998
Language:
english
File:
PDF, 308 KB
english, 1998
7

On trees and noncrossing partitions

Year:
1998
Language:
english
File:
PDF, 426 KB
english, 1998
8

The scheduling of maintenance service

Year:
1998
Language:
english
File:
PDF, 987 KB
english, 1998
9

Fast equi-partitioning of rectangular domains using stripe decomposition

Year:
1998
Language:
english
File:
PDF, 816 KB
english, 1998
10

On aggregating two linear Diophantine equations

Year:
1998
Language:
english
File:
PDF, 843 KB
english, 1998
11

T-choosability in graphs

Year:
1998
Language:
english
File:
PDF, 812 KB
english, 1998
13

Some general aspects of the framing number of a digraph

Year:
1998
Language:
english
File:
PDF, 1.09 MB
english, 1998
14

Characterizing and edge-colouring split-indifference graphs

Year:
1998
Language:
english
File:
PDF, 540 KB
english, 1998
15

On the quality of local search for the quadratic assignment problem

Year:
1998
Language:
english
File:
PDF, 573 KB
english, 1998
18

The Metropolis algorithm for graph bisection

Year:
1998
Language:
english
File:
PDF, 1.44 MB
english, 1998
20

A strongly polynomial algorithm for the inverse shortest arborescence problem

Year:
1998
Language:
english
File:
PDF, 909 KB
english, 1998
21

The single loop representations of regular languages

Year:
1998
Language:
english
File:
PDF, 782 KB
english, 1998
22

Author index

Year:
1998
Language:
english
File:
PDF, 80 KB
english, 1998