1. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 856–857. ACM and SIAM (1999)
2. Brègman, L.M.: Certain properties of nonnegative matrices and their permanents. Doklady Akademii Nauk BSSR 211, 27–30 (1973)
3. Byskov, M., Eppstein, D.: An algorithm for enumerating maximal bipartite subgraphs (manuscript 2004)
4. Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Schöning, U.: A deterministic $(2-2/(k+1))\sp n$ algorithm for k-SAT based on local search. Theoretical Computer Science 289, 69–83 (2002)
5. Edmonds, J., Johnson, E.L.: Matching: A well-solved class of integer linear programs. In: Combinatorial Structures and their Applications, pp. 89–92. Gordon and Breach, New York (1970)