{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:16Z","timestamp":1725574096998},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_17","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"129-140","source":"Crossref","is-referenced-by-count":2,"title":["On Partitioning Interval and Circular-Arc Graphs into Proper Interval Subgraphs with Applications"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Gardi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s004539910013","volume":"26","author":"M.G. Andrews","year":"2000","unstructured":"Andrews, M.G., Atallah, M.J., Chen, D.Z., Lee, D.T.: Parallel algorithms for maximum matching in complements of interval graphs and related problems. Algorithmica\u00a026, 263\u2013289 (2000)","journal-title":"Algorithmica"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0304-3975(95)00057-4","volume":"148","author":"H.L. Bodlaender","year":"1995","unstructured":"Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Theoretical Computer Science\u00a0148, 93\u2013109 (1995)","journal-title":"Theoretical Computer Science"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"D.G. Corneil","year":"1995","unstructured":"Corneil, D.G., Kim, H., Natarajan, S., Olariu, S., Sprague, A.: Simple linear time recognition of unit interval graphs. Information Processing Letters\u00a055, 99\u2013104 (1995)","journal-title":"Information Processing Letters"},{"key":"17_CR4","first-page":"175","volume-title":"Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"D.G. Corneil","year":"1998","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: The ultimate interval graph recognition algorithm? In: Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 175\u2013180. ACM Publications, New York (1998)"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/3-540-45066-1_13","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"F. Gardi","year":"2003","unstructured":"Gardi, F.: Efficient algorithms for disjoint matchings among intervals and related problems. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 168\u2013180. Springer, Heidelberg (2003)"},{"key":"17_CR6","series-title":"Computer Science and Applied Mathematics Series","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Computer Science and Applied Mathematics Series. Academic Press, New York (1980)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/net.3230120410","volume":"12","author":"U.I. Gupta","year":"1982","unstructured":"Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular-arc graphs. Networks\u00a012, 459\u2013467 (1982)","journal-title":"Networks"},{"key":"17_CR8","volume-title":"Interval Orders and Interval Graphs","author":"P.C. Fishburn","year":"1985","unstructured":"Fishburn, P.C.: Interval Orders and Interval Graphs. John Wiley & Sons, New York (1985)"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnel, R., Paul, C., Viennot, L.: Lex-BSF and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoretical Computer Science\u00a0234, 59\u201384 (2000)","journal-title":"Theoretical Computer Science"},{"key":"17_CR10","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/SFCS.2001.959913","volume-title":"Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science","author":"R. McConnel","year":"2001","unstructured":"McConnel, R.: Linear time recognition of circular-arc graphs. In: Proc. 42nd Annual IEEE Symposium on Foundations of Computer Science, pp. 386\u2013394. IEEE Computer Society Publications, Los Alamitos (2001)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(91)90245-D","volume":"37","author":"S. Olariu","year":"1991","unstructured":"Olariu, S.: An optimal greedy heuristic to color interval graphs. Information Processing Letters\u00a037, 21\u201325 (1991)","journal-title":"Information Processing Letters"},{"key":"17_CR12","unstructured":"Bamboo-Planification by Prologia - Groupe Air Liquide, \n                    \n                      http:\/\/prologianet.univ-mrs.fr\/bamboo\/bambooplanification.html"},{"key":"17_CR13","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970401","volume-title":"Graph Theory and its Application to the Problems of Society","author":"F.S. Roberts","year":"1978","unstructured":"Roberts, F.S.: Graph Theory and its Application to the Problems of Society. SIAM Publications, Philadelphia (1978)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T12:25:37Z","timestamp":1553343937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}