{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:04:19Z","timestamp":1761717859374},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5890,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1016\/0925-7721(95)00049-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:56:11Z","timestamp":1027652171000},"page":"1-12","source":"Crossref","is-referenced-by-count":51,"title":["Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron"],"prefix":"10.1016","volume":"8","author":[{"given":"Komei","family":"Fukuda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas M.","family":"Liebling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Margot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00049-6_BIB1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF02293050","article-title":"A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra","volume":"8","author":"Avis","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00049-6_BIB2","doi-asserted-by":"crossref","unstructured":"D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(95)00026-N"},{"key":"10.1016\/0925-7721(95)00049-6_BIB3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0109008","article-title":"An algorithm for finding all vertices of convex polyhedral sets","volume":"9","author":"Balinski","year":"1961","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0925-7721(95)00049-6_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(82)90006-2","article-title":"Some NP-complete problems in linear programming","volume":"1","author":"Chandrasekaran","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0925-7721(95)00049-6_BIB5","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/moor.8.3.381","article-title":"The complexity of vertex enumeration methods","volume":"8","author":"Dyer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0925-7721(95)00049-6_BIB6","series-title":"Algorithms in Combinatorial Geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1016\/0925-7721(95)00049-6_BIB7","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1002\/net.3230220504","article-title":"Finding all minimum cost perfect matchings in bipartite graphs","volume":"22","author":"Fukuda","year":"1992","journal-title":"Networks"},{"key":"10.1016\/0925-7721(95)00049-6_BIB8","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0893-9659(94)90045-0","article-title":"Finding all the perfect matchings in bipartite graphs","volume":"7","author":"Fukuda","year":"1994","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/0925-7721(95)00049-6_BIB9","series-title":"Computers and Intractability, a Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0925-7721(95)00049-6_BIB10","unstructured":"F. Margot, K. Fukuda and Th.M. Liebling, Enumeration of full dimensional cells in an arrangement, Working paper RO920918, EPF Lausanne, Switzerland."},{"key":"10.1016\/0925-7721(95)00049-6_BIB11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1287\/opre.21.1.247","article-title":"An algorithm for determining irrelevant constraints and all vertices in systems of linear inequalities","volume":"21","author":"Mattheiss","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0925-7721(95)00049-6_BIB12","series-title":"Convex Polytopes and the Upper Bound Conjecture","author":"McMullen","year":"1971"},{"key":"10.1016\/0925-7721(95)00049-6_BIB13","series-title":"Contribution to the Theory of Games, II","first-page":"51","article-title":"The double description method","volume":"8","author":"Motzkin","year":"1953"},{"key":"10.1016\/0925-7721(95)00049-6_BIB14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01585927","article-title":"Segments in enumerating faces","volume":"70","author":"Murty","year":"1995","journal-title":"Math. Programming"},{"key":"10.1016\/0925-7721(95)00049-6_BIB15","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/0925-7721(95)00049-6_BIB16","series-title":"Proc. 18th ACM STOC","first-page":"404","article-title":"Constructing higher-dimensional convex hulls at logarithmic cost per face","author":"Seidel","year":"1986"},{"key":"10.1016\/0925-7721(95)00049-6_BIB17","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"key":"10.1016\/0925-7721(95)00049-6_BIB18","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1137\/0208032","article-title":"The complexity of enumeration and reliability problems","volume":"8","author":"Valiant","year":"1979","journal-title":"SIAM J. Comput."}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000496?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000496?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:25:20Z","timestamp":1555212320000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["0925772195000496"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00049-6","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}