| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Distributed Algorithm for the Facility Location Problem
|
Gehweiler, Joachim
|
|
2006
|
25 |
C |
p. 91-
1 p.
|
artikel
|
| 2 |
Adjacent-Resource Scheduling
|
Paulus, Jacob Jan
|
|
2006
|
25 |
C |
p. 113-116
4 p.
|
artikel
|
| 3 |
A dynamic programming algorithm for the single-machine scheduling problem with deteriorating processing times
|
Bosio, Alberto
|
|
2006
|
25 |
C |
p. 139-142
4 p.
|
artikel
|
| 4 |
An adaptation of Eppstein's algorithm dealing with the k shortest – loopless and having at most p arcs – paths problem
|
Bricard, H.
|
|
2006
|
25 |
C |
p. 23-26
4 p.
|
artikel
|
| 5 |
An Algorithm for Multistage Stochastic Integer Programs
|
Heinze, Thomas
|
|
2006
|
25 |
C |
p. 69-
1 p.
|
artikel
|
| 6 |
An Exact Algorithm for Solving Weight-Constrained Combinatorial Optimization Problems
|
Ruzika, Stefan
|
|
2006
|
25 |
C |
p. 143-144
2 p.
|
artikel
|
| 7 |
An extremal problem on graphs
|
Aydinian, Harout
|
|
2006
|
25 |
C |
p. 19-
1 p.
|
artikel
|
| 8 |
An O ( n 2.75 ) algorithm for online topological ordering
|
Ajwani, Deepak
|
|
2006
|
25 |
C |
p. 7-12
6 p.
|
artikel
|
| 9 |
Approximating Max Cut with Limited Unbalance
|
Galbiati, G.
|
|
2006
|
25 |
C |
p. 101-104
4 p.
|
artikel
|
| 10 |
A Two-stage Model for a Day-ahead Paratransit Planning Problem
|
Cremers, M.L.A.G.
|
|
2006
|
25 |
C |
p. 35-
1 p.
|
artikel
|
| 11 |
Bi-Directional Determination of Sparse Jacobian Matrices: Approaches and Algorithms
|
Goyal, Mini
|
|
2006
|
25 |
C |
p. 73-80
8 p.
|
artikel
|
| 12 |
Competitive Algorithms for Cottage Rental
|
Westphal, Stephan
|
|
2006
|
25 |
C |
p. 187-188
2 p.
|
artikel
|
| 13 |
Controlled Randomized Rounding
|
Doerr, Benjamin
|
|
2006
|
25 |
C |
p. 39-40
2 p.
|
artikel
|
| 14 |
Exploring the complexity boundary between coloring and list-coloring
|
Bonomo, Flavia
|
|
2006
|
25 |
C |
p. 41-47
7 p.
|
artikel
|
| 15 |
Game-perfect Graphs with Clique Number 2
|
Andres, Stephan Dominique
|
|
2006
|
25 |
C |
p. 13-16
4 p.
|
artikel
|
| 16 |
Generalized clique family inequalities for claw-free graphs
|
Pêcher, Arnaud
|
|
2006
|
25 |
C |
p. 117-121
5 p.
|
artikel
|
| 17 |
Global offensive alliances in graphs
|
Rodríguez-Velázquez, J.A.
|
|
2006
|
25 |
C |
p. 157-164
8 p.
|
artikel
|
| 18 |
Hamilton cycles in maximal planar graphs
|
Helde, Guido
|
|
2006
|
25 |
C |
p. 71-
1 p.
|
artikel
|
| 19 |
Hamiltonian Chains in Hypergraphs
|
Katona, Gyula Y.
|
|
2006
|
25 |
C |
p. 81-87
7 p.
|
artikel
|
| 20 |
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
|
Feng, Jinfeng
|
|
2006
|
25 |
C |
p. 55-
1 p.
|
artikel
|
| 21 |
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
|
Cerulli, R.
|
|
2006
|
25 |
C |
p. 131-138
8 p.
|
artikel
|
| 22 |
Maximum-Cover Source-Location Problem with Objective Edge-Connectivity Three
|
Sugihara, Kenya
|
|
2006
|
25 |
C |
p. 165-171
7 p.
|
artikel
|
| 23 |
Nash Equilibria Conditions for Cyclic Games with p Players
|
Lozovanu, Dmitrii
|
|
2006
|
25 |
C |
p. 123-129
7 p.
|
artikel
|
| 24 |
Notable trends concerning the synchronization of graphs and automata
|
Trahtman, A.N.
|
|
2006
|
25 |
C |
p. 173-175
3 p.
|
artikel
|
| 25 |
On determining the imperfection ratio
|
Koster, Arie M.C.A.
|
|
2006
|
25 |
C |
p. 177-181
5 p.
|
artikel
|
| 26 |
Online-Optimization of Large-Scale Vehicle Dispatching Problems
|
Saliba, Sleman
|
|
2006
|
25 |
C |
p. 145-146
2 p.
|
artikel
|
| 27 |
Optimal Dynamic Multicommodity Flows in Networks
|
Lozovanu, Dmitrii
|
|
2006
|
25 |
C |
p. 93-100
8 p.
|
artikel
|
| 28 |
Optimal Investments in Distributed Generation Units under Uncertainty
|
Gotzes, Uwe
|
|
2006
|
25 |
C |
p. 65-
1 p.
|
artikel
|
| 29 |
Optimization of Dispersed Generation Systems including Risk Aversion
|
Neise, Frederike
|
|
2006
|
25 |
C |
p. 105-106
2 p.
|
artikel
|
| 30 |
Parameterized Algorithms for Finding Small Independent Dominating Sets in Planar Graphs
|
Abu Khzam, Faisal N.
|
|
2006
|
25 |
C |
p. 1-6
6 p.
|
artikel
|
| 31 |
Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines
|
Brueggemann, Tobias
|
|
2006
|
25 |
C |
p. 29-33
5 p.
|
artikel
|
| 32 |
Processing Huge Graphs with Stxxl
|
Dementiev, Roman
|
|
2006
|
25 |
C |
p. 37-38
2 p.
|
artikel
|
| 33 |
Quantum Predictor Models
|
Faigle, Ulrich
|
|
2006
|
25 |
C |
p. 149-155
7 p.
|
artikel
|
| 34 |
Quasirandomness in Graphs
|
Doerr, Benjamin
|
|
2006
|
25 |
C |
p. 61-64
4 p.
|
artikel
|
| 35 |
Randolphs Robot Game is NP-hard!
|
Engels, Birgit
|
|
2006
|
25 |
C |
p. 49-53
5 p.
|
artikel
|
| 36 |
Risk Neutral and Risk Averse Models for Power Optimization under Uncertainty in Electricity Networks with Dispersed Generation
|
Kuhn, Sebastian
|
|
2006
|
25 |
C |
p. 89-
1 p.
|
artikel
|
| 37 |
Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures
|
Brenner, Janina A.
|
|
2006
|
25 |
C |
p. 21-22
2 p.
|
artikel
|
| 38 |
Speeding up Exact Algorithms With High Probability
|
Fernau, Henning
|
|
2006
|
25 |
C |
p. 57-59
3 p.
|
artikel
|
| 39 |
Stochastic Airline Fleet Assignment is PSPACE-complete
|
Grothklags, Sven
|
|
2006
|
25 |
C |
p. 67-68
2 p.
|
artikel
|
| 40 |
Suballowable sequences of permutations
|
Asinowski, Andrei
|
|
2006
|
25 |
C |
p. 17-18
2 p.
|
artikel
|
| 41 |
The number of tree stars is O *(1.357 k )
|
Fuchs, Bernhard
|
|
2006
|
25 |
C |
p. 183-185
3 p.
|
artikel
|
| 42 |
Timetabling problems at the TU Eindhoven
|
van den Broek, John
|
|
2006
|
25 |
C |
p. 27-28
2 p.
|
artikel
|
| 43 |
Two disjoint negative cycles in a signed graph
|
Hochstättler, Winfried
|
|
2006
|
25 |
C |
p. 107-111
5 p.
|
artikel
|
| 44 |
Upper bounds for the chromatic number of a graph
|
Schiermeyer, Ingo
|
|
2006
|
25 |
C |
p. 147-148
2 p.
|
artikel
|
Tijdschrift beschrijving