{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:50:03Z","timestamp":1774417803996,"version":"3.50.1"},"reference-count":18,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1051\/ro:2007024","type":"journal-article","created":{"date-parts":[[2007,8,20]],"date-time":"2007-08-20T10:06:33Z","timestamp":1187604393000},"page":"275-287","source":"Crossref","is-referenced-by-count":23,"title":["Clique partitioning of interval graphs with submodular costs on the cliques"],"prefix":"10.1051","volume":"41","author":[{"given":"Dion","family":"Gijswijt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Jost","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurice","family":"Queyranne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2007,8,21]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1109\/18.532875","volume":"42","author":"Alon","year":"1996","journal-title":"IEEE Trans Inform Theory"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"L. Becchetti, P. Korteweg, A. Marchetti-Spaccamela, M. Skutella, L. Stougie and A. Vitaletti, Latency contrained aggregation in sensor networks.Workshop of Combinatorial Optimization, Aussois(2006).","DOI":"10.1007\/11841036_11"},{"key":"R3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1023\/A:1023669107449","volume":"2","author":"Boudhar","year":"2003","journal-title":"J. Math. Model. Algorithms"},{"key":"R4","unstructured":"P. Brucker and S. Knust, Complexity results of scheduling problems. www.mathematik.uni-osnabrueck.de\/research\/OR\/class\/"},{"key":"R5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0012-365X(89)90194-5","volume":"74","author":"Cameron","year":"1989","journal-title":"Discrete Math."},{"key":"R6","unstructured":"J. Cardinal, S. Fiorini and G. Joret, Minimum entropy coloring.ISAAC, Lect. Notes Comput. Sci.3827(2005) 819\u2013828."},{"key":"R7","unstructured":"F. Della Croce, B. Escoffier, C. Murat and V. Th. Paschos, Probabilistic coloring of bipartite and split graphs.ICCSA'05, Lect. Notes Comput. Sci.3483(2005) 202\u2013211 (see alsoCahiers du LamsadeNo. 218)."},{"key":"R8","unstructured":"M. Demange, D. de Werra, J. Monnot and V.T. Paschos, Time slot scheduling of compatible jobs.Cahiers du LamsadeNo. 182, (2001), (accepted inJ. Scheduling)."},{"key":"R9","unstructured":"E. Desgrippes, Coordination entre la production et la distribution dans une cha\u00eene logistique.Laboratoire GILCO - Grenoble(2005)."},{"key":"R10","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"Edmonds","year":"1977","journal-title":"Ann. Discrete Math."},{"key":"R11","unstructured":"B. Escoffier, J. Monnot and V. Th. Paschos, Weighted Coloring: Further Complexity and Approximability Results.ICTCS(2005) 205\u2013214."},{"key":"R12","unstructured":"G. Finke, V. Jost, M. Queyranne and A. Seb\u0151, Batch processing with interval graph compatibilities between tasks.Cahier du LeibnizNo. 108, Laboratoire Leibniz-IMAG, Grenoble (2004) (accepted inDiscrete Appl. Math.)."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"M.C. Golumbic,Algorithmic Graph Theory and Perfect Graphs.Academic Press (1980).","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"R14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0020-0190(97)00002-1","volume":"61","author":"Guan","year":"1997","journal-title":"Inf. Process. Lett."},{"key":"R15","first-page":"673","volume":"123","author":"Herer","year":"1995","journal-title":"Proc. Am. Math. Soc."},{"key":"R16","unstructured":"V. Jost,Ordonnancement chromatique: Poly\u00e8dres, Complexit\u00e9 et Classification. Ph.D. thesis, Laboratoire Leibniz-IMAG - UJF - Grenoble (2006)."},{"key":"R17","unstructured":"A. Schrijver,Combinatorial Optimization: Polyhedra and Efficiency.Springer (2003)."},{"key":"R18","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inf. Process. Lett."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007024\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T08:45:12Z","timestamp":1556786712000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2007024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":18,"journal-issue":{"issue":"3"},"alternative-id":["ro0662"],"URL":"https:\/\/doi.org\/10.1051\/ro:2007024","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}