{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:09:20Z","timestamp":1742994560566,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319741796"},{"type":"electronic","value":"9783319741802"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-74180-2_2","type":"book-chapter","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T15:12:55Z","timestamp":1516029175000},"page":"15-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mixed Unit Interval Bigraphs"],"prefix":"10.1007","author":[{"given":"Ashok Kumar","family":"Das","sequence":"first","affiliation":[]},{"given":"Rajkamal","family":"Sahu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,16]]},"reference":[{"key":"2_CR1","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 \u201cproper=unit\u201d. Discret. Math. 201, 21\u201323 (1999)","journal-title":"Discret. Math."},{"key":"2_CR2","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 LBFS algorithm for recognition of unit interval graphs. Discret. Appl. Math. 138, 371\u2013379 (2004)","journal-title":"Discret. Appl. Math."},{"key":"2_CR3","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? (Extended abstract). In: Proceedings of the 9th Annual ACMSIAM Symposium on Discrete Algorithms (SODA), pp. 175\u2013180 (1998)"},{"key":"2_CR4","unstructured":"Das, A.K., Sahu, R.: A characterization of unit interval bigraphs of open and closed intervals. J. Graph Theory (under revision)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.disc.2015.10.010","volume":"339","author":"AK Das","year":"2016","unstructured":"Das, A.K., Das, S., Sen, M.: Forbidden substructure for interval digraphs\/bigraphs. Discret. Math. 339, 1028\u20131051 (2016)","journal-title":"Discret. Math."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"3357","DOI":"10.1016\/j.disc.2012.07.037","volume":"312","author":"MC Dourado","year":"2012","unstructured":"Dourado, M.C., Le, V.B., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: Mixed unit interval graphs. Discret. Math. 312, 3357\u20133363 (2012)","journal-title":"Discret. Math."},{"key":"2_CR7","series-title":"A Study of Partially Ordered Sets","volume-title":"Interval Orders Interval Graphs","author":"PC Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders Interval Graphs. A Study of Partially Ordered Sets. Wiley, New York (1985)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(87)90156-7","volume":"63","author":"P Frankl","year":"1987","unstructured":"Frankl, P., Maehara, H.: Open-interval graphs versus closed-interval graphs. Discret. Math. 63, 97\u2013100 (1987)","journal-title":"Discret. Math."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1089\/cmb.1995.2.139","volume":"2","author":"PW Goldberg","year":"1995","unstructured":"Goldberg, P.W., Golumbic, M.C., Kaplan, H., Shamir, R.: Four strikes against physical mapping of DNA. J. Comput. Biol. 2, 139\u2013152 (1995)","journal-title":"J. Comput. Biol."},{"key":"2_CR10","series-title":"Annals of Discrete Mathematics","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. North-Holland Publishing Co., Amsterdam (2004)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.20006","volume":"46","author":"P Hell","year":"2004","unstructured":"Hell, P., Huang, J.: Interval bigraphs and Circular arc graphs. J. Graph Theory. 46, 313\u2013327 (2004)","journal-title":"J. Graph Theory."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/jgt.21831","volume":"79","author":"F Joos","year":"2015","unstructured":"Joos, F.: A characterization of mixed unit interval graphs. J. Graph Theory. 79, 267\u2013281 (2015)","journal-title":"J. Graph Theory."},{"key":"2_CR13","unstructured":"Lin, I.J., West, D.B.: Interval digraphs that are indifference digraphs. In: Graph Theory, Combinatorics and Algorithms (Proceedings of the Quadrennial Conference Kalamazo, MI, 1992), pp. 751\u2013765. Wiley-Interscience (1995)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0166-218X(97)00027-9","volume":"78","author":"H M\u00fcller","year":"1997","unstructured":"M\u00fcller, H.: Recognizing interval digraphs and interval bigraphs in polynomial time. Discret. Appl. Math. 78, 189\u2013205 (1997)","journal-title":"Discret. Appl. Math."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1002\/jgt.21650","volume":"72","author":"D Rautenbach","year":"2013","unstructured":"Rautenbach, D., Szwarcfiter, J.L.: Unit interval graphs of open and closed intervals. J. Graph Theory. 72, 418\u2013429 (2013)","journal-title":"J. Graph Theory."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1137\/S0895480190177145","volume":"7","author":"M Sen","year":"1994","unstructured":"Sen, M., Sanyal, B.K.: Indifference digraphs: a generalization of indifference graphs and semi orders. SIAM J. Disc. Math. 7, 157\u2013165 (1994)","journal-title":"SIAM J. Disc. Math."},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Talon, A., Kratochv\u00edl, J.: Completion of the mixed unit interval graphs hierarchy. J. Graph Theory, 1\u201315 (2017). https:\/\/doi.org\/10.1002\/jgt.22159","DOI":"10.1002\/jgt.22159"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74180-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:50:31Z","timestamp":1709826631000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74180-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319741796","9783319741802"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74180-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/caldam2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}