{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:01Z","timestamp":1759639081345,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030967307"},{"type":"electronic","value":"9783030967314"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-96731-4_25","type":"book-chapter","created":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:03:49Z","timestamp":1647389029000},"page":"303-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Finding Popular Branchings in Vertex-Weighted Digraphs"],"prefix":"10.1007","author":[{"given":"Kei","family":"Natsui","sequence":"first","affiliation":[]},{"given":"Kenjiro","family":"Takazawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,16]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Abraham, D.J., Irving, R.W., Kavitha, T., Mehlhorn, K.: Popular matchings. SIAM J. Comput. 37, 1030\u20131045 (2007)","DOI":"10.1137\/06067328X"},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Bir\u00f3, P., Irving, R.W., Manlove, D.F.: Popular matchings in the marriage and roommates problems. In: Calamoneri, T., Diaz, J. (eds.) CIAC 2010. LNCS, vol. 6078, pp. 97\u2013108. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13073-1_10","DOI":"10.1007\/978-3-642-13073-1_10"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Cseh, \u00c1., Huang, C.-C., Kavitha, T.: Popular matchings with two-sided preferences and one-sided ties. SIAM J. Discr. Math. 31(4), 2348\u20132377 (2017)","DOI":"10.1137\/16M1076162"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Cseh, \u00c1., Kavitha, T.: Popular edges and dominant matchings. Math. Programm. 172(1), 209\u2013229 (2017)","DOI":"10.1007\/s10107-017-1183-y"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Stud. Integer Programm. Ann. Discr. Math. 185\u2013204 (1977)","DOI":"10.1016\/S0167-5060(08)70734-9"},{"key":"25_CR6","first-page":"63","volume":"41","author":"A Frank","year":"1979","unstructured":"Frank, A.: Kernel systems of directed graphs. Acta Scientiarum Mathematicarum 41, 63\u201376 (1979)","journal-title":"Acta Scientiarum Mathematicarum"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Fulkerson, D.R.: Packing rooted directed cuts in a weighted directed graph. Math. Programm. 6(1), 1\u201313 (1974)","DOI":"10.1007\/BF01580218"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Fenza, Y., Kavitha, T.: Quasi-popular matchings, optimality, and extended formulations. In: Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020), pp. 325\u2013344 (2020)","DOI":"10.1137\/1.9781611975994.20"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"G\u00e4rdenfors, P.: Match making: assignments based on bilateral preferences. Behav. Sci. 20(3), 166\u2013173 (1975)","DOI":"10.1002\/bs.3830200304"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Kavitha, T., Nasre, M.: Optimal popular matchings. Discr. Appl. Math. 157(14), 3181\u20133186 (2009)","DOI":"10.1016\/j.dam.2009.06.004"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Kavitha, T., Kir\u00e1ly, T., Matuschke, J., Schlotter, I., Schmidt-Kraepelin, U.: Popular branchings and their dual certificates. In: Bienstock, D., Zambelli, G. (eds.) IPCO 2020. LNCS, vol. 12125, pp. 223\u2013237. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45771-6_18","DOI":"10.1007\/978-3-030-45771-6_18"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Mestre, J.: Weighted popular matchings. ACM Trans. Algor. 10(1), 1\u201316 (2014)","DOI":"10.1145\/2556951"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-96731-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,16]],"date-time":"2022-03-16T00:06:56Z","timestamp":1647389216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-96731-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030967307","9783030967314"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-96731-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"16 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Jember","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Indonesia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 March 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 March 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/walcom2022.unej.ac.id\/","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":"89","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":"30","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":"0","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":"34% - 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":"2-9","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":"The proceedings also include 3 invited papers.","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)"}}]}}