Concepedia

Dynamic Planar Graph Algorithms

Dynamic Planar Graph Algorithms is a class of algorithmic methods designed to maintain and query planar graph properties under dynamic edge insertions and deletions while preserving planarity and ensuring efficient update and query time complexity.

15

Publications

877

Citations

26

Authors

24

Institutions

Publications per year

2017–2026

1

Parents

Publications

15

On-Line Planarity Testing

Giuseppe Di Battista, Roberto Tamassia · SIAM Journal on Computing · 1996 · 241 citations

, , +10

Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees

Greg N. Frederickson · SIAM Journal on Computing · 1997 · 103 citations

, , +15

Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

Greg N. Frederickson · 2002 · 102 citations

, , +15

Maintenance of a minimum spanning forest in a dynamic planar graph

David Eppstein, Giuseppe F. Italiano, Roberto Tamassia et al. · Symposium on Discrete Algorithms · 1990 · 63 citations

, , +13

New Results on Dynamic Planar Point Location

Siu-Wing Cheng, Ravi Janardan · SIAM Journal on Computing · 1992 · 55 citations

, , +12

1–5 of 15

Authors

26

  1. GF
    Giuseppe F. Italiano

    University of Rome Tor Vergata, Italy

    5 publications · 199 citations

    5

    h-index

  2. DE
    David Eppstein

    University of California, Irvine, United States

    4 publications · 179 citations

    4

    h-index

  3. ZG
    Zvi Galil

    Tel Aviv University, Israel

    4 publications · 136 citations

    4

    h-index

  4. RT
    Roberto Tamassia

    Brown University, United States

    3 publications · 358 citations

    3

    h-index

  5. TH
    Thomas H. Spencer

    Rensselaer Polytechnic Institute, United States

    3 publications · 116 citations

    3

    h-index

1–5 of 26

Institutions

24

  1. Columbia University

    New York, United States

    3 h-index

    4 publications

    192 citations

  2. Sapienza University of Rome

    Rome, Italy

    2 h-index

    4 publications

    208 citations

  3. Purdue University West Lafayette

    West Lafayette, United States

    2 h-index

    2 publications

    205 citations

  4. Brown University

    Providence, United States

    2 h-index

    2 publications

    117 citations

  5. IBM Research - Thomas J. Watson Research Center

    Yorktown Heights, United States

    2 h-index

    2 publications

    83 citations

  6. Istituto di Analisi dei Sistemi ed Informatica Antonio Ruberti

    Rome, Italy

    1 h-index

    1 publications

    54 citations

  7. Tel Aviv University

    Tel Aviv, Israel

    1 h-index

    1 publications

    46 citations

  8. Shandong University

    Jinan, China

    1 h-index

    1 publications

    48 citations

1–8 of 24

Venues

  1. SIAM Journal on Computing

    4 publications · 429 citations

    4

    h-index

  2. Discrete & Computational Geometry

    1 publications · 15 citations

    1

    h-index

  3. Discrete Applied Mathematics

    1 publications · 48 citations

    1

    h-index

  4. Journal of the ACM

    JACM · 1 publications · 20 citations

    1

    h-index

  5. ACM Conference on Hypertext

    Conference · 1 publications · 32 citations

    1

    h-index

1–5