_id,doi,title
915,10.1109/CVPR.2017.530,A message passing algorithm for the minimum cost multicut problem
916,10.1109/CVPR.2017.747,A study of lagrangean decompositions and dual ascent solvers for graph matching
917,10.1109/CVPR.2017.526,A dual ascent framework for Lagrangean decomposition of combinatorial problems
1192,10.1137/1.9781611974782.20,Even delta-matroids and the complexity of planar Boolean CSPs
992,10.15479/AT:ISTA:th_815,Complexity of constraint satisfaction
1794,10.1007/s00453-015-0017-7,Inference algorithms for pattern-based CRFs on sequence data
5557,10.15479/AT:ISTA:46,Synthetic discrete tomography problems
1612,10.1007/s00012-015-0358-8,CSP for binary conservative relational structures
1353,10.1142/S0218196716500430,Deciding absorption
1377,10.1137/15M1010257,Total variation on a tree
1193,10.1109/FOCS.2016.88,Commutativity in the algorithmic Lovasz local lemma
1231,10.1007/978-3-662-49896-5_13,On the complexity of scrypt and proofs of space in the parallel random oracle model
1636,10.1007/978-3-662-48971-0_48,Effectiveness of structural restrictions for hybrid CSPs
1637,10.1109/FOCS.2015.80,The complexity of general-valued CSPs
1675,10.1007/978-3-662-48000-7_29,Proofs of space
1841,10.1109/TPAMI.2014.2363465,A new look at reweighted message passing
1859,10.1109/CVPR.2015.7298890,A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle
2271,10.1137/130945648,The power of linear programming for general-valued CSPs
2275,10.1109/ICCV.2013.365,Partial enumeration and curvature regularization
7038,,Playful Math - An introduction to mathematical games