@article{Batagelj2005,
  title = {Efficient generation of large random networks},
  author = {Batagelj, Vladimir and Brandes, Ulrik},
  journal = {Phys. Rev. E},
  volume = {71},
  issue = {3},
  pages = {036113},
  numpages = {5},
  year = {2005},
  month = {Mar},
  publisher = {American Physical Society},
  doi = {10.1103/PhysRevE.71.036113},
  url = {http://link.aps.org/doi/10.1103/PhysRevE.71.036113}
}

@book{gareyJohnson,
author = {M.R. Garey and D.S. Johnson},
title = {Computers and Intractability},
publisher = {W.H. Freeman and Co},
year = 1979}

@inproceedings{cp01,
author = {I.P. Gent and R.W. Irving and D.F. Manlove and P. Prosser and B.M. Smith},
title = {A constraint programming approach to the stable marriage problem}, 
booktitle = {CP'01}, 
pages = {225--239},
year = 2001}

@inproceedings{ecai02,
author = {I.P. Gent and P. Prosser},
title = {An empirical study of the stable marriage problem with ties and incomplete lists}, 
booktitle = {ECAI'02}, 
year = 2002}

@ARTICLE{gs62,
        AUTHOR             = {D. Gale and L.S. Shapley},
        JOURNAL            = {American Mathematical Monthly},
        PAGES              = {9-15},
        TITLE              = {{College admissions and the stability of marriage}},
        VOLUME             = {69},
        YEAR               = {1962},
        ANNOTE             = {f}
}

@BOOK{gi89,
        AUTHOR             = {D. Gusfield and R. W. Irving},
        PUBLISHER          = {The MIT Press},
        TITLE              = {The Stable Marriage Problem: Structure and Algorithms},
        YEAR               = {1989}
}


@Misc{MIIMM,
  author    = {David Manlove and
               Robert W. Irving and
               Kazuo Iwama and
               Shuichi Miyazaki and
               Yasufumi Morita},
  title     = {Hard variants of stable marriage},
  journal   = {Theor. Comput. Sci.},
  volume    = {276},
  number    = {1-2},
  pages     = {261--279},
  year      = {2002}
}

@article{Roth84,
   author = {A.E. Roth},
   journal = {Journal of Political Economy},
   number = {6},
   pages = {991-1016},
   title = {The evolution of the labor market for medical interns and residents: a case study in game theory},
   volume = {92},
   year = {1984}
}

@article{GS85,
   author = {D. Gale and M. Sotomayor},
   journal = {Discrete Applied Mathematics},
   pages = {223-232},
   title = {Some remarks on the stable matching problem},
   volume = {11},
   year = {1985}
}

@Article{VV89,
  author = 	 {J.E. Vande Vate},
  title = 	 {Linear programming brings marital bliss},
  journal = 	 {Operations Research Letters},
  year = 	 {1989},
  OPTvolume = 	 {8},
  OPTnumber = 	 {3},
  OPTpages = 	 {147-153},
}

@Book{RS90,
  author = 	 {A.E. Roth and M.A.O. Sotomayor},
  title = 	 {Two-sided matching: a study in game-theoretic modeling and analysis},
  publisher = 	 {Cambridge University Press},
  year = 	 {1990},
  volume = 	 {18},
  series = 	 {Econometric Society Monographs},
}

@article{NH91,
   author = {C. Ng and D.S. Hirschberg},
   journal = {SIAM Journal on Discrete Mathematics},
   pages = {245-252},
   title = {Three-dimensional stable matching problems},
   volume = {4},
   year = {1991}
}

@Book{manlove2013,
  author = 	 {David Manlove},
  title = 	 {Algorithmics of Matching under Preferences},
  publisher = 	 {World Scientific},
  year = 	 {2013},
  volume = 	 {2},
  series = 	 {Theoretical Computer Science},
}

@article{Ron90,
   author = {E. Ronn},
   journal = {Journal of Algorithms},
   pages = {285-304},
   title = {{NP}-complete stable matching problems},
   volume = {11},
   year = {1990}
}

@article{nh90,
   author = {C. Ng and D.S. Hirschberg},
   journal = {{SIAM} Journal on Computing},
   pages = {71-77},
   title = {Lower bounds for the stable marriage problem and its variants},
   volume = {19},
   year = {1990}
}

@Misc{choco,
title = {{choco constraint programming system}},
howpublished = {http://choco.sourceforge.net/}
}

@Misc{JSolver,
title = {{ILOG JSolver}},
howpublished = {http://www.ilog.com/products/jsolver/}
}

@inproceedings{ijcai05a,
Author = {D.F. Manlove and G. O'Malley},
Pages = {10-17},
booktitle = {Proceedings of the Fifth Workshop on Modelling and Solving Problems with Constraints, held at the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005)},
Title = {Modelling and solving the stable marriage problem using constraint programming}, 
Year = {2005}}

@inproceedings{ijcai05b,
Author = {C. Unsworth and P. Prosser},
booktitle = {Proceedings of the Fifth Workshop on Modelling and Solving Problems with Constraints, held at the 19th International 
Joint Conference on Artificial Intelligence (IJCAI 2005)},
Title = {An n-ary Constraint for the Stable Marriage Problem}, 
Year = {2005}}

@article{Irving85,
  author    = {Robert W. Irving},
  title     = {{An Efficient Algorithm for the Stable Roommates Problem}},
  journal   = {J. Algorithms},
  volume    = {6},
  number    = {4},
  year      = {1985},
  pages     = {577-595}
}

@article{pittel94,
  author    = {Boris Pittel and
               Robert W. Irving},
  title     = {An Upper Bound for the Solvability of a Random Stable Roommates
               Instance},
  journal   = {Random Struct. Algorithms},
  volume    = {5},
  number    = {3},
  year      = {1994},
  pages     = {465-487}
}

@article{mertens2015a,
  author={Stephan Mertens},
  title={Stable roommates problem with random preferences},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  volume={2015},
  number={1},
  pages={P01020},
  url={http://stacks.iop.org/1742-5468/2015/i=1/a=P01020},
  year={2015},
  abstract={The stable roommates problem with n agents has worst case complexity O ( n 2 ) in time and space. Random instances can be solved faster and with less memory, however. We introduce an algorithm that has average time and space complexity ##IMG## [http://ej.iop.org/images/1742-5468/2015/1/P01020/jstat507009ieqn001.gif] {$O(n^{\frac{3}{2}})$} for random instances. We use this algorithm to simulate large instances of the stable roommates problem and to measure the probabilty p n that a random instance of size n admits a stable matching. Our data support the conjecture that p n = Θ( n −1/4 ).}
}

@article{mertens2015b,
  author={Stephan Mertens},
  title={Small random instances of the stable roommates problem},
  journal={Journal of Statistical Mechanics: Theory and Experiment},
  volume={2015},
  number={6},
  pages={P06034},
  url={http://stacks.iop.org/1742-5468/2015/i=6/a=P06034},
  year={2015},
  abstract={Let p n denote the probability that a random instance of the stable roommates problem of size n admits a solution. We derive an explicit formula for p n and compute exact values of p n for n  ⩽ 12.}
}

@article{mertens2005,
  author    = {Stepan Mertens},
  title     = {Random stable matchings},
  journal   = {{Journal of Statistical Mechanics: Theory and Experiments}},
  pages = {P10008},
  number = {10},
  year      = {2005}
}



@inbook{optimalRob,
	      Author = {Irving,R.W.},
	      Title = {Encyclopedia of Algorithms}, 
                          Chapter = {Optimal Stable Marriage},
                          ISBN =
	      {978-0-387-30770-1},
	      Publisher =
	      {Springer},
	      Year = {2008}}

@inproceedings{ckt,
    author = {Peter Cheeseman and Bob Kanefsky and William M. Taylor},
    title = {Where the really hard problems are},
    booktitle = {},
    year = {1991},
    pages = {331--337},
    publisher = {Morgan Kaufmann}
}

@article{nature393,
 author = {Duncan J.Watts and Steven H.Strogatz},
 title = {Collective dynamics of small-world networks},
 journal = {Nature},
 volume = 393,
 pages = {440--442},
 year = {1998}
}

@inproceedings{morph99,
  author    = {Ian P. Gent and
               Holger H. Hoos and
               Patrick Prosser and
               Toby Walsh},
  title     = {Morphing: Combining Structure and Randomness},
  booktitle = {Proceedings of the Sixteenth National Conference on Artificial Intelligence},
  pages     = {654--660},
  year      = {1999}
}

@article{shuffle,
 author = {Richard Durstenfeld},
 title = {Algorithm 235: Random permutation},
 journal = {CACM},
 volume = 7,
issue = 7,
 pages = {420},
 year = {1964}
}

@Misc{choco,
title = {{choco constraint programming system}},
howpublished = {http://choco.sourceforge.net/}
}

@Misc{roommates,
title = {{Stable Roommates}},
howpublished = {http://www.dcs.gla.ac.uk/$\sim$pat/roommates/distribution}
}

@inproceedings{cpaior2014,
  author    = {Patrick Prosser},
  title     = {Stable Roommates and Constraint Programming},
  booktitle = {Integration of {AI} and {OR} Techniques in Constraint Programming
               - 11th International Conference, {CPAIOR}},
  pages     = {15--28},
  year      = {2014},
  crossref  = {DBLP:conf/cpaior/2014},
  url       = {http://dx.doi.org/10.1007/978-3-319-07046-9_2},
  doi       = {10.1007/978-3-319-07046-9_2},
  timestamp = {Mon, 12 May 2014 13:47:06 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/cpaior/Prosser14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}