2013

Thapper, Johan and Živný, Stanislav (2013) The complexity of finite-valued CSPs. In: 45th Annual ACM on Symposium on Theory of Computing (STOC'13), Palo Alto, CA, USA, 1-4 June 2013. Published in: Proceedings of the 45th Annual ACM on Symposium on Theory of Computing (STOC'13) ISBN 9781450320290. doi:10.1145/2488608.2488697

Kolmogorov, Vladimir and Živný, Stanislav (2013) The complexity of conservative valued CSPs. Journal of the ACM, 60 (2). Article:10. doi:10.1145/2450142.2450146

Cohen, David A. , Cooper, Martin C., Escamocher, Guillaume and Živný, Stanislav (2013) Variable elimination in binary CSP via forbidden patterns. In: IJCAI-13, the Twenty-third International Conference on Artificial Intelligence, Beijing, China, 3-9 Aug 2013. Published in: Proceedings of the twenty-third International Conference on Artificial Intelligence

2012

Thapper, Johan and Živný, Stanislav (2012) The Power of Linear Programming for Valued CSPs. In: 53rd Annual Symposium on Foundations of Computer Science (FOCS'12), New Brunswick, NJ, 20-23 Oct. 2012. Published in: Proceedings of the 53rd Annual Symposium on Foundations of Computer Science (FOCS'12) pp. 669-678. ISBN 9780769548746. ISSN 0272-5428. doi:10.1109/FOCS.2012.25

2011

Cooper, Martin C. and Živný, Stanislav (2011) Hybrid tractability of valued constraint problems. Artificial Intelligence, 175 (9-10). pp. 1555-1569. doi:10.1016/j.artint.2011.02.003