| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A channel state dependent scheduling in wireless communication systems
|
Detti, P.
|
|
2003
|
13 |
C |
p. 38-40
3 p.
|
article
|
| 2 |
A combinatorial optimization problem arising from text classification
|
Bosio, Sandro
|
|
2003
|
13 |
C |
p. 22-25
4 p.
|
article
|
| 3 |
A heuristic for large-scale p-median instances
|
Avella, Pasquale
|
|
2003
|
13 |
C |
p. 14-17
4 p.
|
article
|
| 4 |
A Individually Marginalistic Value for Set Games on Matroids
|
Sun, Hao
|
|
2003
|
13 |
C |
p. 112-116
5 p.
|
article
|
| 5 |
A new graph model and heuristic algorithm for multi-mode task scheduling problem
|
Caramia, Massimiliano
|
|
2003
|
13 |
C |
p. 30-33
4 p.
|
article
|
| 6 |
Average Complexity of Addition Updates and Range Queries over an Array using Graphs
|
Toni, A.
|
|
2003
|
13 |
C |
p. 117-122
6 p.
|
article
|
| 7 |
Clique Graphs and Edge-clique graphs
|
Cerioli, Márcia R.
|
|
2003
|
13 |
C |
p. 34-37
4 p.
|
article
|
| 8 |
Counting Spanning Trees in Cographs
|
Nikolopoulos, Stavros D.
|
|
2003
|
13 |
C |
p. 84-92
9 p.
|
article
|
| 9 |
Discrete models and algorithms for packet scheduling in smart antennas
|
Amaldi, Edoardo
|
|
2003
|
13 |
C |
p. 1-4
4 p.
|
article
|
| 10 |
Distributed Algorithms in Wireless Sensor Networks
|
Nieberg, Tim
|
|
2003
|
13 |
C |
p. 81-83
3 p.
|
article
|
| 11 |
Enumeration of Circuits and Minimal Forbidden Sets
|
Stork, Frederik
|
|
2003
|
13 |
C |
p. 108-111
4 p.
|
article
|
| 12 |
Mathematical Modeling and Discrete Approximation in Evaluation and Forecasting of Expression-Data
|
Gebert, J.
|
|
2003
|
13 |
C |
p. 52-56
5 p.
|
article
|
| 13 |
m_Path Cover Saturated Graphs
|
Dudek, Aneta
|
|
2003
|
13 |
C |
p. 41-44
4 p.
|
article
|
| 14 |
Online Matching On a Line
|
Fuchs, Bernhard
|
|
2003
|
13 |
C |
p. 49-51
3 p.
|
article
|
| 15 |
On Non-Rank Facets of Stable Set Polytopes of Webs with Clique Number Four–Extended Abstract–
|
Pêcher, Arnaud
|
|
2003
|
13 |
C |
p. 93-96
4 p.
|
article
|
| 16 |
On Some Properties of Base-matroids
|
Maffioli, F.
|
|
2003
|
13 |
C |
p. 69-70
2 p.
|
article
|
| 17 |
On the Weak Reconstruction of Strong Product Graphs
|
Zmazek, Blaž
|
|
2003
|
13 |
C |
p. 123-127
5 p.
|
article
|
| 18 |
Performance Ratios for the Karmarkar-Karp Differencing Method
|
Michiels, Wil
|
|
2003
|
13 |
C |
p. 71-75
5 p.
|
article
|
| 19 |
P k+1–Decompositions of Eulerian Graphs: Complexity and Some Solvable Cases
|
Asratian, Armen
|
|
2003
|
13 |
C |
p. 9-13
5 p.
|
article
|
| 20 |
Polynomial Time Algorithms for Determining Optimal Strategies
|
Lozovanu, Dmitrii
|
|
2003
|
13 |
C |
p. 64-68
5 p.
|
article
|
| 21 |
Preface
|
Broersma, Hajo
|
|
2003
|
13 |
C |
p. 128-
1 p.
|
article
|
| 22 |
Shortest paths through two-tone pairs
|
Epping, T.
|
|
2003
|
13 |
C |
p. 45-48
4 p.
|
article
|
| 23 |
Signpost Systems and Their Underlying Graphs
|
Mulder, Henry Martyn
|
|
2003
|
13 |
C |
p. 76-80
5 p.
|
article
|
| 24 |
The Complexity of the Matching-cut Problem for Various Graph Classes
|
Bonsma, Paul
|
|
2003
|
13 |
C |
p. 18-21
4 p.
|
article
|
| 25 |
The Game Chromatic Index of Forests of Maximum Degree 5
|
Andres, Stephan Dominique
|
|
2003
|
13 |
C |
p. 5-8
4 p.
|
article
|
| 26 |
The Ramsey Numbers of Paths Versus Fans
|
Salman, A.N.M.
|
|
2003
|
13 |
C |
p. 103-107
5 p.
|
article
|
| 27 |
The (r, 1)-designs with 13 points
|
Gropp, Harald
|
|
2003
|
13 |
C |
p. 57-60
4 p.
|
article
|
| 28 |
The Relation between the no-wait Job Shop Problem and the Traveling Salesman Problem 1 1 This research was supported by EC Contract IST-1999-14186 (Project ALCOMFT)
|
Lennartz, Peter
|
|
2003
|
13 |
C |
p. 61-63
3 p.
|
article
|
| 29 |
The standard set game of a cooperative game
|
Bumb, A.
|
|
2003
|
13 |
C |
p. 26-29
4 p.
|
article
|
| 30 |
Using mincuts to design secret sharing schemes in graphs
|
Poguntke, Werner
|
|
2003
|
13 |
C |
p. 97-102
6 p.
|
article
|
Journal description