{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:00:25Z","timestamp":1742990425227,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"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-83508-8_36","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"499-512","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Uniform Embeddings for Robinson Similarity Matrices"],"prefix":"10.1007","author":[{"given":"Jeannette","family":"Janssen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/S0097539795285771","volume":"28","author":"JE Atkins","year":"1998","unstructured":"Atkins, J.E., Boman, E.G., Hendrickson, B.: A spectral algorithm for seriation and the consecutive ones problem. SIAM J. Comput. 28(1), 297\u2013310 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"36_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(98)00310-0","volume":"201","author":"KP Bogart","year":"1999","unstructured":"Bogart, K.P., West, D.B.: A short proof that \u2018proper = unit\u2019. Discret. Math. 201(1), 21\u201323 (1999)","journal-title":"Discret. Math."},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.ejc.2016.09.004","volume":"61","author":"H Chuangpishit","year":"2017","unstructured":"Chuangpishit, H., Ghandehari, M., Janssen, J.: Uniform linear embeddings of graphons. Eur. J. Comb. 61, 47\u201368 (2017)","journal-title":"Eur. J. Comb."},{"issue":"3","key":"36_CR4","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.dam.2003.07.001","volume":"138","author":"DG Corneil","year":"2004","unstructured":"Corneil, D.G.: A simple 3-sweep LBF algorithm for the recognition of unit interval graphs. Discret. Appl. Math. 138(3), 371\u2013379 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"36_CR5","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"DG Corneil","year":"1995","unstructured":"Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.P.: Simple linear time recognition of unit interval graphs. Inf. Process. Lett. 55(2), 99\u2013104 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"36_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"RW Floyd","year":"1962","unstructured":"Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962)","journal-title":"Commun. ACM"},{"issue":"22","key":"36_CR7","doi-asserted-by":"publisher","first-page":"2906","DOI":"10.1016\/j.disc.2006.04.043","volume":"307","author":"F Gardi","year":"2007","unstructured":"Gardi, F.: The Roberts characterization of proper and unit interval graphs. Discret. Math. 307(22), 2906\u20132908 (2007)","journal-title":"Discret. Math."},{"key":"36_CR8","doi-asserted-by":"crossref","unstructured":"Janssen, J., Zhang, Z.: Uniform embeddings for Robinson similarity matrices (2021). arXiv:2105.09197","DOI":"10.1007\/978-3-030-83508-8_36"},{"issue":"3","key":"36_CR9","doi-asserted-by":"publisher","first-page":"565","DOI":"10.2140\/pjm.1969.28.565","volume":"28","author":"D Kendall","year":"1969","unstructured":"Kendall, D.: Incidence matrices, interval graphs and seriation in archeology. Pac. J. Math. 28(3), 565\u2013570 (1969)","journal-title":"Pac. J. Math."},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.dam.2017.01.027","volume":"222","author":"M Laurent","year":"2017","unstructured":"Laurent, M., Seminaroti, M.: A Lex-BF-based recognition algorithm for Robinsonian matrices. Discret. Appl. Math. 222, 151\u2013165 (2017)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"1765","DOI":"10.1137\/16M1056791","volume":"31","author":"M Laurent","year":"2017","unstructured":"Laurent, M., Seminaroti, M.: Similarity-first search: a new algorithm with application to Robinsonian matrix recognition. SIAM J. Discret. Math. 31(3), 1765\u20131800 (2017)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"36_CR12","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1002\/sam.10071","volume":"3","author":"I Liiv","year":"2010","unstructured":"Liiv, I.: Seriation and matrix reordering methods: an historical overview. Stat. Anal. Data Min ASA Data Sci. J. 3(2), 70\u201391 (2010)","journal-title":"Stat. Anal. Data Min ASA Data Sci. J."},{"key":"36_CR13","unstructured":"Roberts, F.S.: Indifference graphs, pp. 139\u2013146. Academic Press (1969)"},{"issue":"4","key":"36_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.2307\/276978","volume":"16","author":"WS Robinson","year":"1951","unstructured":"Robinson, W.S.: A method for chronologically ordering archaeological deposits. Am. Antiq. 16(4), 293\u2013301 (1951)","journal-title":"Am. Antiq."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication. In: 30th Annual Symposium on Foundations of Computer Science, pp. 332\u2013337 (1989)","DOI":"10.1109\/SFCS.1989.63499"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T17:56:24Z","timestamp":1699293384000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_36","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":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"38% - 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":"13","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)"}}]}}