Network flows: theory, algorithms , and applications, 1993. ,
The saturation conjecture (after A. Knutson and T. Tao) with an appendix by William Fulton, Enseign. Math, vol.2, issue.46, pp.43-60, 2000. ,
Introduction to Algorithms, 2001. ,
Pictures and Standardtableaux?Grundlagen und Algorithmen, Bayreuth. Math. Schr, issue.16, pp.1-122, 1984. ,
Eigenvalues, invariant factors, highest weights, and Schubert
calculus, Bulletin of the American Mathematical Society, vol.37, issue.03, pp.209-249, 2000. ,
DOI : 10.1090/S0273-0979-00-00865-X
URL : http://arxiv.org/abs/math/9908012
Geometric algorithms and combinatorial optimization, 1993. ,
On the complexity of computing Kronecker coefficients and deciding positivity of Littlewood-Richardson coefficients. Master's thesis, 2008. ,
The honeycomb model of GL n (C) tensor products. I. Proof of the saturation conjecture, Journal of the American Mathematical Society, vol.12, issue.04, pp.1055-1090, 1999. ,
DOI : 10.1090/S0894-0347-99-00299-4
Stretched Littlewood-Richardson and Kostka coefficients, Symmetry in physics CRM Proc. Lecture Notes, pp.99-112, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00012169
The honeycomb model of GL(n) tensor products II: Puzzles determine facets of the Littlewood-Richardson cone, Journal of the American Mathematical Society, vol.17, issue.01, pp.19-48, 2004. ,
DOI : 10.1090/S0894-0347-03-00441-7
Geometric complexity theory III: On deciding positivity of Littlewood-Richardson coefficients. cs.ArXive preprint cs, p.501076, 2005. ,
On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients, Journal of Algebraic Combinatorics, vol.51, issue.2, pp.347-354, 2006. ,
DOI : 10.1007/s10801-006-0008-5
Combinatorics and geometry of Littlewood???Richardson cones, European Journal of Combinatorics, vol.26, issue.6, pp.995-1008, 2005. ,
DOI : 10.1016/j.ejc.2004.06.008