{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T02:21:13Z","timestamp":1764210073419,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789813343696"},{"type":"electronic","value":"9789813343702"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-981-33-4370-2_29","type":"book-chapter","created":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:29:33Z","timestamp":1605745773000},"page":"411-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Finding Maximum Stable Matchings for the Student-Project Allocation Problem with Preferences Over Projects"],"prefix":"10.1007","author":[{"given":"Hoang Huu","family":"Viet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Le","family":"Van Tan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Son Thanh","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,19]]},"reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10479-017-2710-1","volume":"275","author":"M Chiarandini","year":"2017","unstructured":"Chiarandini, M., Fagerberg, R., Gualandi, S.: Handling preferences in student-project allocation. Ann. Oper. Res. 275(1), 39\u201378 (2017). https:\/\/doi.org\/10.1007\/s10479-017-2710-1","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"29_CR2","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.jda.2008.07.003","volume":"6","author":"DF Manlove","year":"2008","unstructured":"Manlove, D.F., O\u2019Malley, G.: Student-project allocation with preferences over projects. J. Discrete Algorithms 6(4), 553\u2013560 (2008)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","volume":"9","author":"D Gale","year":"1962","unstructured":"Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Am. Math. Monthly 9(1), 9\u201315 (1962)","journal-title":"Am. Math. Monthly"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search for stable marriage problems with ties and incomplete lists. In: Proceedings of 11th Pacific Rim International Conference on Artificial Intelligence. pp. 64\u201375. Daegu, Korea (August 2010)","DOI":"10.1007\/978-3-642-15246-7_9"},{"issue":"4","key":"29_CR5","doi-asserted-by":"publisher","first-page":"591","DOI":"10.3390\/a6040591","volume":"6","author":"M Gelain","year":"2013","unstructured":"Gelain, M., Pini, M.S., Rossi, F., Venable, K.B., Walsh, T.: Local search approaches in stable matching problems. Algorithms 6(4), 591\u2013617 (2013)","journal-title":"Algorithms"},{"issue":"1","key":"29_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.jda.2012.02.001","volume":"13","author":"K Iwama","year":"2012","unstructured":"Iwama, K., Miyazaki, S., Yanagisawa, H.: Improved approximation bounds for the student-project allocation problem with preferences over projects. J. Discrete Algorithms 13(1), 59\u201366 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.jda.2006.03.006","volume":"5","author":"DJ Abraham","year":"2007","unstructured":"Abraham, D.J., Irving, R.W., Manlove, D.F.: Two algorithms for the student-project allocation problem. J. Discrete Algorithms 5(1), 73\u201390 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"29_CR8","unstructured":"Kazakov, D.: Co-ordination of student-project allocation. Manuscript, University of York, Department of Computer Science http:\/\/www-users.cs.york.ac.uk\/kazakov \/papers\/proj.pdf (2001)"},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00453-009-9371-710.1007\/s00453-009-9371-7","volume":"60","author":"Z Kir\u00e1ly","year":"2011","unstructured":"Kir\u00e1ly, Z.: Better and simpler approximation algorithms for the stable marriage problem. Algorithmica 60(1), 3\u201320 (2011). https:\/\/doi.org\/10.1007\/s00453-009-9371-710.1007\/s00453-009-9371-7","journal-title":"Algorithmica"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Kwanashie, A., Irving, R.W., Manlove, D.F., Sng, C.T.S.: Profile-based optimal matchings in the student\/project allocation problem. In: Proceedings of 25th International Workshop on Combinatorial Algorithms, pp. 213\u2013225. Duluth, USA (15\u201317 October 2014)","DOI":"10.1007\/978-3-319-19315-1_19"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Manlove, D., Milne, D., Olaosebikan, S.: An integer programming approach to the student-project allocation problem with preferences over projects. In: Proceedings of 5th International Symposium on Combinatorial Optimization, pp. 313\u2013325. Morocco (April 2018)","DOI":"10.1007\/978-3-319-96151-4_27"},{"issue":"1\u20133","key":"29_CR12","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artif. Intell. 58(1\u20133), 161\u2013205 (1992)","journal-title":"Artif. Intell."},{"key":"29_CR13","volume-title":"Artificial Intelligence: A Modern Approach","author":"S Russel","year":"2009","unstructured":"Russel, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 3rd edn. Prentice Hall Press, Upper Saddle River (2009)","edition":"3"}],"container-title":["Communications in Computer and Information Science","Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-33-4370-2_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T01:03:18Z","timestamp":1619312598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-33-4370-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789813343696","9789813343702"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-33-4370-2_29","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FDSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Future Data and Security Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Quy Nhon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fdse2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.thefdse.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.5 avg. reviewers\/paper (for two submission rounds in total). LNCS 12466 includes 24 of the accepted papers and 2 invited keynotes. CCIS 1306 includes 29 full and 8 short of the accepted papers. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}