M. Fisher. Statistical Mechanics of Dimers on a Plane Lattice , 1961 .
 Jack Edmonds,et al. Maximum matching and a polyhedron with 0,1-vertices , 1965 .
 J. Hopcroft,et al. Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.
 Silvio Micali,et al. Priority queues with variable priority and an O(EV log V) algorithm for finding a maximal weighted matching in general graphs , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
 Jorge Nocedal,et al. On the limited memory BFGS method for large scale optimization , 1989, Math. Program..
 D. Greig,et al. Exact Maximum A Posteriori Estimation for Binary Images , 1989 .
 Jochem Zowe,et al. A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results , 1992, SIAM J. Optim..
 Olga Veksler,et al. Fast approximate energy minimization via graph cuts , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.
 Kurt Mehlhorn,et al. Implementation of O (nm log n) Weighted Matchings in General Graphs. The Power of Data Structures , 2000, Algorithm Engineering.
 David S. Watkins,et al. Cholesky-like Factorizations of Skew-Symmetric Matrices , 2000 .
 Kurt Mehlhorn,et al. Implementation of O(nmlogn) weighted matchings in general graphs: the power of data structures , 2002, JEAL.
 Martial Hebert,et al. Discriminative Fields for Modeling Spatial Dependencies in Natural Images , 2003, NIPS.
 William T. Freeman,et al. Understanding belief propagation and its generalizations , 2003 .
 Petra Mutzel,et al. Graph Embedding with Minimum Depth and Maximum External Face , 2003, Graph Drawing.
 Martin J. Wainwright,et al. Tree-based reparameterization framework for analysis of sum-product and related algorithms , 2003, IEEE Trans. Inf. Theory.
 Vladimir Kolmogorov,et al. What energy functions can be minimized via graph cuts? , 2002, IEEE Transactions on Pattern Analysis and Machine Intelligence.
 Martin J. Wainwright,et al. A new class of upper bounds on the log partition function , 2002, IEEE Transactions on Information Theory.
 Tommi S. Jaakkola,et al. Approximate inference using planar graph decomposition , 2006, NIPS.
 Mark W. Schmidt,et al. Accelerated training of conditional random fields with stochastic gradient methods , 2006, ICML.
 Vladimir Kolmogorov,et al. Minimizing Nonsubmodular Functions with Graph Cuts-A Review , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
 A. Middleton,et al. Matching Kasteleyn Cities for Spin Glass Ground States , 2007, 0706.2866.
 Simon Günter,et al. A Stochastic Quasi-Newton Method for Online Convex Optimization , 2007, AISTATS.
 F. Liers,et al. Exact ground states of large two-dimensional planar Ising spin glasses. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.