%------------------------------------------------------------------------
% papers cited in this document 
%------------------------------------------------------------------------
@article{BK73,
        author=         "C. Bron and J. Kerbosch",
        title=          "Algorithm 457:  finding all cliques of
                        an undirected graph {H} ",
        journal=        "Comm. ACM",
        volume="16",
        number="9",
        year=           1973,
        note="Not in Mathscinet, Quality unranked.",
        pages=          "575--577"}

@article {BY86,
    AUTHOR = {Balas, Egon and Yu, Chang Sung},
     TITLE = {Finding a maximum clique in an arbitrary graph},
   JOURNAL = {SIAM J. Comput.},
  FJOURNAL = {SIAM Journal on Computing},
    VOLUME = {15},
      YEAR = {1986},
    NUMBER = {4},
     PAGES = {1054--1068},
      ISSN = {0097-5397},
     CODEN = {SMJCAT},
   MRCLASS = {05C35 (68Q20 68R10)},
  MRNUMBER = {861370 (88f:05058)},
       DOI = {10.1137/0215075},
       URL = {http://dx.doi.org/10.1137/0215075},
       note= {Quality A*},
}
@article {TT77,
    AUTHOR = {Tarjan, Robert Endre and Trojanowski, Anthony E.},
     TITLE = {Finding a maximum independent set},
   JOURNAL = {SIAM J. Comput.},
  FJOURNAL = {SIAM Journal on Computing},
    VOLUME = {6},
      YEAR = {1977},
    NUMBER = {3},
     PAGES = {537--546},
      ISSN = {0097-5397},
   MRCLASS = {05C35 (68A10)},
  MRNUMBER = {0463035 (57 \#2999)},
MRREVIEWER = {Torrence D. Parsons},
       note= {Quality A*},
}
@article {Ro85,
    AUTHOR = {Robson, J. M.},
     TITLE = {Algorithms for maximum independent sets},
   JOURNAL = {J. Algorithms},
  FJOURNAL = {Journal of Algorithms},
    VOLUME = {7},
      YEAR = {1986},
    NUMBER = {3},
     PAGES = {425--440},
      ISSN = {0196-6774},
     CODEN = {JOALDV},
   MRCLASS = {68Q20 (05-04 05C35 68R10)},
  MRNUMBER = {855568 (87k:68056)},
       DOI = {10.1016/0196-6774(86)90032-5},
       URL = {http://dx.doi.org/10.1016/0196-6774(86)90032-5},
       note= {Quality A},
}
@inproceedings {Keller_problem,
    AUTHOR = {Debroni, Jennifer and Eblen, John D. and Langston, Michael A.
              and Myrvold, Wendy and Shor, Peter and Weerapurage, Dinesh},
     TITLE = {A complete resolution of the {K}eller maximum clique problem},
 BOOKTITLE = {Proceedings of the {T}wenty-{S}econd {A}nnual {ACM}-{SIAM}
              {S}ymposium on {D}iscrete {A}lgorithms},
     PAGES = {129--135},
 PUBLISHER = {SIAM, Philadelphia, PA},
      YEAR = {2011},
   MRCLASS = {05C69 (05C75)},
  MRNUMBER = {2857115 (2012j:05297)},
       note= {Quality A*},
}
@incollection {BN93,
    AUTHOR = {Balas, Egon and Niehaus, William},
     TITLE = {Finding large cliques in arbitrary graphs by bipartite
              matching},
 BOOKTITLE = {Cliques, coloring, and satisfiability ({N}ew {B}runswick,
              {NJ}, 1993)},
    SERIES = {DIMACS Ser. Discrete Math. Theoret. Comput. Sci.},
    VOLUME = {26},
     PAGES = {29--51},
 PUBLISHER = {Amer. Math. Soc., Providence, RI},
      YEAR = {1996},
   MRCLASS = {90C35 (05C70 05C85 68R10)},
  MRNUMBER = {1423140 (97i:90098)},
  note= {Quality unranked (book not a journal)},
}