| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A closest vector problem arising in radiation therapy planning
|
Engelbeen, Céline
|
|
2010
|
22 |
4 |
p. 609-629
|
artikel
|
| 2 |
A generalization of Macula’s disjunct matrices
|
Zhao, Ping
|
|
2010
|
22 |
4 |
p. 495-498
|
artikel
|
| 3 |
A modified power spectral density test applied to weighing matrices with small weight
|
Kotsireas, Ilias S.
|
|
2010
|
22 |
4 |
p. 873-881
|
artikel
|
| 4 |
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
|
Fan, Neng
|
|
2010
|
22 |
4 |
p. 747-762
|
artikel
|
| 5 |
Co-2-plex polynomials
|
McClosky, Benjamin
|
|
2010
|
22 |
4 |
p. 640-650
|
artikel
|
| 6 |
Fast searching games on graphs
|
Stanley, Donald
|
|
2010
|
22 |
4 |
p. 763-777
|
artikel
|
| 7 |
Geometric rounding: a dependent randomized rounding scheme
|
Ge, Dongdong
|
|
2010
|
22 |
4 |
p. 699-725
|
artikel
|
| 8 |
Improved floor-planning of graphs via adjacency-preserving transformations
|
Zhang, Huaming
|
|
2010
|
22 |
4 |
p. 726-746
|
artikel
|
| 9 |
Improving an upper bound on the size of k-regular induced subgraphs
|
Luz, Carlos J.
|
|
2010
|
22 |
4 |
p. 882-894
|
artikel
|
| 10 |
Minimizing makespan in an ordered flow shop with machine-dependent processing times
|
Choi, Byung-Cheon
|
|
2010
|
22 |
4 |
p. 797-818
|
artikel
|
| 11 |
Minimum d-blockers and d-transversals in graphs
|
Costa, Marie-Christine
|
|
2010
|
22 |
4 |
p. 857-872
|
artikel
|
| 12 |
On domination number of Cartesian product of directed paths
|
Liu, Juan
|
|
2010
|
22 |
4 |
p. 651-662
|
artikel
|
| 13 |
On the vertex characterization of single-shape partition polytopes
|
Liu, Yu-Chi
|
|
2010
|
22 |
4 |
p. 563-571
|
artikel
|
| 14 |
Optimality conditions for a bilevel matroid problem
|
Fanghänel, Diana
|
|
2010
|
22 |
4 |
p. 594-608
|
artikel
|
| 15 |
Optimal on-line algorithms for one batch machine with grouped processing times
|
Fang, Yang
|
|
2010
|
22 |
4 |
p. 509-516
|
artikel
|
| 16 |
Optimal semi-online algorithm for scheduling with rejection on two uniform machines
|
Min, Xiao
|
|
2010
|
22 |
4 |
p. 674-683
|
artikel
|
| 17 |
Optimal tree structure with loyal users and batch updates
|
Chan, Yu-Ki
|
|
2010
|
22 |
4 |
p. 630-639
|
artikel
|
| 18 |
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
|
Liu, Chunmei
|
|
2010
|
22 |
4 |
p. 684-698
|
artikel
|
| 19 |
Polynomially solvable special cases of the quadratic bottleneck assignment problem
|
Burkard, Rainer E.
|
|
2010
|
22 |
4 |
p. 845-856
|
artikel
|
| 20 |
PTAS for minimum weighted connected vertex cover problem with c-local condition in unit disk graphs
|
Fan, Lidan
|
|
2010
|
22 |
4 |
p. 663-673
|
artikel
|
| 21 |
Resource-sharing systems and hypergraph colorings
|
Lin, Wu-Hsiung
|
|
2010
|
22 |
4 |
p. 499-508
|
artikel
|
| 22 |
Revised GRASP with path-relinking for the linear ordering problem
|
Chaovalitwongse, W. Art
|
|
2010
|
22 |
4 |
p. 572-593
|
artikel
|
| 23 |
Selfish bin coloring
|
Epstein, Leah
|
|
2010
|
22 |
4 |
p. 531-548
|
artikel
|
| 24 |
SIRALINA: efficient two-steps heuristic for storage optimisation in single period task scheduling
|
Deschinkel, Karine
|
|
2010
|
22 |
4 |
p. 819-844
|
artikel
|
| 25 |
Super cyclically edge connected transitive graphs
|
Zhang, Zhao
|
|
2010
|
22 |
4 |
p. 549-562
|
artikel
|
| 26 |
The Maximum Box Problem for moving points in the plane
|
Bereg, S.
|
|
2010
|
22 |
4 |
p. 517-530
|
artikel
|
| 27 |
The multiple sequence sets: problem and heuristic algorithms
|
Ning, Kang
|
|
2010
|
22 |
4 |
p. 778-796
|
artikel
|
Tijdschrift beschrijving