| 2003 |
|---|
| 8 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. VIII. A revised theory of phase-ordered algorithms and the O( log(n2/m)/log n) bound for the nonbipartite cardinality matching problem.
Networks 41(3): 137-142 (2003) |
| 2002 |
|---|
| 7 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. VII. Primal-dual algorithms.
Networks 39(1): 35-42 (2002) |
| 2001 |
|---|
| 6 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. IV. Duality and structure theory.
Networks 37(4): 194-201 (2001) |
| 5 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. V. Cycle-canceling algorithms.
Networks 37(4): 202-209 (2001) |
| 4 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. VI. Polyhedral descriptions.
Networks 37(4): 210-218 (2001) |
| 1999 |
|---|
| 3 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. I. A unifying framework for design and analysis of matching algorithms.
Networks 33(1): 1-28 (1999) |
| 2 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. II. Simple augmentation algorithms.
Networks 33(1): 29-41 (1999) |
| 1 | EE | Christian Fremuth-Paeger,
Dieter Jungnickel:
Balanced network flows. III. Strongly polynomial augmentation algorithms.
Networks 33(1): 43-56 (1999) |
