_id,doi,title
6725,10.4230/LIPICS.ICALP.2019.77,"Testing the complexity of a valued CSP language"
6032,10.1145/3230649,"Even delta-matroids and the complexity of planar boolean CSPs"
18,,"Superconcentrators of density 25.3"
5975,10.1137/16m1093306,"Commutativity in the algorithmic LovĂˇsz local lemma"
273,10.1109/cvpr.2018.00389,"Efficient optimization for rank-based loss functions"
1192,10.1137/1.9781611974782.20,"Even delta-matroids and the complexity of planar Boolean CSPs"
644,10.1137/16M1091836,"The complexity of general-valued CSPs"
274,,"A faster approximation algorithm for the Gibbs partition function"
1231,10.1007/978-3-662-49896-5_13,"On the complexity of scrypt and proofs of space in the parallel random oracle model"
1794,10.1007/s00453-015-0017-7,"Inference algorithms for pattern-based CRFs on sequence data"
1193,10.1109/FOCS.2016.88,"Commutativity in the algorithmic Lovasz local lemma"
1377,10.1137/15M1010257,"Total variation on a tree"
1636,10.1007/978-3-662-48971-0_48,"Effectiveness of structural restrictions for hybrid CSPs"
1841,10.1109/TPAMI.2014.2363465,"A new look at reweighted message passing"
1675,10.1007/978-3-662-48000-7_29,"Proofs of space"
1637,10.1109/FOCS.2015.80,"The complexity of general-valued CSPs"
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"
2272,,"Inference algorithms for pattern-based CRFs on sequence data"
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"
2273,,"Reweighted message passing revisited"
2901,,"Computing the M most probable modes of a graphical model"
2274,,"Proofs of Space"
2270,,"Optimal Coalition Structures in Cooperative Graph Games"
2276,10.1109/ICCV.2013.288,"Potts model, parametric maxflow and k-submodular functions"
2929,,"The power of linear programming for valued CSPs: a constructive characterization"
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"
5396,10.15479/AT:IST-2012-0003,"Approximating marginals using discrete energy minimization"
3257,10.1016/j.dam.2011.10.026,"Generalized roof duality and bisubmodular functions"
3284,,"The complexity of conservative valued CSPs"
2928,,"Generalized sequential tree-reweighted message passing"
2930,10.1007/978-3-642-32147-4_40,"Towards minimizing k-submodular functions"
2924,,"Bilayer Segmentation of Video"
3206,10.1109/CVPR.2011.5995361,"Submodular decomposition framework for inference in associative Markov networks with global constraints"
2925,,"Interactive Foreground Extraction using graph cut"
3207,10.1109/CVPR.2011.5995530,"Object cosegmentation"
2922,,"Graph-cut Based Image Segmentation with Connectivity Priors"
3204,10.1007/978-3-642-22993-0_37,"Submodularity on a tree: Unifying Submodularity on a tree: Unifying L-convex and bisubmodular functions convex and bisubmodular functions"
2923,,"Analyzing Convex Relaxations for MAP Estimation"
2935,,"Basic graph cut algorithms"
3205,,"Dynamic tree block coordinate ascent"
3201,10.1007/978-3-642-15552-9_34,"Cosegmentation revisited: Models and optimization"
3202,10.1007/s00453-008-9177-z,"A faster algorithm for computing the principal sequence of partitions of a graph"
2934,,"Generalized roof duality and bisubmodular functions"
2932,10.1007/s12532-009-0002-8,"Blossom V: A new implementation of a minimum cost perfect matching algorithm"
3199,10.1109/ICCV.2009.5459287,"Joint optimization of segmentation and appearance models"
3203,10.1109/ICCV.2009.5459434,"A global perspective on MAP inference for low level vision"
3197,,"An analysis of convex relaxations for MAP estimation of discrete MRFs"
3200,10.1016/j.disopt.2009.04.006,"New algorithms for convex cost tension problem with application to computer vision"
3198,10.1007/978-3-540-88688-4_44,"Feature correspondence via graph matching: Models and global optimization"
3194,10.1145/1390156.1390217,"On partial optimality in multi label MRFs"
3195,10.1109/CVPR.2008.4587440,"Graph cut based image segmentation with connectivity priors"
3196,10.1109/TPAMI.2007.70844,"A comparative study of energy minimization methods for Markov random fields with smoothness-based priors"
3193,10.1109/TPAMI.2007.1031,"Minimizing nonsubmodular functions with graph cuts - A review"
3187,10.1007/978-3-540-48113-3_27,"Fusion of stereo colour and contrast"
2933,,"An Analysis of Convex Relaxations for MAP Estimation"
3191,10.1109/ICCV.2007.4408910,"Applications of parametric maxflow in computer vision"
3192,10.1109/CVPR.2007.383203,"Optimizing binary MRFs via extended roof duality"
3186,10.1007/11744078_32,"An integral solution to surface evolution PDEs via geo cuts"
2921,10.1007/0-387-28831-7_26,"Graph cut algorithms for binocular stereo with occlusions"
3188,10.1109/CVPR.2006.91,"Cosegmentation of image pairs by histogram matching - Incorporating a global constraint into MRFs"
3190,10.1109/TPAMI.2006.200,"Convergent tree reweighted message passing for energy minimization"
3184,10.1007/11744047_1,"Comparison of energy minimization algorithms for highly connected graphs"
3189,10.1109/CVPR.2006.69,"Bilayer segmentation of live video"
3180,10.1007/11744047_2,"A comparative study of energy minimization methods for Markov random fields"
3185,10.1109/TPAMI.2006.193,"Probabilistic fusion of stereo with color and contrast for bilayer segmentation"
3181,,"On the optimality of tree reweighted max product message passing"
3175,10.1109/CVPR.2005.130,"Digital tapestry"
3182,10.1109/ICCV.2005.252,"What metrics can be approximated by geo cuts or global optimization of length area and flux"
3176,10.1109/CVPR.2005.90,"Bi-layer segmentation of binocular stereo video"
3183,10.1109/CVPR.2005.91,"Bi-layer segmentation of binocular stereo video"
3179,10.1145/1015706.1015720,""GrabCut" - Interactive foreground extraction using iterated graph cuts "
3172,10.1002/mrm.20162,"Multiprocessor scheduling implementation of the simultaneous multiple volume SMV navigator method"
3177,10.1109/CVPR.2004.1315196,"Spatially coherent clustering using graph cuts"
3173,10.1109/TPAMI.2004.1262177,"What energy functions can be minimized via graph cuts? "
3178,10.1109/TPAMI.2004.60,"An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision"
3174,10.1109/ICCV.2003.1238463,"Visual correspondence using energy minimization and mutual information"
3170,10.1109/ICCV.2003.1238310,"Computing geodesics and minimal surfaces via graph cuts"
3171,10.1007/978-3-540-45063-4_32,"Generalized multi camera scene reconstruction using graph cuts"
2927,10.1007/3-540-47977-5_5,"Multi-camera scene reconstruction via graph cuts"
3169,10.1109/ICCV.2001.937668,"Computing visual correspondence with occlusions using graph cuts"