{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T17:19:06Z","timestamp":1725815946427},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319149738"},{"type":"electronic","value":"9783319149745"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-14974-5_12","type":"book-chapter","created":{"date-parts":[[2015,1,27]],"date-time":"2015-01-27T20:23:50Z","timestamp":1422390230000},"page":"117-125","source":"Crossref","is-referenced-by-count":1,"title":["New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs"],"prefix":"10.1007","author":[{"given":"Ashok Kumar","family":"Das","sequence":"first","affiliation":[]},{"given":"Ritapa","family":"Chakraborty","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Basu, A., Das, S., Ghosh, S., Sen, M.: Circular arc bigraphs and its subclasses. J. of Graph Theory (73), 361\u2013376 (2013)","DOI":"10.1002\/jgt.21681"},{"key":"12_CR2","unstructured":"Brown, D.E., Lundgren, J.R.: Characterization for unit interval bigraphs. In: Proceedings of the Forty-First Southeastern International Conference on Combinatorics, Graph Theory and Computing. Congr. Number. 206, 517 (2010)"},{"key":"12_CR3","unstructured":"Brown, D.E., Lundgren, J.R., Flink, S.C.: Characterization of interval bigraphs and unit interval bigraphs. Congress Number (2002)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Das, A.K., Chakraborty, R.: New characterization of proper interval bigraphs. Accepted for Publication in International Journal of Graphs and Combinatorics 12(1) (June 2015)","DOI":"10.1016\/j.akcej.2015.06.007"},{"key":"12_CR5","unstructured":"Das, A.K., Das, S., Sen, M.K.: Forbidden substructure of interval (bi\/di) graphs. Submitted to Discrete Math. (2014)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1137\/S0097539792269095","volume":"25","author":"X. Deng","year":"1996","unstructured":"Deng, X., Hell, P., Huang, J.: Linear time representation of proper circular arc graphs and proper interval graphs. SIAM J. Comput.\u00a025, 390\u2013403 (1996)","journal-title":"SIAM J. Comput."},{"key":"12_CR7","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Annals of Discrete Mathematics (2014)"},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1137\/S0895480103430259","volume":"18","author":"P. Hell","year":"2004","unstructured":"Hell, P., Huang, J.: Certifying LexBFS recognition algorithm for proper interval graphs and proper interval bigraphs. SIAM J. Discrete Math.\u00a018(3), 554\u2013570 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Hell, P., Huang, J.: Interval bigraphs and circular arc graphs. J. of Graph Theory\u00a0(46), 313\u2013327 (2004)","DOI":"10.1002\/jgt.20006"},{"key":"12_CR10","first-page":"201","volume":"125","author":"I.J. Lin","year":"1997","unstructured":"Lin, I.J., Sen, M.K., West, D.B.: Class of interval digraphs and 0, 1- matrices. Congressus Num.\u00a0125, 201\u2013209 (1997)","journal-title":"Congressus Num."},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-003-1032-7","volume":"37","author":"R.M. McConnell","year":"2003","unstructured":"McConnell, R.M.: Linear time recognition of circular arc graphs. Algorithms\u00a037(2), 93\u2013147 (2003)","journal-title":"Algorithms"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1002\/(SICI)1097-0118(199608)22:4<297::AID-JGT3>3.0.CO;2-G","volume":"22","author":"B.K. Sanyal","year":"1996","unstructured":"Sanyal, B.K., Sen, M.K.: New characterization of digraphs represented by intervals. J. of Graph Theory\u00a022, 297\u2013303 (1996)","journal-title":"J. of Graph Theory"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1002\/jgt.3190130508","volume":"13","author":"M. Sen","year":"1989","unstructured":"Sen, M., Das, S., West, D.B.: Circular arc digraphs: A characterization. J.of Graph Theory\u00a013, 581\u2013592 (1989)","journal-title":"J.of Graph Theory"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1002\/jgt.3190130508","volume":"13","author":"M. Sen","year":"1989","unstructured":"Sen, M., Das, S., Roy, A.B., West, D.B.: An analogue of interval graphs. J.of Graph Theory\u00a013, 189\u2013202 (1989)","journal-title":"J.of Graph Theory"},{"key":"12_CR15","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 semiorders. SIAM J. Discrete Math.\u00a07, 157\u2013165 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(94)00167-H","volume":"147","author":"M. Sen","year":"1995","unstructured":"Sen, M., Sanyal, B.K., West, D.B.: Representing digraphs using intervals or circular arcs. Discrete Math.\u00a0147, 235\u2013245 (1995)","journal-title":"Discrete Math."},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0166-218X(87)80003-3","volume":"18","author":"J. Spinard","year":"1987","unstructured":"Spinard, J., Brandstad, A., Stewart, L.: Bipartite permutation graphs. Discrete Applied Math.\u00a018, 279\u2013292 (1987)","journal-title":"Discrete Applied Math."},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1002\/(SICI)1097-0118(199602)21:2<235::AID-JGT14>3.0.CO;2-I","volume":"21","author":"G. Steiner","year":"1996","unstructured":"Steiner, G.: The recognition of indifference digraphs and generalized Semiorders. J. of Graph Theory\u00a021(2), 235\u2013241 (1996)","journal-title":"J. of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14974-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:58:54Z","timestamp":1559091534000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14974-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319149738","9783319149745"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14974-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}