Complexity of the min–max and min–max regret assignment problems
- 作者Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten
- 卷第33卷
- 期第6期
- 印刷ISSN0167-6377
- 文件大小178.85KB
- 发表时间2005
- DOI10.1016/j.orl.2004.12.002
- 页码634-640
Editors’ forewordLászló Lovász; László Babai · Combinatorica · 1986
Editors’ forewordLászló Lovász; László Babai · Combinatorica · 1987
Critical Facets of the Stable Set PolytopeLászló Lipták; László Lovász · Combinatorica · 2001
Facets with fixed defect of the stable set polytopeLászló Lipták; László Lovász · Mathematical Programming · 2000
Positive graphsAntolín Camarena, Omar; Csóka, Endre; Hubai, Tamás; Lippner, Gábor; Lovász, László · European Journal of Combinatorics · 2015
Graphs with Given Automorphism Group and Few Edge OrbitsBabai, László; Goodman, Albert J.; Lovász, László · European Journal of Combinatorics · 1991
Positive graphsHubai, Tamás; Kunszenti-Kovács, Dávid; Lovász, László · Electronic Notes in Discrete Mathematics · 2016
Extremal graph theory and finite forcibilityGrzesik, Andrzej; Král', Daniel; Lovász, László Miklós · Electronic Notes in Discrete Mathematics · 2017