{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:01:04Z","timestamp":1725897664085},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_43","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T15:12:12Z","timestamp":1344870732000},"page":"507-518","source":"Crossref","is-referenced-by-count":0,"title":["Complementary Vertices and Adjacency Testing in Polytopes"],"prefix":"10.1007","author":[{"given":"Benjamin A.","family":"Burton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-0348-8438-9_9","volume-title":"Polytopes\u2014Combinatorics and Computation (Oberwolfach, 1997), DMV Sem.","author":"D. Avis","year":"2000","unstructured":"Avis, D.: A revised implementation of the reverse search vertex enumeration algorithm. In: Polytopes\u2014Combinatorics and Computation (Oberwolfach, 1997), DMV Sem., vol.\u00a029, pp. 177\u2013198. Birkh\u00e4user, Basel (2000)"},{"issue":"3","key":"43_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF02293050","volume":"8","author":"D. Avis","year":"1992","unstructured":"Avis, D., Fukuda, K.: A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom.\u00a08(3), 295\u2013313 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"43_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s00199-009-0449-x","volume":"42","author":"D. Avis","year":"2010","unstructured":"Avis, D., Rosenberg, G.D., Savani, R., von Stengel, B.: Enumeration of Nash equilibria for two-player games. Econom. Theory\u00a042(1), 9\u201337 (2010)","journal-title":"Econom. Theory"},{"issue":"1","key":"43_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1008215702611","volume":"13","author":"H.P. Benson","year":"1998","unstructured":"Benson, H.P.: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Global Optim.\u00a013(1), 1\u201324 (1998)","journal-title":"J. Global Optim."},{"issue":"269","key":"43_CR5","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1090\/S0025-5718-09-02282-0","volume":"79","author":"B.A. Burton","year":"2010","unstructured":"Burton, B.A.: Optimizing the double description method for normal surface enumeration. Math. Comp.\u00a079(269), 453\u2013484 (2010)","journal-title":"Math. Comp."},{"issue":"4","key":"43_CR6","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jcta.2008.10.008","volume":"116","author":"A. Felikson","year":"2009","unstructured":"Felikson, A., Tumarkin, P.: Coxeter polytopes with a unique pair of non-intersecting facets. J. Combin. Theory Ser. A\u00a0116(4), 875\u2013902 (2009)","journal-title":"J. Combin. Theory Ser. A"},{"key":"43_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/3-540-61576-8_77","volume-title":"Combinatorics and Computer Science","author":"K. Fukuda","year":"1996","unstructured":"Fukuda, K., Prodon, A.: Double description method revisited. In: Deza, M., Manoussakis, I., Euler, R. (eds.) CCS 1995. LNCS, vol.\u00a01120, pp. 91\u2013111. Springer, Heidelberg (1996)"},{"issue":"1","key":"43_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1002\/nav.3800280111","volume":"28","author":"M.J.M. Jansen","year":"1981","unstructured":"Jansen, M.J.M.: Maximal Nash subsets for bimatrix games. Naval Res. Logist. Quart.\u00a028(1), 147\u2013152 (1981)","journal-title":"Naval Res. Logist. Quart."},{"issue":"2","key":"43_CR9","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1365\/s13291-010-0001-8","volume":"112","author":"E.D. Kim","year":"2010","unstructured":"Kim, E.D., Santos, F.: An update on the Hirsch conjecture. Jahresber. Dtsch. Math.-Ver.\u00a0112(2), 73\u201398 (2010)","journal-title":"Jahresber. Dtsch. Math.-Ver."},{"key":"43_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF02395040","volume":"117","author":"V. Klee","year":"1967","unstructured":"Klee, V., Walkup, D.W.: The d-step conjecture for polyhedra of dimension d\u2009<\u20096. Acta Math.\u00a0117, 53\u201378 (1967)","journal-title":"Acta Math."},{"key":"43_CR11","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 3: Sorting and Searching, 2nd edn. Addison-Wesley, Reading (1998)"},{"issue":"2","key":"43_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1137\/0112033","volume":"12","author":"C.E. Lemke","year":"1964","unstructured":"Lemke, C.E., Howson Jr., J.T.: Equilibrium points of bimatrix games. J. Soc. Indust. Appl. Math.\u00a012(2), 413\u2013423 (1964)","journal-title":"J. Soc. Indust. Appl. Math."},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1112\/S0025579300002850","volume":"17","author":"P. McMullen","year":"1970","unstructured":"McMullen, P.: The maximum numbers of faces of a convex polytope. Mathematika\u00a017, 179\u2013184 (1970)","journal-title":"Mathematika"},{"key":"43_CR14","series-title":"Annals of Mathematics Studies","first-page":"51","volume-title":"Contributions to the Theory of Games, Vol. II","author":"T.S. Motzkin","year":"1953","unstructured":"Motzkin, T.S., Raiffa, H., Thompson, G.L., Thrall, R.M.: The double description method. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, Vol. II. Annals of Mathematics Studies, vol.\u00a028, pp. 51\u201373. Princeton University Press, Princeton (1953)"},{"key":"43_CR15","unstructured":"Santos, F.: A counterexample to the Hirsch conjecture. To appear in Ann. of Math. (2) (2010), arXiv: 1006.2814"},{"key":"43_CR16","first-page":"137","volume-title":"Game Theory and Related Topics (Proc. Sem., Bonn and Hagen, 1978)","author":"H.M. Winkels","year":"1979","unstructured":"Winkels, H.M.: An algorithm to determine all equilibrium points of a bimatrix game. In: Game Theory and Related Topics (Proc. Sem., Bonn and Hagen, 1978), pp. 137\u2013148. North-Holland, Amsterdam (1979)"},{"key":"43_CR17","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:59:00Z","timestamp":1620129540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}