{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:41Z","timestamp":1759638641259},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175169"},{"type":"electronic","value":"9783642175176"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_20","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"206-217","source":"Crossref","is-referenced-by-count":13,"title":["Simultaneous Interval Graphs"],"prefix":"10.1007","author":[{"given":"Krishnam Raju","family":"Jampani","sequence":"first","affiliation":[]},{"given":"Anna","family":"Lubiw","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1137\/050637091","volume":"21","author":"A. Berry","year":"2007","unstructured":"Berry, A., Golumbic, M.C., Lipshteyn, M.: Recognizing chordal probe graphs and cycle-bicolorable graphs. SIAM J. Discret. Math.\u00a021(3), 573\u2013591 (2007)","journal-title":"SIAM J. Discret. Math."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K.S. Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. System Sci.\u00a013, 335\u2013379 (1976)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"20_CR3","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.comgeo.2006.05.006","volume":"36","author":"P. Brass","year":"2007","unstructured":"Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D.P., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. Theory Appl.\u00a036(2), 117\u2013130 (2007)","journal-title":"Comput. Geom. Theory Appl."},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-77537-9_28","volume-title":"Graph Drawing","author":"A. Estrella-Balderrama","year":"2008","unstructured":"Estrella-Balderrama, A., Gassner, E., Junger, M., Percan, M., Schaefer, M., Schulz, M.: Simultaneous geometric graph embeddings. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol.\u00a04875, pp. 280\u2013290. Springer, Heidelberg (2008)"},{"issue":"1-3","key":"20_CR5","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1016\/j.tcs.2008.01.038","volume":"396","author":"D.B. Chandler","year":"2008","unstructured":"Chandler, D.B., Chang, M., Kloks, T., Liu, J., Peng, S.: Partitioned probe comparability graphs. Theor. Comput. Sci.\u00a0396(1-3), 212\u2013222 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"20_CR6","volume-title":"Algorithmic Graph Theory And Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory And Perfect Graphs. Academic Press, New York (1980)"},{"issue":"3","key":"20_CR7","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1006\/jagm.1995.1047","volume":"19","author":"M.C. Golumbic","year":"1995","unstructured":"Golumbic, M.C., Kaplan, H., Shamir, R.: Graph sandwich problems. J. Algorithms\u00a019(3), 449\u2013473 (1995)","journal-title":"J. Algorithms"},{"issue":"1-3","key":"20_CR8","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.dam.2003.12.009","volume":"143","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C., Lipshteyn, M.: Chordal probe graphs. Discrete Appl. Math.\u00a0143(1-3), 221\u2013237 (2004)","journal-title":"Discrete Appl. Math."},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Jampani, K.R., Lubiw, A.: The simultaneous representation problem for chordal, comparability and permutation graphs. In: WADS 2009, pp. 387\u2013398 (2009)","DOI":"10.1007\/978-3-642-03367-4_34"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Jampani, K.R., Lubiw, A.: Simultaneous Interval Graphs. Arxiv 2010(2010)","DOI":"10.1007\/978-3-642-17517-6_20"},{"key":"20_CR11","unstructured":"Johnson, J.L., Spinrad, J.P.: A polynomial time recognition algorithm for probe interval graphs. In: SODA 2001, Philadelphia, PA, USA, pp. 477\u2013486 (2001)"},{"key":"20_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-04128-0_32","volume-title":"Algorithms - ESA 2009","author":"R.M. McConnell","year":"2009","unstructured":"McConnell, R.M., Nussbaum, Y.: Linear-time recognition of probe interval graphs. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 349\u2013360. Springer, Heidelberg (2009)"},{"key":"20_CR13","unstructured":"McConnell, R.M., Spinrad, J.P.: Construction of probe interval models. In: SODA 2002, Philadelphia, PA, USA, pp. 866\u2013875 (2002)"},{"issue":"1-3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0166-218X(98)00077-8","volume":"88","author":"F.R. McMorris","year":"1998","unstructured":"McMorris, F.R., Wang, C., Zhang, P.: On probe interval graphs. Discrete Appl. Math.\u00a088(1-3), 315\u2013324 (1998)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/(SICI)1097-0118(199910)32:2<171::AID-JGT7>3.0.CO;2-N","volume":"32","author":"P.J. Tanenbaum","year":"1999","unstructured":"Tanenbaum, P.J.: Simultaneous intersection representation of pairs of graphs. J. Graph Theory.\u00a032(2), 171\u2013190 (1999)","journal-title":"J. Graph Theory."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:21Z","timestamp":1559836161000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}