Journals in DBLP

Discrete Applied Mathematics
2007, volume: 155, number: 16

1. Kuan-Yu Chen, Kun-Mao Chao
   On the range maximum-sum segment query problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2043-2052 [Journal]
   
2. Camino Balbuena, Josep Fàbrega, Pedro García-Vázquez
   Edge-connectivity and edge-superconnectivity in sequence graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2053-2060 [Journal]
   
3. Gustav Nordh
   NP-completeness of generalized multi-Skolem sequences. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2061-2068 [Journal]
   
4. Vilas S. Kharat, B. N. Waphare, N. K. Thakare
   Reducibility number. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2069-2076 [Journal]
   
5. T. C. Edwin Cheng, L. Y. Kang, C. T. Ng
   Paired domination on interval and circular-arc graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2077-2086 [Journal]
   
6. F. H. Chang, J. Y. Guo, Frank K. Hwang, J. S. Lee
   Counting disjoint 2-partitions for points in the plane. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2087-2092 [Journal]
   
7. Vicky Mak, Natashia Boland
   Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2093-2110 [Journal]
   
8. Peter Dankelmann, Angelika Hellwig, Lutz Volkmann
   On the connectivity of diamond-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2111-2117 [Journal]
   
9. Robert W. Irving, Sandy Scott
   The stable fixtures problem - A many-to-many extension of stable roommates. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:16, pp:2118-2129 [Journal]
   
10. Bruno Martin, Claudine Peyrat
    A single-copy minimal-time simulation of a torus of automata by a ring of automata. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2130-2139 [Journal]
    
11. Jianping Li, Lusheng Wang, Hao Zhao
    On packing and coloring hyperedges in a cycle. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2140-2151 [Journal]
    
12. Martin Kutrib, Andreas Malcher
    Finite turns and the regular closure of linear context-free languages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2152-2164 [Journal]
    
13. Changhong Lu, Mingqing Zhai
    An extremal problem on non-full colorable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2165-2173 [Journal]
    
14. Palash Sarkar
    Construction of universal one-way hash functions: Tree hashing revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2174-2180 [Journal]
    
15. Stanislav Jendrol, Frantisek Kardos
    On octahedral fulleroids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2181-2186 [Journal]