Alain Prodon

According to our database, Alain Prodon authored at least 8 papers between 1984 and 2010.

Collaborative distances:

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

2010

Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems.

Alain Prodon, Scott DeNegre, Thomas M. Liebling

Math. Program., 2010

2001

Notes on acyclic orientations and the shelling lemma.

Komei Fukuda, Alain Prodon, Tadashi Sakuma

Theor. Comput. Sci., 2001

1995

Optimal node disjoint paths on partial 2-trees: A linear algorithm and polyhedral results.

François Margot, Alain Prodon, Thomas M. Liebling

Math. Methods Oper. Res., 1995

Disjoint Paths in the Plane.

Thomas M. Liebling, François Margot, Didier Müller, Alain Prodon, Lynn Stauffer

INFORMS J. Comput., 1995

Double Description Method Revisited.

Komei Fukuda, Alain Prodon

Proceedings of the Combinatorics and Computer Science, 1995

1994

Tree polytope on 2-trees.

François Margot, Alain Prodon, Thomas M. Liebling

Math. Program., 1994

1992

Steiner trees with n terminals among n + 1 nodes.

Alain Prodon

Oper. Res. Lett., 1992

1984

A note on the separation problem for the matching matroid.

Alain Prodon

Discret. Math., 1984