| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A greedy algorithm for convex geometries
|
Kashiwabara, Kenji
|
|
2003
|
131 |
2 |
p. 449-465
17 p.
|
article
|
| 2 |
An inequality for polymatroid functions and its applications
|
Boros, E.
|
|
2003
|
131 |
2 |
p. 255-281
27 p.
|
article
|
| 3 |
A note on the minimization of symmetric and general submodular functions
|
Narayanan, H
|
|
2003
|
131 |
2 |
p. 513-522
10 p.
|
article
|
| 4 |
A push-relabel framework for submodular function minimization and applications to parametric optimization
|
Fleischer, Lisa
|
|
2003
|
131 |
2 |
p. 311-322
12 p.
|
article
|
| 5 |
Combined connectivity augmentation and orientation problems
|
Frank, András
|
|
2003
|
131 |
2 |
p. 401-419
19 p.
|
article
|
| 6 |
Constructive characterizations for packing and covering with trees
|
Frank, András
|
|
2003
|
131 |
2 |
p. 347-371
25 p.
|
article
|
| 7 |
Contents
|
|
|
2003
|
131 |
2 |
p. viii-ix
nvt p.
|
article
|
| 8 |
Editorial Board
|
|
|
2003
|
131 |
2 |
p. v-vii
nvt p.
|
article
|
| 9 |
Foreword
|
Fujishige, Satoru
|
|
2003
|
131 |
2 |
p. 253-254
2 p.
|
article
|
| 10 |
Gross substitution, discrete convexity, and submodularity
|
Danilov, V.I
|
|
2003
|
131 |
2 |
p. 283-298
16 p.
|
article
|
| 11 |
Guide for authors
|
|
|
2003
|
131 |
2 |
p. 561-564
4 p.
|
article
|
| 12 |
Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs
|
Bang-Jensen, JØrgen
|
|
2003
|
131 |
2 |
p. 555-559
5 p.
|
article
|
| 13 |
Improving graph partitions using submodular functions
|
Patkar, Sachin B.
|
|
2003
|
131 |
2 |
p. 535-553
19 p.
|
article
|
| 14 |
New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities
|
Murota, Kazuo
|
|
2003
|
131 |
2 |
p. 495-512
18 p.
|
article
|
| 15 |
On decomposing a hypergraph into k connected sub-hypergraphs
|
Frank, András
|
|
2003
|
131 |
2 |
p. 373-383
11 p.
|
article
|
| 16 |
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
|
Jordán, Tibor
|
|
2003
|
131 |
2 |
p. 421-432
12 p.
|
article
|
| 17 |
On the monotonicity of games generated by symmetric submodular functions
|
Fomin, Fedor V.
|
|
2003
|
131 |
2 |
p. 323-335
13 p.
|
article
|
| 18 |
On the orientation of graphs and hypergraphs
|
Frank, András
|
|
2003
|
131 |
2 |
p. 385-400
16 p.
|
article
|
| 19 |
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
|
Kashiwabara, Kenji
|
|
2003
|
131 |
2 |
p. 433-448
16 p.
|
article
|
| 20 |
Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization
|
Murota, Kazuo
|
|
2003
|
131 |
2 |
p. 467-494
28 p.
|
article
|
| 21 |
Restricted t-matchings in bipartite graphs
|
Frank, András
|
|
2003
|
131 |
2 |
p. 337-346
10 p.
|
article
|
| 22 |
The forbidden minor characterization of line-search antimatroids of rooted digraphs
|
Okamoto, Yoshio
|
|
2003
|
131 |
2 |
p. 523-533
11 p.
|
article
|
| 23 |
The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function
|
Desai, M.P
|
|
2003
|
131 |
2 |
p. 299-310
12 p.
|
article
|
Journal description