   (println line))
 
 (defn sat-reduction
+  "Reduces the problem of finding a maximum bipartite subgraph to satisfiability.
+
+
+  As described in Section 5.2 of Dominik's paper."          ; todo paper name
   ([g]
    (first (drop-while #(= % nil) (map #(sat-reduction g %) (range)))))
   ([g k]

            [rolling-stones.core :as sat :refer :all]))

(defn- lt-seq
  ([xs k]
   (lt-seq xs k (Math/random)))
  ([xs k prefix]


(defn draw-ascii
  [coords]
  (let [x-step 2
        size (count coords)
        spaces (.substring (replicate-str "   " (* size x-step)) (* size x-step))
        line-contents (map (fn [i] (filter
