{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:13:18Z","timestamp":1743055998663,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"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-3-030-58150-3_22","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"274-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Realization Problems on Reachability Sequences"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Dippel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akshar","family":"Varma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"1\u20133","key":"22_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0012-365X(94)00104-Q","volume":"136","author":"M Aigner","year":"1994","unstructured":"Aigner, M., Triesch, E.: Realizability and uniqueness in graphs. Disc. Math. 136(1\u20133), 3\u201320 (1994)","journal-title":"Disc. Math."},{"issue":"6","key":"22_CR2","doi-asserted-by":"publisher","first-page":"e201302004","DOI":"10.5936\/csbj.201302004","volume":"5","author":"T Akutsu","year":"2013","unstructured":"Akutsu, T., Nagamochi, H.: Comparison and enumeration of chemical graphs. Comput. Struct. Biotechnol. J. 5(6), e201302004 (2013)","journal-title":"Comput. Struct. Biotechnol. J."},{"key":"22_CR3","volume-title":"The Probabilistic Method","author":"N Alon","year":"2016","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 4th edn. Wiley Publishing, Hoboken (2016)","edition":"4"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-01325-7_1","volume-title":"Structural Information and Communication Complexity","author":"A Bar-Noy","year":"2018","unstructured":"Bar-Noy, A., Choudhary, K., Peleg, D., Rawitz, D.: Realizability of graph specifications: characterizations and algorithms. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 3\u201313. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_1"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-10564-8_1","volume-title":"WALCOM: Algorithms and Computation","author":"A Bar-Noy","year":"2019","unstructured":"Bar-Noy, A., Choudhary, K., Peleg, D., Rawitz, D.: Graph profile realizations and applications to social networks. In: Das, G.K., Mandal, P.S., Mukhopadhyaya, K., Nakano, S. (eds.) WALCOM 2019. LNCS, vol. 11355, pp. 3\u201314. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10564-8_1"},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0012-365X(76)90098-4","volume":"16","author":"M Behzad","year":"1976","unstructured":"Behzad, M., Simpson, J.E.: Eccentric sequences and eccentric sets in graphs. Disc. Math. 16(3), 187\u2013193 (1976)","journal-title":"Disc. Math."},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.disc.2013.09.010","volume":"314","author":"A Berger","year":"2014","unstructured":"Berger, A.: A note on the characterization of digraphic sequences. Disc. Math. 314, 38\u201341 (2014)","journal-title":"Disc. Math."},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-30850-5_6","volume-title":"Experimental Algorithms","author":"A Berger","year":"2012","unstructured":"Berger, A., M\u00fcller-Hannemann, M.: How to attack the NP-complete dag realization problem in practice. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 51\u201362. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30850-5_6"},{"issue":"4","key":"22_CR9","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s002910000046","volume":"22","author":"M Ehrgott","year":"2000","unstructured":"Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4), 425\u2013460 (2000)","journal-title":"OR-Spektrum"},{"issue":"264\u2013274","key":"22_CR10","first-page":"132","volume":"11","author":"P Erdos","year":"1960","unstructured":"Erdos, P., Gallai, T.: Graphs with points of prescribed degrees. Mat. Lapok 11(264\u2013274), 132 (1960)","journal-title":"Mat. Lapok"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/0405003","volume":"5","author":"A Frank","year":"1992","unstructured":"Frank, A.: Augmenting graphs to meet edge-connectivity requirements. SIAM J. Disc. Math. 5(1), 25\u201353 (1992)","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"22_CR12","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1109\/TCT.1970.1083185","volume":"17","author":"H Frank","year":"1970","unstructured":"Frank, H., Chou, W.: Connectivity considerations in the design of survivable networks. IEEE Trans. Circ. Theory 17(4), 486\u2013490 (1970)","journal-title":"IEEE Trans. Circ. Theory"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-09174-7_35","volume-title":"Combinatorial Optimization","author":"M F\u00fcrer","year":"2014","unstructured":"F\u00fcrer, M., Yu, H.: Approximating the $$k$$-set packing problem by local improvements. In: Fouilhoux, P., Gouveia, L.E.N., Mahjoub, A.R., Paschos, V.T. (eds.) ISCO 2014. LNCS, vol. 8596, pp. 408\u2013420. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09174-7_35"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"MR Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397\u2013411 (1975)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: \u201cStrong\"NP-completeness results: motivation, examples, and implications. J. ACM (JACM) 25(3), 499\u2013508 (1978)","journal-title":"J. ACM (JACM)"},{"key":"22_CR16","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. WH Freeman and Company, San Francisco (1979)"},{"issue":"5","key":"22_CR17","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1080\/10635150390235520","volume":"52","author":"S Guindon","year":"2003","unstructured":"Guindon, S., Gascuel, O.: A simple, fast, and accurate algorithm to estimate large phylogenies by maximum likelihood. Syst. Biol. 52(5), 696\u2013704 (2003)","journal-title":"Syst. Biol."},{"issue":"3","key":"22_CR18","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. J. Soc. Ind. Appl. Math. 10(3), 496\u2013506 (1962)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"22_CR19","doi-asserted-by":"publisher","unstructured":"Harary, F.: A survey of the reconstruction conjecture. In: Graphs and Combinatorics, pp. 18\u201328. Springer (1974). https:\/\/doi.org\/10.1007\/BFb0066431","DOI":"10.1007\/BFb0066431"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-30870-3_29","volume-title":"How the World Computes","author":"S Hartung","year":"2012","unstructured":"Hartung, S., Nichterlein, A.: NP-Hardness and fixed-parameter tractability of realizing degree sequences with directed acyclic graphs. In: Cooper, S.B., Dawar, A., L\u00f6we, B. (eds.) CiE 2012. LNCS, vol. 7318, pp. 283\u2013292. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30870-3_29"},{"issue":"477\u2013480","key":"22_CR21","first-page":"1253","volume":"80","author":"V Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs. Casopis Pest. Mat. 80(477\u2013480), 1253 (1955)","journal-title":"Casopis Pest. Mat."},{"issue":"1","key":"22_CR22","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Disc. Math. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Disc. Math."},{"key":"22_CR23","unstructured":"Jiang, S., Song, Z., Weinstein, O., Zhang, H.: Faster Dynamic Matrix Inverse for Faster LPs. arXiv preprint arXiv:2004.07470 (2020)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Le Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, pp. 296\u2013303. ACM (2014)","DOI":"10.1145\/2608628.2608664"},{"issue":"4","key":"22_CR25","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF02017925","volume":"6","author":"L Lesniak","year":"1975","unstructured":"Lesniak, L.: Eccentric sequences in graphs. Periodica Math. Hungarica 6(4), 287\u2013293 (1975)","journal-title":"Periodica Math. Hungarica"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Lov\u00e1sz, L.: A note on the line reconstruction problem. In: Classic Papers in Combinatorics, pp. 451\u2013452. Springer (2009). https:\/\/doi.org\/10.1007\/978-0-8176-4842-8_35","DOI":"10.1007\/978-0-8176-4842-8_35"},{"issue":"1","key":"22_CR27","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"MV Marathe","year":"1998","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria network design problems. J. Algorithms 28(1), 142\u2013171 (1998)","journal-title":"J. Algorithms"},{"key":"22_CR28","unstructured":"Mihail, M., Vishnoi, N.K.: On generating graphs with prescribed vertex degrees for complex network modeling. In: Position Paper, Approx. and Randomized Algorithms for Communication Networks (ARACNE) 142 (2002)"},{"issue":"2","key":"22_CR29","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TNSE.2017.2776913","volume":"6","author":"E Mossel","year":"2017","unstructured":"Mossel, E., Ross, N.: Shotgun assembly of labeled graphs. IEEE Trans. Netw. Sci. Eng. 6(2), 145\u2013157 (2017)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"issue":"1\u20132","key":"22_CR30","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0166-218X(95)00074-2","volume":"69","author":"MP Ng","year":"1996","unstructured":"Ng, M.P., Wormald, N.C.: Reconstruction of rooted trees from subtrees. Disc. Appl. Math. 69(1\u20132), 19\u201331 (1996)","journal-title":"Disc. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58150-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:42:34Z","timestamp":1619206954000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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":"10.2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"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)"}}]}}