{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:35:51Z","timestamp":1743089751358,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030799861"},{"type":"electronic","value":"9783030799878"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-79987-8_20","type":"book-chapter","created":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:05:05Z","timestamp":1625007905000},"page":"282-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Study on the Existence of Null Labelling for 3-Hypergraphs"],"prefix":"10.1007","author":[{"given":"Niccol\u00f2","family":"Di Marco","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Frosini","sequence":"additional","affiliation":[]},{"given":"William Lawrence","family":"Kocay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Behrens, S., et al.: New results on degree sequences of uniform hypergraphs. Electron. J. Comb. 20(4), 14 (2013)","DOI":"10.37236\/3414"},{"key":"20_CR2","unstructured":"Berge, C.: Hypergraphs, North-Holland, Amsterdam (1989)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-32360-2_7","volume-title":"Discrete Geometry for Computer Imagery","author":"S Brlek","year":"2016","unstructured":"Brlek, S., Frosini, A.: A tomographical interpretation of a sufficient condition on h-graphical sequences. In: Normand, N., Gu\u00e9don, J., Autrusseau, F. (eds.) DGCI 2016. LNCS, vol. 9647, pp. 95\u2013104. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32360-2_7"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Colbourne, C.J., Kocay, W.L., Stinson, D.R.: Some NP-complete problems for hypergraph degree sequences. Discrete Appl. Math. 14, 239\u2013254 (1986)","DOI":"10.1016\/0166-218X(86)90028-4"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Dewdney, A.K., Degree sequences in complexes and hypergraphs. Proc. Amer. Math. Soc. 53(2), 535\u2013540 (1975)","DOI":"10.1090\/S0002-9939-1975-0384610-1"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Deza, A., Levin, A., Meesum, S.M., Onn, S.: Optimization over degree sequences. SIAM J. Disc. Math. 32(3), 2067\u20132079 (2018)","DOI":"10.1137\/17M1134482"},{"key":"20_CR7","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices (Hungarian). Math. Lapok. 11, 264\u2013274 (1960)"},{"key":"20_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2020.10.020","author":"A Frosini","year":"2021","unstructured":"Frosini, A., Kocay, W.L., Palma, G., Tarsissi, L.: On null 3-hypergraphs. Discrete Appl. Math. Press (2021). https:\/\/doi.org\/10.1016\/j.dam.2020.10.020","journal-title":"Discrete Appl. Math. Press"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-37067-0_26","volume-title":"Discrete Geometry for Computer Imagery","author":"A Frosini","year":"2013","unstructured":"Frosini, A., Picouleau, C., Rinaldi, S.: On the degree sequences of uniform hypergraphs. In: Gonzalez-Diaz, R., Jimenez, M.-J., Medrano, B. (eds.) DGCI 2013. LNCS, vol. 7749, pp. 300\u2013310. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37067-0_26"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Frosini, A., Picouleau, C., Rinaldi, S.: New sufficient conditions on the degree sequences of uniform hypergraphs. Theoret. Comput. Sci. 868, 97\u2013111 (2021)","DOI":"10.1016\/j.tcs.2021.04.006"},{"key":"20_CR11","unstructured":"Harary, F.: Graph Theory. Addison Wesley Publishing Company, Boston (1972)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Herman, G.T., Kuba, A. (eds.): Discrete Tomography: Foundations Algorithms and Applications. Birkhauser, Boston (1999)","DOI":"10.1007\/978-1-4612-1568-4"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Herman, G.T., Kuba, A. (eds.): Advances in Discrete Tomography and Its Applications (Applied and Numerical Harmonic Analysis). Birkhauser, Boston (2007)","DOI":"10.1007\/978-0-8176-4543-4"},{"key":"20_CR14","unstructured":"Kocay, W., Li, P.C.: On $$3$$-hypergraphs with equal degree sequences. Ars Combinatoria 82, 145\u2013157 (2006)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Kocay, W.: A Note on Non-reconstructible $$3$$-Hypergraphs. Graphs Comb. 32(5), 1945\u20131963 (2016)","DOI":"10.1007\/s00373-015-1671-x"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79987-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T23:12:13Z","timestamp":1625008333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79987-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030799861","9783030799878"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79987-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ottawa, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2021.eecs.uottawa.ca\/","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":"107","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":"38","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":"36% - 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.1","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":"9.1","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 workshop was held virtually.","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)"}}]}}