Hasse diagram (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Hasse diagram" in English language version.

refsWebsite

Global rank English rank

6doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

1ams.org

451^st place

277^th place

1hawaii.edu

1,308^th place

924^th place

1brown.edu

2,481^st place

1,558^th place

1psu.edu

207^th place

136^th place

ams.org

mathscinet.ams.org

Rival (1985), p. 110. Rival, Ivan (1985), "The diagram", in Rival, Ivan (ed.), Graphs and Order: The Role of Graphs in the Theory of Ordered Sets and Its Applications, Proceedings of the NATO Advanced Study Institute held in Banff, May 18–31, 1984, NATO Advanced Science Institutes Series C: Mathematical and Physical Sciences, vol. 147, Reidel, Dordrecht, pp. 103–133, MR 0818494

brown.edu

cs.brown.edu

Garg & Tamassia (1995a), Theorem 15, p. 125; Bertolazzi et al. (1993). Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717 Bertolazzi, R; Di Battista, G.; Mannino, C.; Tamassia, R. (1993), "Optimal upward planarity testing of single-source digraphs" (PDF), Proc. 1st European Symposium on Algorithms (ESA '93), Lecture Notes in Computer Science, vol. 726, Springer-Verlag, pp. 37–48, CiteSeerX 10.1.1.43.4879, doi:10.1007/3-540-57273-2_42, ISBN 978-3-540-57273-2

doi.org

E.g., see Di Battista & Tamassia (1988) and Freese (2004). Di Battista, G.; Tamassia, R. (1988), "Algorithms for plane representation of acyclic digraphs", Theoretical Computer Science, 61 (2–3): 175–178, doi:10.1016/0304-3975(88)90123-5 Freese, Ralph (2004), "Automated lattice drawing", Concept Lattices (PDF), Lecture Notes in Computer Science, vol. 2961, Springer-Verlag, pp. 589–590
Garg & Tamassia (1995a), Theorem 9, p. 118; Baker, Fishburn & Roberts (1971), theorem 4.1, page 18. Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717
Garg & Tamassia (1995a), Theorem 15, p. 125; Bertolazzi et al. (1993). Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717 Bertolazzi, R; Di Battista, G.; Mannino, C.; Tamassia, R. (1993), "Optimal upward planarity testing of single-source digraphs" (PDF), Proc. 1st European Symposium on Algorithms (ESA '93), Lecture Notes in Computer Science, vol. 726, Springer-Verlag, pp. 37–48, CiteSeerX 10.1.1.43.4879, doi:10.1007/3-540-57273-2_42, ISBN 978-3-540-57273-2
Garg & Tamassia (1995a), Corollary 1, p. 132; Garg & Tamassia (1995b). Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717 Garg, Ashim; Tamassia, Roberto (1995b), "On the computational complexity of upward and rectilinear planarity testing", Graph Drawing (Proc. GD '94), LectureNotes in Computer Science, vol. 894, Springer-Verlag, pp. 286–297, doi:10.1007/3-540-58950-3_384, ISBN 978-3-540-58950-1
Chan (2004). Chan, Hubert (2004), "A parameterized algorithm for upward planarity testing", Proc. 12th European Symposium on Algorithms (ESA '04), Lecture Notes in Computer Science, vol. 3221, Springer-Verlag, pp. 157–168, doi:10.1007/978-3-540-30140-0_16
Jünger & Leipert (1999). Jünger, Michael; Leipert, Sebastian (1999), "Level planar embedding in linear time", Graph Drawing (Proc. GD '99), Lecture Notes in Computer Science, vol. 1731, pp. 72–81, doi:10.1007/3-540-46648-7_7, ISBN 978-3-540-66904-3

hawaii.edu

math.hawaii.edu

E.g., see Di Battista & Tamassia (1988) and Freese (2004). Di Battista, G.; Tamassia, R. (1988), "Algorithms for plane representation of acyclic digraphs", Theoretical Computer Science, 61 (2–3): 175–178, doi:10.1016/0304-3975(88)90123-5 Freese, Ralph (2004), "Automated lattice drawing", Concept Lattices (PDF), Lecture Notes in Computer Science, vol. 2961, Springer-Verlag, pp. 589–590

psu.edu

citeseerx.ist.psu.edu

Garg & Tamassia (1995a), Theorem 15, p. 125; Bertolazzi et al. (1993). Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717 Bertolazzi, R; Di Battista, G.; Mannino, C.; Tamassia, R. (1993), "Optimal upward planarity testing of single-source digraphs" (PDF), Proc. 1st European Symposium on Algorithms (ESA '93), Lecture Notes in Computer Science, vol. 726, Springer-Verlag, pp. 37–48, CiteSeerX 10.1.1.43.4879, doi:10.1007/3-540-57273-2_42, ISBN 978-3-540-57273-2

semanticscholar.org

api.semanticscholar.org

Garg & Tamassia (1995a), Theorem 9, p. 118; Baker, Fishburn & Roberts (1971), theorem 4.1, page 18. Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717
Garg & Tamassia (1995a), Theorem 15, p. 125; Bertolazzi et al. (1993). Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717 Bertolazzi, R; Di Battista, G.; Mannino, C.; Tamassia, R. (1993), "Optimal upward planarity testing of single-source digraphs" (PDF), Proc. 1st European Symposium on Algorithms (ESA '93), Lecture Notes in Computer Science, vol. 726, Springer-Verlag, pp. 37–48, CiteSeerX 10.1.1.43.4879, doi:10.1007/3-540-57273-2_42, ISBN 978-3-540-57273-2
Garg & Tamassia (1995a), Corollary 1, p. 132; Garg & Tamassia (1995b). Garg, Ashim; Tamassia, Roberto (1995a), "Upward planarity testing", Order, 12 (2): 109–133, doi:10.1007/BF01108622, S2CID 14183717 Garg, Ashim; Tamassia, Roberto (1995b), "On the computational complexity of upward and rectilinear planarity testing", Graph Drawing (Proc. GD '94), LectureNotes in Computer Science, vol. 894, Springer-Verlag, pp. 286–297, doi:10.1007/3-540-58950-3_384, ISBN 978-3-540-58950-1