Hardness of lazy packing and coveringLING GAI; GUOCHUAN ZHANG.Operations research letters. 2009, Vol 37, Num 2, pp 89-92, issn 0167-6377, 4 p.Article

Most Tensor Problems Are NP-HardHILLAR, Christopher J; LIM, Lek-Heng.Journal of the Association for Computing Machinery. 2013, Vol 60, Num 6, issn 0004-5411, 45.1-45.39Article

COMPUTATIONAL COMPLEXITY OF HOLANT PROBLEMSCAI, Jin-Yi; PINYAN LU; MINGJI XIA et al.SIAM journal on computing (Print). 2011, Vol 40, Num 4, pp 1101-1132, issn 0097-5397, 32 p.Article

Scheduling time-dependent jobs under mixed deteriorationGAWIEJNOWICZ, Stanislaw; LIN, Bertrand M. T.Applied mathematics and computation. 2010, Vol 216, Num 2, pp 438-447, issn 0096-3003, 10 p.Article

Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteriaGAWIEJNOWICZ, Stanisław; SUWALSKI, Cezary.Computers & operations research. 2014, Vol 52, pp 135-146, issn 0305-0548, 12 p., aArticle

Shortest path and maximum flow problems in networks with additive losses and gainsBRANDENBURG, Franz J; CAI, Mao-Cheng.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 391-401, issn 0304-3975, 11 p.Article

On the complexity of deciding avoidability of sets of partial wordsBLAKELEY, Brandon; BLANCHET-SADRI, F; GUNTER, Josh et al.Theoretical computer science. 2010, Vol 411, Num 49, pp 4263-4271, issn 0304-3975, 9 p.Article

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegreeASAHIRO, Yuichi; MIYANO, Eiji; ONO, Hirotaka et al.Discrete applied mathematics. 2011, Vol 159, Num 7, pp 498-508, issn 0166-218X, 11 p.Article