Polyhedral combinatorics (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Polyhedral combinatorics" in English language version.

refsWebsite

Global rank English rank

13doi.org

2^nd place

11arxiv.org

69^th place

59^th place

3ams.org

451^st place

277^th place

1semanticscholar.org

11^th place

8^th place

ams.org (Global: 451^st place; English: 277^th place)

mathscinet.ams.org

Santos (2012). Santos, Francisco (2012), "A counterexample to the Hirsch conjecture", Annals of Mathematics, 176 (1), Princeton University and Institute for Advanced Study: 383–412, arXiv:1006.2814, doi:10.4007/annals.2012.176.1.7, MR 2925387
Kalai & Kleitman (1992). Kalai, Gil; Kleitman, Daniel J. (1992), "A quasi-polynomial bound for the diameter of graphs of polyhedra", Bulletin of the American Mathematical Society, 26 (2): 315–316, arXiv:math/9204233, doi:10.1090/S0273-0979-1992-00285-9, MR 1130448.
Naddef (1989). Naddef, Denis (1989), "The Hirsch conjecture is true for (0,1)-polytopes", Mathematical Programming, 45 (1): 109–110, doi:10.1007/BF01589099, MR 1017214.

arxiv.org (Global: 69^th place; English: 59^th place)

Ziegler (1995), p. 51. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 245–246. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), p. 272. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 246–253. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 254–258. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Balinski (1961); Ziegler (1995), pp. 95–96. Balinski, Michel L. (1961), "On the graph structure of convex polyhedra in n-space", Pacific Journal of Mathematics, 11 (2): 431–434, doi:10.2140/pjm.1961.11.431. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 103–126. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Santos (2012). Santos, Francisco (2012), "A counterexample to the Hirsch conjecture", Annals of Mathematics, 176 (1), Princeton University and Institute for Advanced Study: 383–412, arXiv:1006.2814, doi:10.4007/annals.2012.176.1.7, MR 2925387
Kalai & Kleitman (1992). Kalai, Gil; Kleitman, Daniel J. (1992), "A quasi-polynomial bound for the diameter of graphs of polyhedra", Bulletin of the American Mathematical Society, 26 (2): 315–316, arXiv:math/9204233, doi:10.1090/S0273-0979-1992-00285-9, MR 1130448.
Haase & Kiefer (2016), Thm. 5. Haase, Christoph; Kiefer, Stefan (2016), "The complexity of the $K$ th largest subset problem and related problems", Information Processing Letters, 116 (2): 111–115, arXiv:1501.06729, doi:10.1016/j.ipl.2015.09.015, S2CID 9195513
Ziegler (2000). Ziegler, Günter M. (2000), "Lectures on 0-1 polytopes", in Kalai, Gil; Ziegler, Günter M. (eds.), Polytopes — Combinatorics and Computation, DMV Seminar, vol. 29, pp. 1–41, arXiv:math/9909177, doi:10.1007/978-3-0348-8438-9_1, ISBN 978-3-7643-6351-2.

doi.org (Global: 2^nd place; English: 2^nd place)

Ziegler (1995), p. 51. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 245–246. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), p. 272. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 246–253. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 254–258. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Höppner & Ziegler (2000). Höppner, Andrea; Ziegler, Günter M. (2000), "A census of flag-vectors of 4-polytopes", in Kalai, Gil; Ziegler, Günter M. (eds.), Polytopes — Combinatorics and Computation, DMV Seminar, vol. 29, pp. 105–110, doi:10.1007/978-3-0348-8438-9_4, ISBN 978-3-7643-6351-2.
Balinski (1961); Ziegler (1995), pp. 95–96. Balinski, Michel L. (1961), "On the graph structure of convex polyhedra in n-space", Pacific Journal of Mathematics, 11 (2): 431–434, doi:10.2140/pjm.1961.11.431. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Ziegler (1995), pp. 103–126. Ziegler, Günter M. (1995), Lectures on Polytopes, Graduate Texts in Mathematics, vol. 152, Springer-Verlag, arXiv:math/9909177, doi:10.1007/978-1-4613-8431-1, ISBN 0-387-94365-X.
Santos (2012). Santos, Francisco (2012), "A counterexample to the Hirsch conjecture", Annals of Mathematics, 176 (1), Princeton University and Institute for Advanced Study: 383–412, arXiv:1006.2814, doi:10.4007/annals.2012.176.1.7, MR 2925387
Kalai & Kleitman (1992). Kalai, Gil; Kleitman, Daniel J. (1992), "A quasi-polynomial bound for the diameter of graphs of polyhedra", Bulletin of the American Mathematical Society, 26 (2): 315–316, arXiv:math/9204233, doi:10.1090/S0273-0979-1992-00285-9, MR 1130448.
Naddef (1989). Naddef, Denis (1989), "The Hirsch conjecture is true for (0,1)-polytopes", Mathematical Programming, 45 (1): 109–110, doi:10.1007/BF01589099, MR 1017214.
Haase & Kiefer (2016), Thm. 5. Haase, Christoph; Kiefer, Stefan (2016), "The complexity of the $K$ th largest subset problem and related problems", Information Processing Letters, 116 (2): 111–115, arXiv:1501.06729, doi:10.1016/j.ipl.2015.09.015, S2CID 9195513
Ziegler (2000). Ziegler, Günter M. (2000), "Lectures on 0-1 polytopes", in Kalai, Gil; Ziegler, Günter M. (eds.), Polytopes — Combinatorics and Computation, DMV Seminar, vol. 29, pp. 1–41, arXiv:math/9909177, doi:10.1007/978-3-0348-8438-9_1, ISBN 978-3-7643-6351-2.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Haase & Kiefer (2016), Thm. 5. Haase, Christoph; Kiefer, Stefan (2016), "The complexity of the $K$ th largest subset problem and related problems", Information Processing Letters, 116 (2): 111–115, arXiv:1501.06729, doi:10.1016/j.ipl.2015.09.015, S2CID 9195513

Polyhedral combinatorics (English Wikipedia)

ams.org (Global: 451st place; English: 277th place)

mathscinet.ams.org

arxiv.org (Global: 69th place; English: 59th place)

doi.org (Global: 2nd place; English: 2nd place)

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

ams.org (Global: 451^st place; English: 277^th place)

arxiv.org (Global: 69^th place; English: 59^th place)

doi.org (Global: 2^nd place; English: 2^nd place)

semanticscholar.org (Global: 11^th place; English: 8^th place)