( en | de | ru )

 

Disambiguation of "Feo, A."

Author of the publication

copydeleteadd this publication to your clipboard
Study of dynamical supersymmetry breaking for the two dimensional lattice Wess-Zumino model

, , , and . AIP Conf. Proc., (2005)
DOI: 10.1063/1.1921022

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Feo Weingartner

Maria Alekseevna Feoktistova

Alexey Feofanov

Anatoli Feoktistow

Fritz-Feo Grabley

 

Other publications of authors with the same name

Study of dynamical supersymmetry breaking for the two dimensional lattice Wess-Zumino model, , , and . AIP Conf. Proc., (2005)Study of dynamical supersymmetry breaking for the two dimensional lattice Wess-Zumino model, , , and . (2004)cite arxiv:hep-lat/0412020 Comment: 4 pages, 1 figure, Talk presented at Quark Confinement and the Hadron Spectrum VI, Villasimius, Sardinia, Italy, September 21-25, 2004.The High Density Region of QCD from an Effective Model, , , and . (2007)cite arxiv:0710.3102Comment: 7 pages, 5 figures, talk presented at the XXVth International Symposium on Lattice Field Theory, July 30 - August 4 2007, Regensburg, Germany.Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP., , and . ACM Trans. Math. Softw., 24 (4): 386-394 (1998)Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs., and . Operations Research, 41 (3): 572-582 (1993)A GRASPTM for a difficult single machine scheduling problem, ., , and . Comput. Oper. Res., 18 (8): 635-643 (1991)OR Practice - Lagrangian Relaxation for Testing Infeasibility in VLSI Routing., and . Operations Research, 34 (6): 819-831 (1986)The Delta-Wye Approximation Procedure for Two-Terminal Reliability., , and . Operations Research, 44 (5): 745-757 (1996)A class of bounded approximation algorithms for graph partitioning., and . Networks, 20 (2): 181-195 (1990)A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties., , and . Comput. Oper. Res., 23 (9): 881-895 (1996)