Drawing graphs on two and three lines.
Cornelsen, Sabine, Schank, Thomas, Wagner, Dorothea (2004)
Journal of Graph Algorithms and Applications
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Planar drawings of higher-genus graphs.”
Drawing graphs on two and three lines.
Geometric simultaneous embeddings of a graph and a matching.
Cabello, Sergio, Van Kreveld, Marc, Liotta, Giuseppe, Meijer, Henk, Speckmann, Bettina, Verbeek, Kevin (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:
Morphing planar graph drawings with bent edges.
Lubiw, Anna, Petrick, Mark (2011)
Journal of Graph Algorithms and Applications
Similarity:
Computing radial drawings on the minimum number of circles.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Meijer, Henk (2005)
Journal of Graph Algorithms and Applications
Similarity:
On the perspectives opened by right angle crossing drawings.
Angelini, Patrizio, Cittadini, Luca, Didimo, Walter, Frati, Fabrizio, Di Battista, Giuseppe, Kaufmann, Michael, Symvonis, Antonios (2011)
Journal of Graph Algorithms and Applications
Similarity:
New lower bounds for orthogonal drawings.
Biedl, Therese C. (1998)
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:
A split&push approach to orthogonal drawing.
Di Battista, Giuseppe, Patrignani, Maurizio (2000)
Journal of Graph Algorithms and Applications
Similarity:
Visual analysis of one-to-many matched graphs.
Di Giacomo, Emilio, Didimo, Walter, Liotta, Giuseppe, Palladino, Pietro (2010)
Journal of Graph Algorithms and Applications
Similarity:
On the cutting edge: simplified planarity by edge addition.
Boyer, John M., Myrvold, Wendy J. (2004)
Journal of Graph Algorithms and Applications
Similarity:
I/O-optimal algorithms for outerplanar graphs.
Maheshwari, Anil, Zeh, Norbert (2004)
Journal of Graph Algorithms and Applications
Similarity:
Connectivity of planar graphs.
de Fraysseix, Hubert, Ossona de Mendez, Patrice (2001)
Journal of Graph Algorithms and Applications
Similarity: