Drawing planar graphs with large vertices and thick edges.
Barequet, Gill, Goodrich, Michael T., Riley, Chris (2004)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “Characterizing families of cuts that can be represented by axis-parallel rectangles.”
Drawing planar graphs with large vertices and thick edges.
Clustering cycles into cycles of clusters.
Cortese, Pier Francesco, Di Battista, Giuseppe, Patrignani, Maurizio, Pizzonia, Maurizio (2005)
Journal of Graph Algorithms and Applications
Similarity:
Planarity testing and optimal edge insertion with embedding constraints.
Gutwenger, Carsten, Klein, Karsten, Mutzel, Petra (2008)
Journal of Graph Algorithms and Applications
Similarity:
Planar drawings of higher-genus graphs.
Duncan, Christian A., Goodrich, Michael T., Kobourov, Stephen G. (2011)
Journal of Graph Algorithms and Applications
Similarity:
Lower bounds for the number of bends in three-dimensional orthogonal graph drawings.
Wood, David R. (2003)
Journal of Graph Algorithms and Applications
Similarity:
On the crossing numbers of and
Stanislav Jendroľ, Mária Ščerbová (1982)
Časopis pro pěstování matematiky
Similarity:
Drawing clustered graphs on an orthogonal grid.
Eades, Peter, Feng, Qingwen, Nagamochi, Hiroshi (1999)
Journal of Graph Algorithms and Applications
Similarity:
Straight-line drawings on restricted integer grids in two and three dimensions.
Felsner, Stefan, Liotta, Giuseppe, Wismath, Stephen (2003)
Journal of Graph Algorithms and Applications
Similarity:
Embedding vertices at points: Few bends suffice for planar graphs.
Kaufmann, Michael, Wiese, Roland (2002)
Journal of Graph Algorithms and Applications
Similarity:
On external-memory planar depth first search.
Arge, Lars, Meyer, Ulrich, Toma, Laura, Zeh, Norbert (2003)
Journal of Graph Algorithms and Applications
Similarity: