. "Two algorithms for general list matrix partitions" . "P(IAA1019401), P(LN00A056), Z(AV0Z10190503), Z(MSM0021620838)" . "combinatorics; graph coloring; homomorphism"@en . "Two algorithms for general list matrix partitions"@en . . . "Two algorithms for general list matrix partitions" . "RIV/67985840:_____/05:00027504" . . "870;876" . . . "Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)" . . . "Two algorithms for general list matrix partitions"@en . "ACM, SIAM" . "Vancouver" . "7"^^ . "Dva algoritmy pro listov\u00E9 d\u011Blen\u00ED matic"@cs . . . . . "RIV/67985840:_____/05:00027504!RIV06-AV0-67985840" . "[C57CE7968C76]" . "\u010Cl\u00E1nek navrhuje dva algoritmy pro listov\u00E9 d\u011Blen\u00ED matic."@cs . "Feder, T." . . "2005-01-23+01:00"^^ . . . . "0-89871-585-7" . . "Sgall, Ji\u0159\u00ED" . . "List matrix partitions are restricted binary list constraint satisfaction problems which generalize list homomorphisms and many graph partition problems arising, e.g., in the study of perfect graphs. Most of the existing algorithms apply to concrete small matrices, i.e., to partitions into a small number of parts. We focus on two general classes of partition problems, provide algorithms for their solution, and discuss their implications."@en . "Hell, P." . "547483" . "Dva algoritmy pro listov\u00E9 d\u011Blen\u00ED matic"@cs . . "List matrix partitions are restricted binary list constraint satisfaction problems which generalize list homomorphisms and many graph partition problems arising, e.g., in the study of perfect graphs. Most of the existing algorithms apply to concrete small matrices, i.e., to partitions into a small number of parts. We focus on two general classes of partition problems, provide algorithms for their solution, and discuss their implications." . "New York, Philadelphia" . "4"^^ . . "1"^^ . "Kr\u00E1l\u00B4, D." .