| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A heuristic for the p-center problems in graphs
|
PlesnÃk, J.
|
|
1987
|
17 |
3 |
p. 263-268
6 p.
|
article
|
| 2 |
Author index
|
|
|
1987
|
17 |
3 |
p. 311-
1 p.
|
article
|
| 3 |
Bounds for the solution set of linear complementarity problems
|
Pardalos, Panos M.
|
|
1987
|
17 |
3 |
p. 255-261
7 p.
|
article
|
| 4 |
Cops and robbers in graphs with large girth and Cayley graphs
|
Frankl, Peter
|
|
1987
|
17 |
3 |
p. 301-305
5 p.
|
article
|
| 5 |
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
|
Franco, John
|
|
1987
|
17 |
3 |
p. 295-299
5 p.
|
article
|
| 6 |
On a game of policemen and robber
|
Maamoun, M.
|
|
1987
|
17 |
3 |
p. 307-309
3 p.
|
article
|
| 7 |
Ranking the vertices of an r-partite paired comparison digraph
|
Kano, Mikio
|
|
1987
|
17 |
3 |
p. 245-253
9 p.
|
article
|
| 8 |
Representability in mixed integer programmiing, I: Characterization results
|
Jeroslow, Robert G.
|
|
1987
|
17 |
3 |
p. 223-243
21 p.
|
article
|
| 9 |
Semi-independence number of a graph and the existence of Hamiltonian circuits
|
Ainouche, Ahmed
|
|
1987
|
17 |
3 |
p. 213-221
9 p.
|
article
|
| 10 |
Steiner problem in Halin networks
|
Winter, Pawel
|
|
1987
|
17 |
3 |
p. 281-294
14 p.
|
article
|
| 11 |
The competition-common enemy graph of a digraph
|
Scott, Debra D.
|
|
1987
|
17 |
3 |
p. 269-280
12 p.
|
article
|
Journal description