Journals in DBLP

Discrete Applied Mathematics
2003, volume: 131, number: 2

1. Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Leonid Khachiyan
   An inequality for polymatroid functions and its applications. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:255-281 [Journal]
   
2. Vladimir I. Danilov, Gleb A. Koshevoy, C. Lang
   Gross substitution, discrete convexity, and submodularity. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:283-298 [Journal]
   
3. Madhav P. Desai, H. Narayanan, Sachin B. Patkar
   The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:299-310 [Journal]
   
4. Lisa Fleischer, Satoru Iwata
   A push-relabel framework for submodular function minimization and applications to parametric optimization. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:311-322 [Journal]
   
5. Fedor V. Fomin, Dimitrios M. Thilikos
   On the monotonicity of games generated by symmetric submodular functions. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:323-335 [Journal]
   
6. András Frank
   Restricted t-matchings in bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:337-346 [Journal]
   
7. András Frank, László Szegö
   Constructive characterizations for packing and covering with trees. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:347-371 [Journal]
   
8. András Frank, Tamás Király, Matthias Kriesell
   On decomposing a hypergraph into k connected sub-hypergraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:373-383 [Journal]
   
9. András Frank, Tamás Király, Zoltán Király
   On the orientation of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:131, n:2, pp:385-400 [Journal]
   
10. András Frank, Tamás Király
    Combined connectivity augmentation and orientation problems. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:401-419 [Journal]
    
11. Tibor Jordán
    On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:421-432 [Journal]
    
12. Kenji Kashiwabara, Takashi Takabatake
    Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:433-448 [Journal]
    
13. Kenji Kashiwabara, Yoshio Okamoto
    A greedy algorithm for convex geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:449-465 [Journal]
    
14. Kazuo Murota, Akiyoshi Shioura
    Quasi M-convex and L-convex functions--quasiconvexity in discrete optimization. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:467-494 [Journal]
    
15. Kazuo Murota, Akihisa Tamura
    New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:495-512 [Journal]
    
16. H. Narayanan
    A note on the minimization of symmetric and general submodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:513-522 [Journal]
    
17. Yoshio Okamoto, Masataka Nakamura
    The forbidden minor characterization of line-search antimatroids of rooted digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:523-533 [Journal]
    
18. Sachin B. Patkar, H. Narayanan
    Improving graph partitions using submodular functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:535-553 [Journal]
    
19. Jørgen Bang-Jensen, Stéphan Thomassé
    Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:2, pp:555-559 [Journal]