Discrete Applied Mathematics

1

Foreword

Satoru Fujishige

Journal:

Year:

2003

Language:

english

File:

PDF, 68 KB

english, 2003

2

An inequality for polymatroid functions and its applications

E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 315 KB

english, 2003

3

Gross substitution, discrete convexity, and submodularity

V.I Danilov, G.A Koshevoy, C Lang

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 187 KB

english, 2003

4

The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function

M.P Desai, H Narayanan, Sachin B Patkar

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 424 KB

english, 2003

5

A push-relabel framework for submodular function minimization and applications to parametric optimization

Lisa Fleischer, Satoru Iwata

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 281 KB

english, 2003

6

On the monotonicity of games generated by symmetric submodular functions

Fedor V. Fomin, Dimitrios M. Thilikos

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 175 KB

english, 2003

7

Combined connectivity augmentation and orientation problems

András Frank, Tamás Király

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 224 KB

english, 2003

8

Restricted t-matchings in bipartite graphs

András Frank

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 154 KB

english, 2003

9

On the orientation of graphs and hypergraphs

András Frank, Tamás Király, Zoltán Király

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 198 KB

english, 2003

10

On decomposing a hypergraph into k connected sub-hypergraphs

András Frank, Tamás Király, Matthias Kriesell

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 159 KB

english, 2003

11

Constructive characterizations for packing and covering with trees

András Frank, László Szegő

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 342 KB

english, 2003

12

On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks

Tibor Jordán

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 170 KB

english, 2003

13

Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability

Kenji Kashiwabara, Takashi Takabatake

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 424 KB

english, 2003

14

A greedy algorithm for convex geometries

Kenji Kashiwabara, Yoshio Okamoto

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 308 KB

english, 2003

15

Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization

Kazuo Murota, Akiyoshi Shioura

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 298 KB

english, 2003

16

New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities

Kazuo Murota, Akihisa Tamura

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 221 KB

english, 2003

17

A note on the minimization of symmetric and general submodular functions

H Narayanan

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 131 KB

english, 2003

18

The forbidden minor characterization of line-search antimatroids of rooted digraphs

Yoshio Okamoto, Masataka Nakamura

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 303 KB

english, 2003

19

Improving graph partitions using submodular functions

Sachin B. Patkar, H. Narayanan

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 203 KB

english, 2003

20

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

JØrgen Bang-Jensen, Stéphan Thomassé

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 112 KB

english, 2003

21

Editorial Board

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 88 KB

english, 2003

22

Guide for authors

Journal:

Discrete Applied Mathematics

Year:

2003

Language:

english

File:

PDF, 143 KB

english, 2003

Volume 131; Issue 2

Foreword

An inequality for polymatroid functions and its applications

Gross substitution, discrete convexity, and submodularity

The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function

A push-relabel framework for submodular function minimization and applications to parametric optimization

On the monotonicity of games generated by symmetric submodular functions

Combined connectivity augmentation and orientation problems

Restricted t-matchings in bipartite graphs

On the orientation of graphs and hypergraphs

On decomposing a hypergraph into k connected sub-hypergraphs

Constructive characterizations for packing and covering with trees

On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks

Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability

A greedy algorithm for convex geometries

Quasi M-convex and L-convex functions—quasiconvexity in discrete optimization

New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities

A note on the minimization of symmetric and general submodular functions

The forbidden minor characterization of line-search antimatroids of rooted digraphs

Improving graph partitions using submodular functions

Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs

Editorial Board

Contents

Guide for authors