_id,doi,title
2518,10.1007/978-3-642-39206-1_53,The power of linear programming for finite-valued CSPs: A constructive characterization
2828,10.1145/2450142.2450146,The complexity of conservative valued CSPs
2901,,Computing the M most probable modes of a graphical model
2270,,Optimal Coalition Structures in Cooperative Graph Games
2272,,Inference algorithms for pattern-based CRFs on sequence data
2273,,Reweighted message passing revisited
2274,,Proofs of Space
2276,10.1109/ICCV.2013.288,"Potts model, parametric maxflow and k-submodular functions"
2928,,Generalized sequential tree-reweighted message passing
2930,10.1007/978-3-642-32147-4_40,Towards minimizing k-submodular functions
2931,10.1109/TPAMI.2012.105,A dual decomposition approach to feature correspondence
3117,10.1016/j.dam.2012.05.025,Minimizing a sum of submodular functions
3124,,Approximating marginals using discrete energy minimization
3257,10.1016/j.dam.2011.10.026,Generalized roof duality and bisubmodular functions
5396,10.15479/AT:IST-2012-0003,Approximating marginals using discrete energy minimization