{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T02:44:30Z","timestamp":1725763470354},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_19","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T21:32:52Z","timestamp":1386797572000},"page":"196-206","source":"Crossref","is-referenced-by-count":0,"title":["Hardness and Algorithms for Variants of Line Graphs of Directed Graphs"],"prefix":"10.1007","author":[{"given":"Mourad","family":"Ba\u00efou","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Beaudou","sequence":"additional","affiliation":[]},{"given":"Zhentao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Limouzy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","unstructured":"De Simone, C., Mannino, C.: Easy instances of the plant location problem. Technical Report R. 427, IASI, CNR (1996)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/PL00011405","volume":"89","author":"P. Avella","year":"2001","unstructured":"Avella, P., Sassano, A.: On the p-median polytope. Mathematical Programming\u00a089, 395\u2013411 (2001)","journal-title":"Mathematical Programming"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/BF01583779","volume":"23","author":"G. Cornuejols","year":"1982","unstructured":"Cornuejols, G., Thizy, J.M.: Some facets of the simple plant location polytope. Math. Program.\u00a023, 50\u201374 (1982)","journal-title":"Math. Program."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-218X(90)90141-X","volume":"29","author":"V. Chv\u00e1tal","year":"1990","unstructured":"Chv\u00e1tal, V., Ebenegger, C.: A note on line digraphs and the directed max-cut problem. Discrete Applied Mathematics\u00a029, 165\u2013170 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/0402038","volume":"2","author":"E. Balas","year":"1989","unstructured":"Balas, E.: The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph. SIAM Journal on Discrete Mathematics\u00a02, 425\u2013451 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0021-9800(70)80019-9","volume":"9","author":"L.W. Beineke","year":"1970","unstructured":"Beineke, L.W.: Characterizations of derived graphs. Journal of Combinatorial Theory\u00a09, 129\u2013135 (1970)","journal-title":"Journal of Combinatorial Theory"},{"key":"19_CR7","unstructured":"Ba\u00efou, M., Beaudou, L., Li, Z., Limouzy, V.: On a class of intersection graphs (2013), \n                    \n                      http:\/\/arxiv.org\/abs\/1306.2498"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The np-completeness of edge-coloring. SIAM Journal on Computing\u00a010, 718\u2013720 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR9","first-page":"307","volume":"15","author":"S. Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae\u00a015, 307\u2013309 (1974)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1006\/jctb.2000.2026","volume":"82","author":"B. Mohar","year":"2001","unstructured":"Mohar, B.: Face covers and the genus problem for apex graphs. J. Comb. Theory, Ser. B\u00a082, 102\u2013117 (2001)","journal-title":"J. Comb. Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T06:32:00Z","timestamp":1558765920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}