Journals in DBLP

Discrete Applied Mathematics
1999, volume: 91, number: 1-3

1. Nesrine Abbas, Lorna K. Stewart
   Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:1-23 [Journal]
   
2. Christos Alexopoulos, J. Scott Provan, H. Donald Ratliff, Bryan R. Stutzman
   Minimal Connected Enclosures on an Embedded Planar Graph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:25-38 [Journal]
   
3. Noga Alon, Shmuel Onn
   Separable Partitions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:39-51 [Journal]
   
4. Zhou Bo, Bolian Liu
   Matrices with Maximum Exponents in the Class of Doubly Stochastic Primitive Matrices. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:53-66 [Journal]
   
5. Hazel Everett, Ferran Hurtado, Marc Noy
   Stabbing Information of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:67-82 [Journal]
   
6. Paul Fischer, Norbert Klasner, Ingo Wegener
   On the Cut-off Point for Combinatorial Group Testing. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:83-92 [Journal]
   
7. Susanne E. Hambrusch, Hyeong-Seok Lim
   Minimizing Broadcast Costs Under Edge Reductions in Tree Networks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:93-117 [Journal]
   
8. Peter Horák, Ljiljana Brankovic, Mirka Miller
   A Combinatorial Problem in Database Security. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:119-126 [Journal]
   
9. Robert W. Irving, David Manlove
   The b-chromatic Number of a Graph. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:127-141 [Journal]
   
10. Gary MacGilivray, Min-Li Yu
    Generalized Partitions of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:143-153 [Journal]
    
11. David Manlove
    On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:155-175 [Journal]
    
12. Jacques Mazoyer, Ivan Rapaport
    Inducing an Order on Cellular Automata by a Grouping Operation. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:177-196 [Journal]
    
13. Donatella Merlini, Douglas G. Rogers, Renzo Sprugnoli, M. Cecilia Verri
    Underdiagonal Lattice Paths with Unrestricted Steps. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:197-213 [Journal]
    
14. Vincent Moulton, Mike A. Steel
    Retractions of Finite Distance Functions Onto Tree Metrics. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:215-233 [Journal]
    
15. Giovanni Righini, Marco Trubian
    Data-dependent Bounds for the General and the Asymmetric Stacker-Crane Problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:235-242 [Journal]
    
16. Kenji Uemura, Takeo Yaku, Kimio Sugita
    Induced Permutation Automata and Coverings of Strongly Connected Automata. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:243-249 [Journal]
    
17. Stan P. M. van Hoesel, Albert P. M. Wagelmans
    On the Complexity of Postoptimality Analysis of 0/1 Programs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:251-263 [Journal]
    
18. Helen Verrall
    Compatible Hamilton Decompositions of Directed Wrapped Butterfly Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:265-275 [Journal]
    
19. Zhang Shengyuan
    On the Nonexistence of Extremal Self-dual Codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:277-286 [Journal]
    
20. Richard B. Borie, Jeremy Spinrad
    Construction of a Simple Elimination Scheme for a Chordal Comparability Graph in Linear Time. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:287-292 [Journal]
    
21. Celina M. Herrera de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter
    Even and Odd Pairs in Comparability and in P4-comparability Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:293-297 [Journal]
    
22. Jaeun Lee, Moo Young Sohn, Kyung Kim Hye
    A Note on Graphs with Large Girth, Small Minus Domination Number. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:299-303 [Journal]
    
23. András Sebö, Zeev Waksman
    Optimal Binary Trees with Order Constraints. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:91, n:1-3, pp:305-311 [Journal]