Author:
Pfeifle Julian,Ziegler Günter M.
Reference21 articles.
1. The number of simplicial neighbourly
d
‐polytopes with
d
+3 vertices
2. Gärtner, B., Solymosi, J., Tschirschnitz, F., Valtr, P. and Welzl, E. “One Line andnPoints.”. Proceedings 33rd Annual ACM Symposium on the Theory of Computing (STOC). pp.306–315. New York: ACM. [Gärtner et al. 01]
3. polymake: a Framework for Analyzing Convex Polytopes
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Monotone Diameter of Bisubmodular Polyhedra;Operations Research Forum;2023-10-07
2. On the Length of Monotone Paths in Polyhedra;SIAM Journal on Discrete Mathematics;2021-01
3. A Mihalisin–Klee Theorem for Fans;Discrete & Computational Geometry;2016-05-20
4. Monotone Paths in Planar Convex Subdivisions and Polytopes;Discrete Geometry and Optimization;2013
5. Computing monotone disjoint paths on polytopes;Journal of Combinatorial Optimization;2008-04-02