Christian Fremuth-Paeger

According to our database, Christian Fremuth-Paeger authored at least 9 papers between 1997 and 2003.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2003

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.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 2003

2002

Balanced network flows. VII. Primal-dual algorithms.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 2002

2001

Balanced network flows. VI. Polyhedral descriptions.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 2001

Balanced network flows. V. Cycle-canceling algorithms.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 2001

Balanced network flows. IV. Duality and structure theory.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 2001

1999

Balanced network flows. III. Strongly polynomial augmentation algorithms.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 1999

Balanced network flows. II. Simple augmentation algorithms.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 1999

Balanced network flows. I. A unifying framework for design and analysis of matching algorithms.

Christian Fremuth-Paeger, Dieter Jungnickel

Networks, 1999

1997

Degree constrained subgraph problems and network flow optimization.

Christian Fremuth-Paeger

PhD thesis, 1997