Journals in DBLP

Discrete Applied Mathematics
1998, volume: 82, number: 1-3

1. Noga Alon, Ayal Zaks
   T-choosability in Graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:1-13 [Journal]
   
2. Eric Angel, Vassilis Zissimopoulos
   On the Quality of Local Search for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:15-25 [Journal]
   
3. Shoshana Anily, Celia A. Glass, Refael Hassin
   The Scheduling of Maintenance Service. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:27-42 [Journal]
   
4. Andreas Brandstädt, Victor Chepoi, Feodor F. Dragan
   The Algorithmic Use of Hypertree Structure and Maximum Neighbourhood Orderings. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:43-77 [Journal]
   
5. Bintong Chena, Monique Guignard
   Polyhedral Analysis and Decompositions for Capacitated Plant Location-type Problems. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:79-91 [Journal]
   
6. Wenceslas Fernandez de la Vega, Vassilis Zissimopoulos
   An Approximation Scheme for Strip Packing of Rectangles with Bounded Dimensions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:93-101 [Journal]
   
7. John Harrison, Thomas Brennan, Steven Gapinski
   The Gergonne p-pile Problem and the Dynamics of the Function x | => (x + r)/p. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:103-113 [Journal]
   
8. Michael A. Henning, Hiren Maharaj
   Some General Aspects of the Framing Number of a Digraph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:115-133 [Journal]
   
9. Zhiquan Hu, Zhenhong Liu
   A Strongly Polynomial Algorithm for the Inverse Shortest Arborescence Problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:135-154 [Journal]
   
10. Mark Jerrum, Gregory B. Sorkin
    The Metropolis Algorithm for Graph Bisection. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:155-175 [Journal]
    
11. Simon Litsyn, Patrick Solé, René Struik
    On the Covering Radius of an Unrestricted Code as a Function of the Rate, Dual Distance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:177-191 [Journal]
    
12. Wayne Martin
    Fast Equi-partitioning of Rectangular Domains Using Stripe Decomposition. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:193-207 [Journal]
    
13. Carmen Ortiz, Nelson Maculan, Jayme Luiz Szwarcfiter
    Characterizing and Edge-colouring Split-indifference Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:209-217 [Journal]
    
14. Huei-Jan Shyr, Shyr-Shen Yu
    The Single Loop Representations of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:219-229 [Journal]
    
15. Nan Zhu, Kevin A. Broughan
    On Aggregating Two Linear Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:231-246 [Journal]
    
16. Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo
    Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:247-250 [Journal]
    
17. Zoltán Füredi
    On the Double Competition Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:251-255 [Journal]
    
18. Alexandros V. Gerbessiotis
    A Graph-theoretic Result for a Model of Neural Computation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:257-262 [Journal]
    
19. Martin Klazar
    On Trees and Noncrossing Partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:263-269 [Journal]
    
20. Akiyoshi Shioura
    A Constructive Proof for the Induction of M-convex Functions through Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:271-278 [Journal]