no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
A framework for the greedy algorithm
|
Vince, A. |
|
2002 |
121 |
1-3 |
p. 247-260 14 p. |
article |
2 |
Annealed replication: a new heuristic for the maximum clique problem
|
Bomze, Immanuel M. |
|
2002 |
121 |
1-3 |
p. 27-49 23 p. |
article |
3 |
An upper bound for the minimum number of queens covering the n×n chessboard
|
Burger, A.P. |
|
2002 |
121 |
1-3 |
p. 51-60 10 p. |
article |
4 |
A simple algorithm to find the steps of double-loop networks
|
Chi-Feng Chan, Robin |
|
2002 |
121 |
1-3 |
p. 61-72 12 p. |
article |
5 |
A survey on maximum distance holey packings
|
Yin, Jianxing |
|
2002 |
121 |
1-3 |
p. 279-294 16 p. |
article |
6 |
Author index
|
|
|
2002 |
121 |
1-3 |
p. 317-318 2 p. |
article |
7 |
Complexity of finding dense subgraphs
|
Asahiro, Yuichi |
|
2002 |
121 |
1-3 |
p. 15-26 12 p. |
article |
8 |
Families of non-IRUP instances of the one-dimensional cutting stock problem
|
Rietz, Jürgen |
|
2002 |
121 |
1-3 |
p. 229-245 17 p. |
article |
9 |
Families of optimal codes for strong identification
|
Laihonen, Tero |
|
2002 |
121 |
1-3 |
p. 203-213 11 p. |
article |
10 |
Generalized balances in Sturmian words
|
Fagnot, Isabelle |
|
2002 |
121 |
1-3 |
p. 83-101 19 p. |
article |
11 |
Greedy algorithms for tracking mobile users in special mobility graphs
|
Olariu, S. |
|
2002 |
121 |
1-3 |
p. 215-227 13 p. |
article |
12 |
Matchings in colored bipartite networks
|
Yi, Tongnyoul |
|
2002 |
121 |
1-3 |
p. 261-277 17 p. |
article |
13 |
Media theory
|
Falmagne, J.-Cl. |
|
2002 |
121 |
1-3 |
p. 103-118 16 p. |
article |
14 |
NeST graphs
|
Hayward, Ryan B. |
|
2002 |
121 |
1-3 |
p. 139-153 15 p. |
article |
15 |
On claw-free asteroidal triple-free graphs
|
Hempel, Harald |
|
2002 |
121 |
1-3 |
p. 155-180 26 p. |
article |
16 |
On the bound for anonymous secret sharing schemes
|
Kishimoto, Wataru |
|
2002 |
121 |
1-3 |
p. 193-202 10 p. |
article |
17 |
Optimal arrangement of data in a tree directory
|
Luczak, M.J. |
|
2002 |
121 |
1-3 |
p. 307-315 9 p. |
article |
18 |
Ordering graphs with small index and its application
|
Zhang, Fuji |
|
2002 |
121 |
1-3 |
p. 295-306 12 p. |
article |
19 |
Orientations of digraphs almost preserving diameter
|
Gutin, Gregory |
|
2002 |
121 |
1-3 |
p. 129-138 10 p. |
article |
20 |
Pushing vertices in digraphs without long induced cycles
|
Huang, Jing |
|
2002 |
121 |
1-3 |
p. 181-192 12 p. |
article |
21 |
The disjunctive procedure and blocker duality
|
Aguilera, Néstor E. |
|
2002 |
121 |
1-3 |
p. 1-13 13 p. |
article |
22 |
The graph sandwich problem for 1-join composition is NP-complete
|
de Figueiredo, Celina M.H. |
|
2002 |
121 |
1-3 |
p. 73-82 10 p. |
article |
23 |
Total domination number of grid graphs
|
Gravier, Sylvain |
|
2002 |
121 |
1-3 |
p. 119-128 10 p. |
article |