Convex polytope (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Convex polytope" in English language version.

refsWebsite

Global rank English rank

7doi.org

2^nd place

5ams.org

451^st place

277^th place

3semanticscholar.org

11^th place

8^th place

1books.google.com

3^rd place

1handle.net

102^nd place

76^th place

1jstor.org

26^th place

20^th place

1web.archive.org

1^st place

1arxiv.org

69^th place

59^th place

1eprintweb.org

low place

1inria.fr

4,903^rd place

3,679^th place

1harvard.edu

18^th place

17^th place

1worldcat.org

5^th place

ams.org

mathscinet.ams.org

Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549
Blind, Roswitha; Mani-Levitska, Peter (1987), "Puzzles and polytope isomorphisms", Aequationes Mathematicae, 34 (2–3): 287–297, doi:10.1007/BF01830678, MR 0921106, S2CID 120222616.
Kalai, Gil (1988), "A simple way to tell a simple polytope from its graph", Journal of Combinatorial Theory, Ser. A, 49 (2): 381–383, doi:10.1016/0097-3165(88)90064-7, MR 0964396.
Yao, Andrew Chi Chih (1981), "A lower bound to finding convex hulls", Journal of the ACM, 28 (4): 780–787, doi:10.1145/322276.322289, MR 0677089, S2CID 13846330; Ben-Or, Michael (1983), "Lower Bounds for Algebraic Computation Trees", Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83), pp. 80–86, doi:10.1145/800061.808735.

ams.org

Lawrence, Jim (1991). "Polytope volume computation". Mathematics of Computation. 57 (195): 259–271. Bibcode:1991MaCom..57..259L. doi:10.1090/S0025-5718-1991-1079024-2. ISSN 0025-5718.

arxiv.org

Kaibel, Volker; Schwartz, Alexander (2003). "On the Complexity of Polytope Isomorphism Problems". Graphs and Combinatorics. 19 (2): 215–230. arXiv:math/0106093. doi:10.1007/s00373-002-0503-y. S2CID 179936. Archived from the original on 2015-07-21.

books.google.com

Mathematical Programming, by Melvyn W. Jeter (1986) ISBN 0-8247-7478-7, p. 68

doi.org

Whitney, Hassler (1932). "Congruent graphs and the connectivity of graphs". Amer. J. Math. 54 (1): 150–168. doi:10.2307/2371086. hdl:10338.dmlcz/101067. JSTOR 2371086.
Blind, Roswitha; Mani-Levitska, Peter (1987), "Puzzles and polytope isomorphisms", Aequationes Mathematicae, 34 (2–3): 287–297, doi:10.1007/BF01830678, MR 0921106, S2CID 120222616.
Kalai, Gil (1988), "A simple way to tell a simple polytope from its graph", Journal of Combinatorial Theory, Ser. A, 49 (2): 381–383, doi:10.1016/0097-3165(88)90064-7, MR 0964396.
Kaibel, Volker; Schwartz, Alexander (2003). "On the Complexity of Polytope Isomorphism Problems". Graphs and Combinatorics. 19 (2): 215–230. arXiv:math/0106093. doi:10.1007/s00373-002-0503-y. S2CID 179936. Archived from the original on 2015-07-21.
Büeler, B.; Enge, A.; Fukuda, K. (2000). "Exact Volume Computation for Polytopes: A Practical Study". Polytopes — Combinatorics and Computation. pp. 131–154. doi:10.1007/978-3-0348-8438-9_6. ISBN 978-3-7643-6351-2.
Yao, Andrew Chi Chih (1981), "A lower bound to finding convex hulls", Journal of the ACM, 28 (4): 780–787, doi:10.1145/322276.322289, MR 0677089, S2CID 13846330; Ben-Or, Michael (1983), "Lower Bounds for Algebraic Computation Trees", Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83), pp. 80–86, doi:10.1145/800061.808735.
Lawrence, Jim (1991). "Polytope volume computation". Mathematics of Computation. 57 (195): 259–271. Bibcode:1991MaCom..57..259L. doi:10.1090/S0025-5718-1991-1079024-2. ISSN 0025-5718.

eprintweb.org

Kaibel, Volker; Schwartz, Alexander (2003). "On the Complexity of Polytope Isomorphism Problems". Graphs and Combinatorics. 19 (2): 215–230. arXiv:math/0106093. doi:10.1007/s00373-002-0503-y. S2CID 179936. Archived from the original on 2015-07-21.

handle.net

hdl.handle.net

Whitney, Hassler (1932). "Congruent graphs and the connectivity of graphs". Amer. J. Math. 54 (1): 150–168. doi:10.2307/2371086. hdl:10338.dmlcz/101067. JSTOR 2371086.

harvard.edu

ui.adsabs.harvard.edu

Lawrence, Jim (1991). "Polytope volume computation". Mathematics of Computation. 57 (195): 259–271. Bibcode:1991MaCom..57..259L. doi:10.1090/S0025-5718-1991-1079024-2. ISSN 0025-5718.

inria.fr

hal.inria.fr

Büeler, B.; Enge, A.; Fukuda, K. (2000). "Exact Volume Computation for Polytopes: A Practical Study". Polytopes — Combinatorics and Computation. pp. 131–154. doi:10.1007/978-3-0348-8438-9_6. ISBN 978-3-7643-6351-2.

jstor.org

Whitney, Hassler (1932). "Congruent graphs and the connectivity of graphs". Amer. J. Math. 54 (1): 150–168. doi:10.2307/2371086. hdl:10338.dmlcz/101067. JSTOR 2371086.

semanticscholar.org

api.semanticscholar.org

Blind, Roswitha; Mani-Levitska, Peter (1987), "Puzzles and polytope isomorphisms", Aequationes Mathematicae, 34 (2–3): 287–297, doi:10.1007/BF01830678, MR 0921106, S2CID 120222616.
Kaibel, Volker; Schwartz, Alexander (2003). "On the Complexity of Polytope Isomorphism Problems". Graphs and Combinatorics. 19 (2): 215–230. arXiv:math/0106093. doi:10.1007/s00373-002-0503-y. S2CID 179936. Archived from the original on 2015-07-21.
Yao, Andrew Chi Chih (1981), "A lower bound to finding convex hulls", Journal of the ACM, 28 (4): 780–787, doi:10.1145/322276.322289, MR 0677089, S2CID 13846330; Ben-Or, Michael (1983), "Lower Bounds for Algebraic Computation Trees", Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing (STOC '83), pp. 80–86, doi:10.1145/800061.808735.

web.archive.org

Kaibel, Volker; Schwartz, Alexander (2003). "On the Complexity of Polytope Isomorphism Problems". Graphs and Combinatorics. 19 (2): 215–230. arXiv:math/0106093. doi:10.1007/s00373-002-0503-y. S2CID 179936. Archived from the original on 2015-07-21.

worldcat.org

Lawrence, Jim (1991). "Polytope volume computation". Mathematics of Computation. 57 (195): 259–271. Bibcode:1991MaCom..57..259L. doi:10.1090/S0025-5718-1991-1079024-2. ISSN 0025-5718.