Cited in
(28)- Computing k-modal embeddings of planar digraphs
- ChordLink: a new hybrid visualization model
- Algorithms and bounds for L-drawings of directed graphs
- OnGraX: a web-based system for the collaborative visual analysis of graphs
- Beyond Clustered Planar Graphs
- 2-colored point-set embeddings of partial 2-trees
- GDToolkit
- yEd
- GVF
- ScalaBLAST
- ThemeRiver
- Algorithm 447
- WebGL
- PAST
- CoCoNutTrix
- OnGraX
- PermutMatrix
- Circos
- GiViP
- Graft
- ZAME
- ChordLink
- A user study on hybrid graph visualizations
- C-planarity testing of embedded clustered graphs with bounded dual carving-width
- \((k,p)\)-planarity: a relaxation of hybrid planarity
- McSparse
- Seriation and matrix reordering methods: An historical overview
- Parameterized complexity of graph planarity with restricted cyclic orders
This page was built for software: NodeTrix
