# Simultaneous embedding

In graph drawing and information visualization, simultaneous embedding is a technique for visualizing two or more different graphs on the same orâ€¦Â (More)
Wikipedia

1995-2017

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
• Handbook of Graph Drawing and Visualization
• 2013
Ignaz Rutter Karlsruhe Institute of Technology 11.Â
Is this relevant?
2013
2013
• Algorithmica
• 2013
A simultaneous embedding (with fixed edges) of two graphsÂ \$\$G^{\textcircled {1}}\$\$ G1 andÂ \$\$G^{\textcircled {2}}\$\$ G2 with commonâ€¦Â (More)
Is this relevant?
2012
2012
• Graph Drawing
• 2012
For two planar graphs G 1 = (V 1 , E 1 ) and G 2 = (V 2 , E 2 ) sharing a common subgraphG = G 1âˆ©G 2 the problem Simultaneousâ€¦Â (More)
Is this relevant?
2011
2011
• ISAAC
• 2011
Given k planar graphs G1,...,Gk, deciding whether they admit a simultaneous embedding with fixed edges (SEFE) and whether theyâ€¦Â (More)
Is this relevant?
2008
2008
• Graph Drawing
• 2008
We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph andâ€¦Â (More)
Is this relevant?
2007
2007
• J. Graph Algorithms Appl.
• 2007
A geometric simultaneous embedding of two graphs G1 = (V1, E1) and G2 = (V2, E2) with a bijective mapping of their vertex setsâ€¦Â (More)
Is this relevant?
2005
2005
• EuroCG
• 2005
Let G1 and G2 be a pair of planar graphs such that V (G1) = V (G2) = V . A simultaneous embedding [6] Î¨ = (Î“1,Î“2) of G1 and G2 isâ€¦Â (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
• J. Graph Algorithms Appl.
• 2004
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not allâ€¦Â (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which theâ€¦Â (More)
Is this relevant?
2002
2002
We consider the problem of simultaneous embedding of planar graphs. There are two variants of this problem, one in which theâ€¦Â (More)
Is this relevant?