Pith. sign in

REVIEW 2 cited by

Simultaneous Embedding of Planar Graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1204.5853 v3 pith:DYNHPFNJ submitted 2012-04-26 cs.DS cs.DM

classification cs.DScs.DM
keywords embeddinggraphssimultaneousworkbasisbeenconcerneddeal
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Simultaneous embedding is concerned with simultaneously representing a series of graphs sharing some or all vertices. This forms the basis for the visualization of dynamic graphs and thus is an important field of research. Recently there has been a great deal of work investigating simultaneous embedding problems both from a theoretical and a practical point of view. We survey recent work on this topic.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Monotone Clustered Level Planarity

    cs.DS 2026-07 conditional novelty 7.0 of 10

    mCLP is NP-complete even on constant-size-tree forests with bounded levels or clusters, and FPT when parameterized by vertex cover number plus number of clusters.

  2. Simultaneous Representation of Proper and Unit Interval Graphs

    cs.DS 2019-08 accept novelty 7.0 of 10

    Simultaneous proper interval graphs can be recognized in linear time and simultaneous unit interval graphs in O(|V||E|) time in the sunflower case, and both become NP-complete without the sunflower restriction.

Pith tools