{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:31Z","timestamp":1759638811296},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_37","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"421-432","source":"Crossref","is-referenced-by-count":5,"title":["Convexity in Partial Cubes: The Hull Number"],"prefix":"10.1007","author":[{"given":"Marie","family":"Albenque","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kolja","family":"Knauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.12.035","volume":"475","author":"J. Araujo","year":"2013","unstructured":"Araujo, J., Campos, V., Giroire, F., Nisse, N., Sampaio, L., Soares, R.: On the hull number of some graph classes. Theoret. Comput. Sci.\u00a0475, 1\u201312 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR2","unstructured":"Araujo, J., Morel, G., Sampaio, L., Soares, R., Weber, V.: Hull number: P5-free graphs and reduction rules, Tech. Report RR-8045, INRIA (2012)"},{"issue":"2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1002\/jgt.3190130208","volume":"13","author":"H.-J. Bandelt","year":"1989","unstructured":"Bandelt, H.-J.: Graphs with intrinsic S3 convexities. J. Graph Theory\u00a013(2), 215\u2013228 (1989)","journal-title":"J. Graph Theory"},{"key":"37_CR4","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511586507","volume-title":"Oriented matroids","author":"A. Bj\u00f6rner","year":"1999","unstructured":"Bj\u00f6rner, A., Vergnas, M.L., Sturmfels, B., White, N., Ziegler, G.M.: Oriented matroids, 2nd edn. Encyclopedia of Mathematics and its Applications, vol.\u00a046. Cambridge University Press, Cambridge (1999)","edition":"2"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.: Graph theory, vol.\u00a0244. Springer (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"issue":"11","key":"37_CR6","doi-asserted-by":"publisher","first-page":"3020","DOI":"10.1016\/j.camwa.2010.10.001","volume":"60","author":"J. C\u00e1ceres","year":"2010","unstructured":"C\u00e1ceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L.: On the geodetic and the hull numbers in strong product graphs. Comput. Math. Appl.\u00a060(11), 3020\u20133031 (2010)","journal-title":"Comput. Math. Appl."},{"key":"37_CR7","first-page":"143","volume":"71","author":"S.R. Canoy Jr.","year":"2006","unstructured":"Canoy Jr., S.R., Cagaanan, G.B., Gervacio, S.V.: Convexity, geodetic, and hull numbers of the join of graphs. Util. Math.\u00a071, 143\u2013159 (2006)","journal-title":"Util. Math."},{"issue":"2","key":"37_CR8","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1137\/110859014","volume":"27","author":"C.C. Centeno","year":"2013","unstructured":"Centeno, C.C., Penso, L.D., Rautenbach, D., Pereira de S\u00e1, V.G.: Geodetic Number versus Hull Number in P 3-Convexity. SIAM J. Discrete Math.\u00a027(2), 717\u2013731 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"37_CR9","first-page":"129","volume":"57","author":"G. Chartrand","year":"2000","unstructured":"Chartrand, G., Harary, F., Zhang, P.: On the hull number of a graph. Ars Combin.\u00a057, 129\u2013138 (2000)","journal-title":"Ars Combin."},{"key":"37_CR10","unstructured":"Chepoi, V.D.: d-convex sets in graphs, Ph.D. thesis, Ph. D. dissertation, Moldova State University, Kishinev (1986) (Russian)"},{"issue":"4","key":"37_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/S0195-6698(82)80015-2","volume":"3","author":"R. Cordovil","year":"1982","unstructured":"Cordovil, R.: Sur les matro\u00efdes orient\u00e9s de rang 3 et les arrangements de pseudodroites dans le plan projectif r\u00e9el. European J. Combin.\u00a03(4), 307\u2013318 (1982)","journal-title":"European J. Combin."},{"key":"37_CR12","unstructured":"Cordovil, R., Forge, D.: Flipping in acyclic and strongly connected graphs (2007)"},{"key":"37_CR13","doi-asserted-by":"publisher","first-page":"771","DOI":"10.2307\/1968857","volume":"41","author":"R.P. Dilworth","year":"1940","unstructured":"Dilworth, R.P.: Lattices with unique irreducible decompositions. Ann. of Math (2)\u00a041, 771\u2013777 (1940)","journal-title":"Ann. of Math. (2)"},{"issue":"3","key":"37_CR14","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0095-8956(73)90010-5","volume":"14","author":"D. Djokovi\u0107 \u017d","year":"1973","unstructured":"\u017d Djokovi\u0107, D.: Distance-preserving subgraphs of hypercubes. Journal of Combinatorial Theory, Series B\u00a014(3), 263\u2013267 (1973)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"18","key":"37_CR15","doi-asserted-by":"publisher","first-page":"5668","DOI":"10.1016\/j.disc.2008.04.020","volume":"309","author":"M.C. Dourado","year":"2009","unstructured":"Dourado, M.C., Gimbel, J.G., Kratochv\u00edl, J., Protti, F., Szwarcfiter, J.L.: On the computation of the hull number of a graph. Discrete Math.\u00a0309(18), 5668\u20135674 (2009)","journal-title":"Discrete Math."},{"key":"37_CR16","doi-asserted-by":"publisher","first-page":"2163","DOI":"10.1137\/090751797","volume":"23","author":"M.C. Dourado","year":"2009","unstructured":"Dourado, M.C., Protti, F., Rautenbach, D., Szwarcfiter, J.L.: On the hull number of triangle-free graphs. SIAM J. Discrete Math.\u00a023, 2163\u20132172 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"37_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-642-00219-9_37","volume-title":"Graph Drawing","author":"D. Eppstein","year":"2009","unstructured":"Eppstein, D.: Isometric diamond subgraphs. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol.\u00a05417, pp. 384\u2013389. Springer, Heidelberg (2009)"},{"key":"37_CR18","series-title":"Interdisciplinary applied mathematics","first-page":"328","volume-title":"Media theory","author":"D. Eppstein","year":"2008","unstructured":"Eppstein, D., Falmagne, J.-C., Ovchinnikov, S.: Media theory. Interdisciplinary applied mathematics, p. 328. Springer, Berlin (2008)"},{"issue":"3","key":"37_CR19","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0012-365X(85)90174-8","volume":"57","author":"M.G. Everett","year":"1985","unstructured":"Everett, M.G., Seidman, S.B.: The hull number of a graph. Discrete Math.\u00a057(3), 217\u2013223 (1985)","journal-title":"Discrete Math."},{"issue":"5","key":"37_CR20","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1017\/S0963548309010001","volume":"18","author":"S. Felsner","year":"2009","unstructured":"Felsner, S., Knauer, K.: ULD-lattices and \u0394-bonds. Combin. Probab. Comput.\u00a018(5), 707\u2013724 (2009)","journal-title":"Combin. Probab. Comput."},{"issue":"3","key":"37_CR21","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"R.J. Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett.\u00a012(3), 133\u2013137 (1981)","journal-title":"Inform. Process. Lett."},{"issue":"1-3","key":"37_CR22","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0012-365X(93)90159-Q","volume":"111","author":"K. Fukuda","year":"1993","unstructured":"Fukuda, K., Handa, K.: Antipodal graphs and oriented matroids. Discrete Math.\u00a0111(1-3), 245\u2013256 (1993), Graph theory and combinatorics (Luminy, 1990)","journal-title":"Discrete Math."},{"key":"37_CR23","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co., San Francisco (1979); A guide to the theory of NP-completeness"},{"key":"37_CR24","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","volume":"50","author":"R.L. Graham","year":"1971","unstructured":"Graham, R.L., Pollak, H.O.: On the addressing problem for loop switching. Bell System Tech. J.\u00a050, 2495\u20132519 (1971)","journal-title":"Bell System Tech. J."},{"key":"37_CR25","first-page":"325","volume":"21","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. Ann. Discrete Math.\u00a021, 325\u2013356 (1984)","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"37_CR26","doi-asserted-by":"publisher","first-page":"235","DOI":"10.2977\/prims\/1195167272","volume":"29","author":"K. Handa","year":"1993","unstructured":"Handa, K.: Topes of oriented matroids and related structures. Publ. Res. Inst. Math. Sci.\u00a029(2), 235\u2013266 (1993)","journal-title":"Publ. Res. Inst. Math. Sci."},{"issue":"1","key":"37_CR27","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF01696777","volume":"37","author":"E. Helly","year":"1930","unstructured":"Helly, E.: \u00dcber systeme von abgeschlossenen mengen mit gemeinschaftlichen punkten. Monatshefte f\u00fcr Mathematik\u00a037(1), 281\u2013302 (1930)","journal-title":"Monatshefte f\u00fcr Mathematik"},{"issue":"1-3","key":"37_CR28","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.disc.2004.08.039","volume":"293","author":"C. Hernando","year":"2005","unstructured":"Hernando, C., Jiang, T., Mora, M., Pelayo, I.M., Seara, C.: On the Steiner, geodetic and hull numbers of graphs. Discrete Math.\u00a0293(1-3), 139\u2013154 (2005)","journal-title":"Discrete Math."},{"key":"37_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-35843-2_24","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"M.M. Kant\u00e9","year":"2013","unstructured":"Kant\u00e9, M.M., Nourine, L.: Polynomial time algorithms for computing a minimum hull set in distance-hereditary and chordal graphs. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 268\u2013279. Springer, Heidelberg (2013)"},{"issue":"4","key":"37_CR30","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1002\/jgt.20589","volume":"69","author":"S. Klav\u017ear","year":"2012","unstructured":"Klav\u017ear, S., Shpectorov, S.: Convex excess in partial cubes. J. Graph Theory\u00a069(4), 356\u2013369 (2012)","journal-title":"J. Graph Theory"},{"issue":"4","key":"37_CR31","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/BF00582748","volume":"1","author":"B. Monjardet","year":"1985","unstructured":"Monjardet, B.: A use for frequently rediscovering a concept. Order\u00a01(4), 415\u2013417 (1985)","journal-title":"Order"},{"key":"37_CR32","doi-asserted-by":"crossref","unstructured":"Trotter, W.T.: Combinatorics and partially ordered sets. Johns Hopkins University Press, Baltimore (1992), Dimension theory","DOI":"10.56021\/9780801844256"},{"issue":"2","key":"37_CR33","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0166-218X(84)90069-6","volume":"7","author":"P.M. Winkler","year":"1984","unstructured":"Winkler, P.M.: Isometric embedding in products of complete graphs. Discrete Appl. Math.\u00a07(2), 221\u2013225 (1984)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"37_CR34","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"Yannakakis, M.: The complexity of the partial order dimension problem. SIAM J. Algebraic Discrete Methods\u00a03(3), 351\u2013358 (1982)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"37_CR35","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on polytopes","author":"G.M. Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on polytopes. Graduate Texts in Mathematics, vol.\u00a0152. Springer, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,11]],"date-time":"2023-07-11T09:11:27Z","timestamp":1689066687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}