Journals in DBLP

Discrete Applied Mathematics
2004, volume: 141, number: 1-3

1. Bruce A. Reed, Siang W. Song, Jayme Luiz Szwarcfiter
   Preface. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:1- [Journal]
   
2. Liliana Alcón, Marisa Gutierrez
   Cliques and extended triangles. A necessary condition for planar clique graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:3-17 [Journal]
   
3. Stéphan Ceroi, F. Havet
   Trees with three leaves are (n+1)-unavoidable. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:19-39 [Journal]
   
4. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
   Decomposition of odd-hole-free graphs by double star cutsets and 2-joins. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:41-91 [Journal]
   
5. Simone Dantas, Sylvain Gravier, Frédéric Maffray
   Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:93-101 [Journal]
   
6. Luc Devroye, Carlos Zamora-Cura
   Expected worst-case partial match in random quadtries. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:103-117 [Journal]
   
7. Luerbio Faria, Celina M. Herrera de Figueiredo, Candido Ferreira Xavier de Mendonça Neto
   On the complexity of the approximation of nonplanarity parameters for cubic graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:119-134 [Journal]
   
8. Fedor V. Fomin, Martín Matamala, Erich Prisner, Ivan Rapaport
   AT-free graphs: linear bounds for the oriented diameter. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:135-148 [Journal]
   
9. Zhicheng Gao, Jianyu Wang
   Exact enumeration of rooted 3-connected triangular maps on the projective plane. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:149-159 [Journal]
   
10. Ryan B. Hayward, William J. Lenhart
    Bichromatic P₄-composition schemes for perfect orderability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:161-183 [Journal]
    
11. Pavol Hell, Sulamita Klein, Loana Tito Nogueira, Fábio Protti
    Partitioning chordal graphs into independent sets and cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:185-194 [Journal]
    
12. Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
    Clique divergent clockwork graphs and partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:195-207 [Journal]
    
13. Lauro Lins, Sóstenes Lins, Silvio Melo
    Phorma: perfectly hashable order restricted multidimensional arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:209-223 [Journal]
    
14. Aurora Morgana, Célia Picinin de Mello, Giovanna Sontacchi
    An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:225-241 [Journal]
    
15. Lucia Draque Penso, Valmir C. Barbosa
    A distributed algorithm to find k-dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:243-253 [Journal]
    
16. Miguel A. Pizaña
    Distances and diameters on iterated clique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:255-261 [Journal]
    
17. Carlos Gustavo T. de A. Moreira, Yoshiharu Kohayakawa
    Bounds for optimal coverings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:263-276 [Journal]
    
18. Abilio Lucena, Mauricio G. C. Resende
    Strong lower bounds for the prize collecting Steiner problem in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:277-294 [Journal]