{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:06Z","timestamp":1742913966407,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031327322"},{"type":"electronic","value":"9783031327339"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_1","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Degree Realization by\u00a0Bipartite Multigraphs"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toni","family":"B\u00f6hnlein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-79987-8_1","volume-title":"Combinatorial Algorithms","author":"A Bar-Noy","year":"2021","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Perry, M., Rawitz, D.: Relaxed and approximate graph realizations. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 3\u201319. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_1"},{"key":"1_CR2","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: On realizing a single degree sequence by a bipartite graph. In: 18th SWAT, vol. 227 of LIPIcs, pp. 1:1\u20131:17 (2022)"},{"key":"1_CR3","unstructured":"Bar-Noy, A., B\u00f6hnlein, T., Peleg, D., Rawitz, D.: On the role of the high-low partition in realizing a degree sequence by a bipartite graph. In: 47th MFCS, vol. 241 of LIPIcs, pp. 14:1\u201314:15 (2022)"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1137\/15M102527X","volume":"31","author":"D Burstein","year":"2017","unstructured":"Burstein, D., Rubin, J.: Sufficient conditions for graphicality of bidegree sequences. SIAM J. Discret. Math. 31(1), 50\u201362 (2017)","journal-title":"SIAM J. Discret. Math."},{"issue":"1\u20132","key":"1_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0012-365X(74)80016-6","volume":"7","author":"V Chungphaisan","year":"1974","unstructured":"Chungphaisan, V.: Conditions for sequences to be r-graphic. Discr. Math. 7(1\u20132), 31\u201339 (1974)","journal-title":"Discr. Math."},{"key":"1_CR6","first-page":"264","volume":"11","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices [Hungarian]. Mat. Lapok (N.S.) 11, 264\u2013274 (1960)","journal-title":"Mat. Lapok (N.S.)"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1073","DOI":"10.2140\/pjm.1957.7.1073","volume":"7","author":"D Gale","year":"1957","unstructured":"Gale, D.: A theorem on flows in networks. Pacific J. Math 7(2), 1073\u20131082 (1957)","journal-title":"Pacific J. Math"},{"key":"1_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA (1979)"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph -I. SIAM J. Appl. Math. 10(3), 496\u2013506 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs [in Czech]. Casopis Pest. Mat. 80, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"issue":"5","key":"1_CR11","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1016\/j.orl.2008.05.004","volume":"36","author":"H Hulett","year":"2008","unstructured":"Hulett, H., Will, T.G., Woeginger, G.J.: Multigraph realizations of degree sequences: maximization is easy, minimization is hard. Oper. Res. Lett. 36(5), 594\u2013596 (2008)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.disc.2012.11.027","volume":"313","author":"JW Miller","year":"2013","unstructured":"Miller, J.W.: Reduced criteria for degree sequences. Discr. Math. 313(4), 550\u2013562 (2013)","journal-title":"Discr. Math."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1137\/0115036","volume":"15","author":"AB Owens","year":"1967","unstructured":"Owens, A.B., Trent, H.M.: On determining minimal singularities for the realizations of an incidence sequence. SIAM J. Appl. Math. 15(2), 406\u2013418 (1967)","journal-title":"SIAM J. Appl. Math."},{"key":"1_CR14","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/BFb0092288","volume-title":"Combinatorics and Graph Theory","author":"SB Rao","year":"1981","unstructured":"Rao, S.B.: A survey of the theory of potentially P-graphic and forcibly P-graphic degree sequences. In: Rao, S.B. (ed.) Combinatorics and Graph Theory. LNM, vol. 885, pp. 417\u2013440. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/BFb0092288"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"371","DOI":"10.4153\/CJM-1957-044-3","volume":"9","author":"HJ Ryser","year":"1957","unstructured":"Ryser, H.J.: Combinatorial properties of matrices of zeros and ones. Can. J. Math. 9, 371\u2013377 (1957)","journal-title":"Can. J. Math."},{"issue":"1\u20133","key":"1_CR16","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/S0012-365X(02)00886-5","volume":"265","author":"A Tripathi","year":"2003","unstructured":"Tripathi, A., Vijay, S.: A note on a theorem of Erd\u00f6s & Gallai. Discr. Math. 265(1\u20133), 417\u2013420 (2003)","journal-title":"Discr. Math."},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1137\/S0895480103432477","volume":"18","author":"TG Will","year":"2004","unstructured":"Will, T.G., Hulett, H.: Parsimonious multigraphs. SIAM J. Discr. Math. 18(2), 241\u2013245 (2004)","journal-title":"SIAM J. Discr. Math."},{"issue":"1\u20133","key":"1_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0012-365X(92)90152-6","volume":"105","author":"IE Zverovich","year":"1992","unstructured":"Zverovich, I.E., Zverovich, V.E.: Contributions to the theory of graphic sequences. Discr. Math. 105(1\u20133), 293\u2013303 (1992)","journal-title":"Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32733-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:05:07Z","timestamp":1684969507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"48","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":"26","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":"54% - 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","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)"}}]}}