{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:50:59Z","timestamp":1725936659859},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319731162"},{"type":"electronic","value":"9783319731179"}],"license":[{"start":{"date-parts":[[2017,12,22]],"date-time":"2017-12-22T00:00:00Z","timestamp":1513900800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73117-9_34","type":"book-chapter","created":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T16:45:34Z","timestamp":1513874734000},"page":"479-492","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["House Allocation Problems with Existing Tenants and Priorities for Teacher Recruitment"],"prefix":"10.1007","author":[{"given":"Ana Paula","family":"Tom\u00e1s","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,22]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1006\/jeth.1999.2553","volume":"88","author":"A Abdulkadiro\u011flu","year":"1999","unstructured":"Abdulkadiro\u011flu, A., S\u00f6nmez, T.: House allocation with existing tenants. J. Econ. Theory 88, 233\u2013260 (1999)","journal-title":"J. Econ. Theory"},{"key":"34_CR2","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, R., Mehlhorn, K.: Popular matchings. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2005), pp. 424\u2013432. SIAM (2005)"},{"issue":"1\u20133","key":"34_CR3","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.dam.2005.06.003","volume":"125","author":"K Cechl\u00e1rov\u00e1","year":"2005","unstructured":"Cechl\u00e1rov\u00e1, K., Manlove, D.F.: The exchange-stable marriage problem. Discret. Appl. Math. 125(1\u20133), 109\u2013122 (2005)","journal-title":"Discret. Appl. Math."},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.tcs.2016.09.014","volume":"653","author":"K Cechl\u00e1rov\u00e1","year":"2016","unstructured":"Cechl\u00e1rov\u00e1, K., Fleiner, T., Manlove, D.F., McBride, I.: Stable matchings of teachers to schools. Theoret. Comput. Sci. 653, 15\u201325 (2016)","journal-title":"Theoret. Comput. Sci."},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"9","DOI":"10.2307\/2312726","volume":"69","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 69, 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"34_CR6","unstructured":"Goldberg, A.V., Kaplan, H., Hed, S., Tarjan, R.E.: Minimum cost flows in graphs with unit capacities. In: Mayr, E.W., Ollinger, N. (eds.) STACS 2015, pp. 406\u2013419 (2015)"},{"key":"34_CR7","volume-title":"The Stable Marriage Problem - Structure and Algorithms","author":"D Gusfield","year":"1989","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem - Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1007\/s00453-015-9994-9","volume":"74","author":"CC Huang","year":"2016","unstructured":"Huang, C.C., Kavitha, R., Mehlhorn, K., Michail, D.: Fair matchings and related problems. Algorithmica 74, 1184\u20131203 (2016). \nhttps:\/\/doi.org\/10.1007\/s00453-015-9994-9","journal-title":"Algorithmica"},{"key":"34_CR9","unstructured":"Irving, R.W.: Greedy matchings. University of Glasgow, Computing Science Department Research report, TR-2003-136, April 2003"},{"issue":"15","key":"34_CR10","doi-asserted-by":"crossref","first-page":"2959","DOI":"10.1016\/j.dam.2008.01.002","volume":"156","author":"RW Irving","year":"2008","unstructured":"Irving, R.W., Manlove, D.F., Scott, S.: The stable marriage problem with master preference lists. Discret. Appl. Math. 156(15), 2959\u20132977 (2008)","journal-title":"Discret. Appl. Math."},{"key":"34_CR11","unstructured":"Irving, R.W., Kavitha, T., Mehlhorn, K., Michail, D., Paluch, K.: Rank-maximal matchings. In: Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 68\u201375. SIAM (2004)"},{"key":"34_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/3-540-48523-6_41","volume-title":"Automata, Languages and Programming","author":"K Iwama","year":"1999","unstructured":"Iwama, K., Miyazaki, S., Morita, Y., Manlove, D.: Stable marriage with incomplete lists and ties. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 443\u2013452. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48523-6_41"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Krysta, P., Manlove, D., Rastegari, B., Zhang, J.: Size versus truthfulness in the House Allocation problem. In: Proceedings of the EC 2014 15th ACM Conference on Economics and Computation, pp. 453\u2013470. ACM (2014)","DOI":"10.1145\/2600057.2602868"},{"key":"34_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-319-19315-1_19","volume-title":"Combinatorial Algorithms","author":"A Kwanashie","year":"2015","unstructured":"Kwanashie, A., Irving, R.W., Manlove, D.F., Sng, C.T.S.: Profile-based optimal matchings in the student\/project allocation problem. In: Kratochv\u00edl, J., Miller, M., Froncek, D. (eds.) IWOCA 2014. LNCS, vol. 8986, pp. 213\u2013225. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-19315-1_19"},{"key":"34_CR15","doi-asserted-by":"crossref","DOI":"10.1142\/8591","volume-title":"Algorithmics of Matching Under Preferences","author":"DF Manlove","year":"2013","unstructured":"Manlove, D.F.: Algorithmics of Matching Under Preferences. World Scientific, Singapore (2013)"},{"key":"34_CR16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0304-3975(01)00206-7","volume":"276","author":"DF Manlove","year":"2002","unstructured":"Manlove, D.F., Irving, R., Iwama, K., Miyazaki, S., Morita, Y.: Hard variants of stable marriage. Theoret. Comput. Sci. 276, 261\u2013279 (2002)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"34_CR17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/2556951","volume":"10","author":"J Mestre","year":"2014","unstructured":"Mestre, J.: Weighted popular matchings. ACM Trans. Algorithms 10(1), 2 (2014)","journal-title":"ACM Trans. Algorithms"},{"key":"34_CR18","unstructured":"Niederle, M., Roth, A.E., S\u00f6nmez, T.: Matching. In: The New Palgrave Dictionary of Economics, 2nd edn. Palgrave Macmillan (2007)"},{"key":"34_CR19","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1086\/261272","volume":"92","author":"AE Roth","year":"1984","unstructured":"Roth, A.E.: The evolution of the labor market for interns and residents: a case study in game theory. J. Polit. Econ. 92, 991\u20131016 (1984)","journal-title":"J. Polit. Econ."},{"key":"34_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-4068(74)90033-0","volume":"1","author":"L Shapley","year":"1974","unstructured":"Shapley, L., Scarf, H.: On cores and indivisibility. J. Math. Econ. 1, 23\u201337 (1974)","journal-title":"J. Math. Econ."},{"key":"34_CR21","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.jda.2008.11.008","volume":"8","author":"CTS Sng","year":"2010","unstructured":"Sng, C.T.S., Manlove, D.F.: Popular matchings in the weighted capacitated house allocation problem. J. Discret. Algorithms 8, 102\u2013116 (2010)","journal-title":"J. Discret. Algorithms"},{"key":"34_CR22","volume-title":"Integer Programming","author":"LA Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. Wiley-Interscience, Hoboken (1998)"},{"key":"34_CR23","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/0377-2217(94)00358-0","volume":"90","author":"R Yuan","year":"1996","unstructured":"Yuan, R.: Residence exchange wanted: a stable residence exchange problem. Eur. J. Oper. Res. 90, 536\u2013546 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"34_CR24","unstructured":"Tom\u00e1s, A.P.: Emparelhamentos, casamentos est\u00e1veis e algoritmos de coloca\u00e7\u00e3o de professores. Technical report DCC-2005-02, DCC - FC & LIACC, University of Porto (2005). (in Portuguese). \nwww.dcc.fc.up.pt\/Pubs\/TR05\/dcc-2005-02.pdf"},{"key":"34_CR25","unstructured":"Tom\u00e1s, A.P.: Weak stable matchings with tenants and ties. Presented at CSCLP 2006: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, Lisbon, Portugal, June 2006"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2018: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73117-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,21]],"date-time":"2017-12-21T16:59:44Z","timestamp":1513875584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-73117-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,22]]},"ISBN":["9783319731162","9783319731179"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73117-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017,12,22]]}}}