@article{dmtcs:3420,
    title      = {Supermodularity on chains and complexity of maximum constraint satisfaction},
    author     = {Vladimir Deineko and Peter Jonsson and Mikael Klasson and Andrei Krokhin},
    url        = {https://dmtcs.episciences.org/3420},
    doi        = {10.46298/dmtcs.3420},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
    issuetitle = {Proceedings},
    eid        = 30,
    year       = {2005},
    month      = {Jan},
    keywords   = {maximum constraint satisfaction, complexity, supermodularity, Monge properties, digraph $H$-colouring, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]},
    language   = {English},
}