Self-duality of polytopes and its relations to vertex enumeration and graph isomorphism (Q2014726): Difference between revisions

@@ Property / DOI @@
-.1007/s00373-013-1299-7
@@ Property / DOI: 10.1007/s00373-013-1299-7 / rank @@
-Normal rank
@@ Property / cites work @@
+The construction of self-dual projective polyhedra
+Normal rank
@@ Property / cites work @@
+How good are convex hull algorithms?
@@ Property / cites work: How good are convex hull algorithms? / rank @@
+Normal rank
@@ Property / cites work @@
+Neighborhood hypergraphs of bipartite graphs
@@ Property / cites work: Neighborhood hypergraphs of bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual methods for vertex and facet enumeration
+Normal rank
@@ Property / cites work @@
+Generating all vertices of a polyhedron is hard
@@ Property / cites work: Generating all vertices of a polyhedron is hard / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of four polyhedral set containment problems
+Normal rank
@@ Property / cites work @@
+A non-involutory selfduality
@@ Property / cites work: A non-involutory selfduality / rank @@
+Normal rank
@@ Property / cites work @@
+Is Selfduality Involutory?
@@ Property / cites work: Is Selfduality Involutory? / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the face lattice of a polytope from its vertex-facet incidences
+Normal rank
@@ Property / cites work @@
+On the complexity of polytope isomorphism problems
+Normal rank
@@ Property / cites work @@
+The maximum numbers of faces of a convex polytope
@@ Property / cites work: The maximum numbers of faces of a convex polytope / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of computing intersection, union and Minkowski sum of polytopes
+Normal rank
@@ Property / cites work @@
+Lectures on Polytopes
@@ Property / cites work: Lectures on Polytopes / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00373-013-1299-7
@@ Property / DOI: 10.1007/S00373-013-1299-7 / rank @@
+Normal rank