{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:42:09Z","timestamp":1725511329108},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540005803"},{"type":"electronic","value":"9783540364788"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36478-1_11","type":"book-chapter","created":{"date-parts":[[2007,10,20]],"date-time":"2007-10-20T14:33:12Z","timestamp":1192890792000},"page":"105-118","source":"Crossref","is-referenced-by-count":2,"title":["Reconstructing a Simple Polytope from Its Graph"],"prefix":"10.1007","author":[{"given":"Volker","family":"Kaibel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,1,30]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"A. Bj\u00f6rner, M. Las Vergnas, B. Sturmfels, N. White, and G. M. Ziegler. Oriented Matroids (2nd ed.), volume 46 of Encyclopedia of Mathematics and Its Applications. Cambridge University Press, 1999.","DOI":"10.1017\/CBO9780511586507"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF01830678","volume":"34","author":"R. Blind","year":"1987","unstructured":"R. Blind and P. Mani-Levitska. Puzzles and polytope isomorphisms. Aequationes Math., 34:287\u2013297, 1987.","journal-title":"Aequationes Math."},{"key":"11_CR3","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0089253","volume-title":"Computational Synthetic Geometry","author":"J. Bokowski","year":"1989","unstructured":"J. Bokowski and B. Sturmfels. Computational Synthetic Geometry, volume 1355 of Lecture Notes in Mathematics. Springer, Heidelberg, 1989."},{"key":"11_CR4","unstructured":"M. Develin. E-mail conversation, Nov 2000. develin@bantha.org."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Maximum matching and a polyhedron with 0,1-vertices. J. Res. Natl. Bur. Stand. \u2014 B (Math. and Math. Phys.), 69B:125\u2013130, 1965.","journal-title":"J. Res. Natl. Bur. Stand. \u2014 B (Math. and Math. Phys.)"},{"key":"11_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds. Paths, trees, and flowers. Can. J. Math., 17:449\u2013467, 1965.","journal-title":"Can. J. Math."},{"key":"11_CR7","volume-title":"A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979."},{"key":"11_CR8","unstructured":"M. X. Goemans and D. P. Williamson. The primal-dual method for approximation algorithms and its application to network design problems. In D. Hochbaum, editor, Approximation Algorithms, chapter 4. PWS Publishing Company, 1997."},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"639","DOI":"10.2307\/1990931","volume":"3","author":"J. E. Goodman","year":"1990","unstructured":"J. E. Goodman, R. Pollack, and B. Sturmfels. The intrinsic spread of a configuration in \u211dd. J. Am. Math. Soc., 3(3):639\u2013651, 1990.","journal-title":"J. Am. Math. Soc."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"C. Haase and G. M. Ziegler. Examples and counterexamples for Perles\u2019 conjecture. Technical report, TU Berlin, 2001. To appear in: Discrete Comput. Geometry.","DOI":"10.1007\/s00454-001-0085-0"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1137\/0401019","volume":"1","author":"P. L. Hammer","year":"1988","unstructured":"P. L. Hammer, B. Simeone, T. M. Liebling, and D. de Werra. From linear separability to unimodality: A hierarchy of pseudo-boolean functions. SIAM J. Discrete Math., 1:174\u2013184, 1988.","journal-title":"SIAM J. Discrete Math."},{"key":"11_CR12","unstructured":"M. Joswig, V. Kaibel, and F. K\u00f6rner. On the k-systems of a simple polytope. Technical report, TU Berlin, 2001. arXiv: math.CO\/0012204, to appear in: Israel J. Math."},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s004540010039","volume":"24","author":"M. Joswig","year":"2000","unstructured":"M. Joswig and G.M. Ziegler. Neighborly cubical polytopes. Discrete Comput. Geometry, 24:325\u2013344, 2000.","journal-title":"Discrete Comput. Geometry"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"V. Kaibel and M. Pfetsch. Computing the face lattice of a polytope from its vertex-facet incidences. Technical report, TU Berlin, 2001. arXiv:math.MG\/01060043, submitted.","DOI":"10.1016\/S0925-7721(02)00103-7"},{"issue":"2","key":"11_CR15","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/0097-3165(88)90064-7","volume":"49","author":"G. Kalai","year":"1988","unstructured":"G. Kalai. A simple way to tell a simple polytope from its graph. J. Comb. Theory, Ser. A, 49(2):381\u2013383, 1988.","journal-title":"J. Comb. Theory, Ser. A"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"N. E. Mn\u00ebv. The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In O. Ya. Viro, editor, Topology and Geometry\u2013Rohlin Seminar, volume 1346 of Lecture Notes in Mathematics, pages 527\u2013543. Springer, Heidelberg, 1988.","DOI":"10.1007\/BFb0082792"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.4153\/CJM-1954-033-3","volume":"6","author":"W. T. Tutte","year":"1954","unstructured":"W. T. Tutte. A short proof of the factor theorem for finite graphs. Can. J. Math., 6:347\u2013352, 1954.","journal-title":"Can. J. Math."},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2371086","volume":"54","author":"H. Whitney","year":"1932","unstructured":"H. Whitney. Congruent graphs and the connectivity of graphs. Am. J. Math., 54:150\u2013168, 1932.","journal-title":"Am. J. Math."},{"key":"11_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"G. M. Ziegler","year":"1995","unstructured":"G. M. Ziegler. Lectures on Polytopes. Springer-Verlag, New York, 1995. Revised edition 1998."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization \u2014 Eureka, You Shrink!"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36478-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T13:04:03Z","timestamp":1684069443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36478-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540005803","9783540364788"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36478-1_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}