Author:
Tiwary Hans Raj,Elbassioni Khaled
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference15 articles.
1. Archdeacon D., Negami S.: The construction of self-dual projective polyhedra. J. Comb. Theory. Ser. B 59(1), 122–131 (1993)
2. Avis D., Bremner D., Seidel R.: How good are convex hull algorithms?. Comput. Geom 7, 265–301 (1997)
3. Boros, E.; Gurvich, V.; Zverovich, I.: Neighborhood hypergraphs of bipartite graphs. Technical report, Rutgers Center for Operations Research, 2006
4. Bremner D., Fukuda K., Marzetta A.: Primal-dual methods for vertex and facet enumeration. Discrete Comput. Geom. 20(3), 333–357 (1998)
5. Erickson, J.: Faces of intricate polytopes. Notes on the Web: http://compgeom.cs.uiuc.edu/jeffe/open/intricate.html . (2000)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Self-Dual Polyhedral Cones and Their Slack Matrices;SIAM Journal on Matrix Analysis and Applications;2023-07-26
2. Vertex-facet assignments for polytopes;Beiträge zur Algebra und Geometrie / Contributions to Algebra and Geometry;2020-06-05