Planarity Testing

Planarity Testing is a computational method in graph drawing that determines whether a given graph can be embedded in the plane without edge crossings, distinguishing it from other graph layout techniques by its focus on topological embeddability.

84

Publications

6.2K

Citations

172

Authors

86

Institutions

Publications per year

2017–2026

7

Authors

172

  1. GD
    Giuseppe Di Battista

    Roma Tre University, Italy

    11 publications · 774 citations

    11

    h-index

  2. MP
    Maurizio Patrignani

    Roma Tre University, Italy

    6 publications · 182 citations

    6

    h-index

  3. GL
    Giuseppe Liotta

    University of Perugia, Italy

    6 publications · 176 citations

    6

    h-index

  4. FF
    Fabrizio Frati

    Roma Tre University, Italy

    5 publications · 167 citations

    5

    h-index

  5. RT
    Roberto Tamassia

    Brown University, United States

    5 publications · 795 citations

    5

    h-index

1–5 of 172

Venues

  1. Journal of Graph Algorithms and Applications

    JGAA · 14 publications · 594 citations

    12

    h-index

  2. SIAM Journal on Computing

    8 publications · 949 citations

    8

    h-index

  3. Algorithmica

    5 publications · 159 citations

    5

    h-index

  4. Journal of Computer and System Sciences

    4 publications · 1.6K citations

    4

    h-index

  5. Journal of the ACM

    JACM · 4 publications · 1.2K citations

    4

    h-index

1–5