Journals in DBLP

Discrete Applied Mathematics
1993, volume: 47, number: 2

1. Mustafa Akgül, Horst W. Hamacher, Süleyman Tüfekci
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:85- [Journal]
   
2. Susanne Albers, Peter Brucker
   The Complexity of One-Machine Batching Problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:87-107 [Journal]
   
3. Geir Dahl
   Directed Steiner Problems with Connectivity Constraints. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:109-128 [Journal]
   
4. Leslie A. Hall
   A Note on Generalizing the Maximum Lateness Criterion for Scheduling. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:129-137 [Journal]
   
5. Hermann G. Kahlbacher, T. C. Edwin Cheng
   Parallel Machine Scheduling to Minimize Costs for Earliness and Number of Tardy Jobs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:139-164 [Journal]
   
6. Hans Kellerer, Gerhard J. Woeginger
   On the Euclidean two Paths Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:165-173 [Journal]
   
7. Federico Malucelli, Thomas Ottmann, Daniele Pretolani
   Efficient Labelling Algorithms for the Maximum Noncrossing Matching Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:175-179 [Journal]
   
8. Katta G. Murty
   On the Complexity of a Special Basis Problem in LP. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:181-185 [Journal]
   
9. Pawel Winter
   Auclidean Steiner Minimal Trees with Obstacles and Steiner Visibility Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1993, v:47, n:2, pp:187-206 [Journal]