{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:34Z","timestamp":1725456994767},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_49","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T20:59:41Z","timestamp":1355432381000},"page":"465-474","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph"],"prefix":"10.1007","author":[{"given":"Danny","family":"Hermelin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phane","family":"Vialette","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-2","key":"49_CR1","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(98)00158-3","volume":"237","author":"P. Alimonti","year":"2000","unstructured":"Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. TCS\u00a0237(1-2), 123\u2013134 (2000)","journal-title":"TCS"},{"key":"49_CR2","doi-asserted-by":"crossref","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation: Combinatorial optimization problems and their approximability properties. Springer (1999)","DOI":"10.1007\/978-3-642-58412-1"},{"key":"49_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45477-2_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M.-S. Chang","year":"2001","unstructured":"Chang, M.-S., M\u00fcller, H.: On the Tree-Degree of Graphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 44\u201354. Springer, Heidelberg (2001)"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1002\/jgt.20596","volume":"70","author":"D.W. Cranston","year":"2012","unstructured":"Cranston, D.W., Korula, N., LeSaulnier, T.D., Milans, K., Stocker, C., Vandenbussche, J., West, D.B.: Overlap number of graphs. J. Graph Theory\u00a070(1), 10\u201328 (2012)","journal-title":"J. Graph Theory"},{"key":"49_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.4153\/CJM-1966-014-3","volume":"18","author":"P. Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Goodman, A.W., P\u00f3sa, L.: The intersection of a graph by set intersections. Canad. J. Math.\u00a018, 106\u2013112 (1966)","journal-title":"Canad. J. Math."},{"key":"49_CR6","first-page":"1","volume":"13","author":"J. Gramm","year":"2008","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM J. of Experimental Algo.\u00a013, 2.2:1\u20132.2:15 (2008)","journal-title":"ACM J. of Experimental Algo."},{"issue":"5","key":"49_CR7","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.ipl.2004.03.007","volume":"90","author":"J.-L. Guillaume","year":"2004","unstructured":"Guillaume, J.-L., Latapy, M.: Bipartite structure of all complex networks. IPL\u00a090(5), 215\u2013221 (2004)","journal-title":"IPL"},{"issue":"7","key":"49_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G. Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc. London Math. Society III\u00a02(7), 326\u2013336 (1952)","journal-title":"Proc. London Math. Society III"},{"key":"49_CR9","first-page":"187","volume":"11","author":"D.N. Hoover","year":"1992","unstructured":"Hoover, D.N.: Complexity of graph covering problems for graphs of low degree. J. Comb. Math. and Comb. Comp.\u00a011, 187\u2013200 (1992)","journal-title":"J. Comb. Math. and Comb. Comp."},{"issue":"3","key":"49_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"W.-L. Hsu","year":"1991","unstructured":"Hsu, W.-L., Tsai, K.-H.: Linear time algorithms on circular-arc graphs. IPL\u00a040(3), 123\u2013129 (1991)","journal-title":"IPL"},{"key":"49_CR11","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"L.T. Kou","year":"1978","unstructured":"Kou, L.T., Stockmeyer, L.J., Wong, C.K.: Covering graphs by cliques with regard to keyword conflicts and intersection graphs. Comm. ACM\u00a021, 135\u2013139 (1978)","journal-title":"Comm. ACM"},{"key":"49_CR12","series-title":"Lecture Notes in Computer Science","first-page":"40","volume-title":"Automata, Languages, and Programming","author":"C. Lund","year":"1994","unstructured":"Lund, C., Yannakakis, M.: The Approximation of Maximum Subgraph Problems. In: Shamir, E., Abiteboul, S. (eds.) ICALP 1994. LNCS, vol.\u00a0820, pp. 40\u201351. Springer, Heidelberg (1994)"},{"key":"49_CR13","first-page":"151","volume":"36","author":"S. Ma","year":"1989","unstructured":"Ma, S., Wallis, W.D., Wu, J.: Clique covering of chordal graphs. Utilitas Mathematica\u00a036, 151\u2013152 (1989)","journal-title":"Utilitas Mathematica"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"McKee, T.A., McMorris, F.R.: Topics in intersection graph theory. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719802"},{"key":"49_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-13509-5_19","volume-title":"Combinatorial Pattern Matching","author":"I. Nor","year":"2010","unstructured":"Nor, I., Hermelin, D., Charlat, S., Engelstadter, J., Reuter, M., Duron, O., Sagot, M.-F.: Mod\/Resc Parsimony Inference. In: Amir, A., Parida, L. (eds.) CPM 2010. LNCS, vol.\u00a06129, pp. 202\u2013213. Springer, Heidelberg (2010)"},{"issue":"5","key":"49_CR16","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"80","author":"J.B. Orlin","year":"1977","unstructured":"Orlin, J.B.: Contentment in graph theory: Covering graphs with cliques. Indagationes Mathematicae (Proc.)\u00a080(5), 406\u2013424 (1977)","journal-title":"Indagationes Mathematicae (Proc.)"},{"key":"49_CR17","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation and complexity classes. J. Comp. Sys. Sc.\u00a043, 425\u2013440 (1991)","journal-title":"J. Comp. Sys. Sc."},{"key":"49_CR18","unstructured":"Rosgen, B.: Set representations of graphs. Master\u2019s thesis, Univ. Alberta (2005)"},{"key":"49_CR19","unstructured":"Rosgen, B., Stewart, L.: The overlap number of a graph (2010) (submitted, arXiv:1008.2170v2)"}],"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-35261-4_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:02:57Z","timestamp":1557432177000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}