{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:18:57Z","timestamp":1725535137986},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02882-3_32","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T06:49:21Z","timestamp":1247208561000},"page":"317-327","source":"Crossref","is-referenced-by-count":2,"title":["Finding a Level Ideal of a Poset"],"prefix":"10.1007","author":[{"given":"Shuji","family":"Kijima","sequence":"first","affiliation":[]},{"given":"Toshio","family":"Nemoto","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Bhatnagar, N., Greenberg, S., Randall, D.: Sampling stable marriages: why the spouse-swapping won\u2019t work. In: Proc. of SODA 2008, pp. 1223\u20131232 (2008)"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Blair, C.: Every finite distributive lattice is a set of stable matchings. J. Comb. Theory A\u00a037, 353\u2013356 (1984)","DOI":"10.1016\/0097-3165(84)90056-6"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, C.T.: The generalized median stable matchings: finding them is not that easy. In: Proc. of Latin 2008, pp. 568\u2013579 (2008)","DOI":"10.1007\/978-3-540-78773-0_49"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order, 2nd edn. Cambridge University Press, Cambridge (2002)","DOI":"10.1017\/CBO9780511809088"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Dubhashi, D.P., Mehlhorn, K., Rajan, D., Thiel, C.: Searching, sorting and randomised algorithms for central elements and ideal counting in posets. In: Shyamasundar, R.K. (ed.) FSTTCS 1993. LNCS, vol.\u00a0761, pp. 436\u2013443. Springer, Heidelberg (1993)","DOI":"10.1007\/3-540-57529-4_75"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Month.\u00a069, 9\u201315 (1962)","DOI":"10.1080\/00029890.1962.11989827"},{"key":"32_CR7","unstructured":"Gusfield, D., Irving, R.W.: The Stable Marriage Problem, Structure and Algorithms. MIT Press, Cambridge (1989)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Irving, R.W., Leather, P.: The complexity of counting stable marriages. SIAM J. Comput.\u00a015, 655\u2013667 (1986)","DOI":"10.1137\/0215048"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Jerrum, M.: Counting, Sampling and Integrating: Algorithms and Complexity. ETH Z\u00fcrich, Birkhauser, Basel (2003)","DOI":"10.1007\/978-3-0348-8005-3"},{"key":"32_CR10","unstructured":"Kijima, S., Nemoto, T.: Randomized approximation for generalized median stable matching. RIMS-preprint 1648 (2008)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Klaus, B., Klijn, F.: Median stable matching for college admission. Int. J. Game Theory\u00a034, 1\u201311 (2006)","DOI":"10.1007\/s00182-006-0009-6"},{"key":"32_CR12","unstructured":"Klaus, B., Klijn, F.: Smith and Rawls share a room: stability and medians. Meteor RM\/08-009, Maastricht University (2008), http:\/\/edocs.ub.unimaas.nl\/loader\/file.asp?id=1307"},{"key":"32_CR13","unstructured":"Knuth, D.: Stable Marriage and Its Relation to Other Combinatorial Problems. American Mathematical Society (1991)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Propp, J., Wilson, D.B.: Exact sampling with coupled Markov chains and applications to statistical mechanics. Random Struct. Algo.\u00a09, 223\u2013252 (1996)","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O"},{"key":"32_CR15","unstructured":"Nemoto, T.: Some remarks on the median stable marriage problem. In: ISMP 2000 (2000)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Provan, J.S., Ball, M.O.: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput.\u00a012, 777\u2013788 (1983)","DOI":"10.1137\/0212053"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Roth, A.E., Sotomayor, M.A.O.: A Two-Sided Matchings: A Study In Game-Theoretic Modeling And Analysis. Cambridge University Press, Cambridge (1990)","DOI":"10.1017\/CCOL052139015X"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Sethuraman, J., Teo, C.P., Qian, L.: Many-to one stable matching: geometry and fairness. Math. Oper. Res.\u00a031, 581\u2013596 (2006)","DOI":"10.1287\/moor.1060.0207"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Schwarz, M., Yenmez, M.B.: Median stable matching. NBER Working Paper No. w14689 (2009)","DOI":"10.3386\/w14689"},{"key":"32_CR20","unstructured":"Squire, M.B.: Enumerating the ideals of a poset. preprint, North Carolina State University (1995)"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Steiner, G.: An algorithm for generating the ideals of a partial order. Oper. Res. Lett.\u00a05, 317\u2013320 (1986)","DOI":"10.1016\/0167-6377(86)90071-4"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Steiner, G.: On the complexity of dynamic programming for sequencing problems with precedence constraints. Ann. Oper. Res.\u00a026, 103\u2013123 (1990)","DOI":"10.1007\/BF02248587"},{"key":"32_CR23","doi-asserted-by":"crossref","unstructured":"Teo, C.P., Sethuraman, J.: The geometry of fractional stable matchings and its applications. Math. Oper. Res.\u00a023, 874\u2013891 (1998)","DOI":"10.1287\/moor.23.4.874"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:45:02Z","timestamp":1558421102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}