Journals in DBLP

Computing
1999, volume: 63, number: 4

1. Peter Brucker, Sigrid Knust
   Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags. [Citation Graph (0, 0)][DBLP]
   Computing, 1999, v:63, n:4, pp:299-316 [Journal]
   
2. Rainer E. Burkard, M. M. Miatselski
   Volume Maximization and Orthoconvex Approximation of Orthogons. [Citation Graph (0, 0)][DBLP]
   Computing, 1999, v:63, n:4, pp:317-330 [Journal]
   
3. Michel X. Goemans, Franz Rendl
   Semidefinite Programs and Association Schemes. [Citation Graph (0, 0)][DBLP]
   Computing, 1999, v:63, n:4, pp:331-340 [Journal]
   
4. Clemens Heuberger
   Minimal Expansions in Redundant Number Systems and Shortest Paths in Graphs. [Citation Graph (0, 0)][DBLP]
   Computing, 1999, v:63, n:4, pp:341-349 [Journal]
   
5. Stefan E. Karisch, Eranda Çela, Jens Clausen, T. Espersen
   A Dual Framework for Lower Bounds of the Quadratic Assignment Problem Based on Linearization. [Citation Graph (0, 0)][DBLP]
   Computing, 1999, v:63, n:4, pp:351-403 [Journal]
   
6. Peter Kleinschmidt, Christian Rank
   New Heuristics for the Multidimensional Vote Assignment Problem. [Citation Graph (0, 0)][DBLP]
   Computing, 1999, v:63, n:4, pp:405-417 [Journal]
   
7. Ulrich Pferschy
   Dynamic Programming Revisited: Improving Knapsack Algorithms. [Citation Graph (0, 0)][DBLP]
   Computing, 1999, v:63, n:4, pp:419-430 [Journal]