The following pages link to (Q3154375):
Displaying 50 items.
- Computing straight-line 3D grid drawings of graphs in linear volume (Q2387202) (← links)
- A note on 3D orthogonal drawings with direction constrained edges (Q2390232) (← links)
- Algorithms for solving the symmetry number problem on trees (Q2390304) (← links)
- On RAC drawings of 1-planar graphs (Q2402260) (← links)
- An annotated bibliography on 1-planarity (Q2407041) (← links)
- Skyscraper polytopes and realizations of plane triangulations (Q2407381) (← links)
- \(\mathsf{NIC}\)-planar graphs (Q2410219) (← links)
- Universal slope sets for 1-bend planar drawings (Q2414867) (← links)
- A linear-time algorithm for star-shaped drawings of planar graphs with the minimum number of concave corners (Q2428681) (← links)
- Algorithms for the multiple label placement problem (Q2432730) (← links)
- Approximating the fixed linear crossing number (Q2456999) (← links)
- Crossing-constrained hierarchical drawings (Q2458930) (← links)
- A framework and algorithms for circular drawings of graphs (Q2465996) (← links)
- Drawing cubic graphs with at most five slopes (Q2483558) (← links)
- A better heuristic for area-compaction of orthogonal representations (Q2489402) (← links)
- Minimizing crossings in hierarchical digraphs with a hybridized genetic algorithm (Q2491331) (← links)
- An analysis of some linear graph layout heuristics (Q2491338) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- Upward planar graphs and their duals (Q2512656) (← links)
- A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
- Orthogonal drawings of graphs with vertex and edge labels (Q2573336) (← links)
- One-dimensional layout optimization, with applications to graph drawing by axis separation (Q2573337) (← links)
- Hanani-Tutte for radial planarity. II (Q2684882) (← links)
- Parameterized complexity of graph planarity with restricted cyclic orders (Q2698291) (← links)
- Drawing partial 2-trees with few slopes (Q2701381) (← links)
- (Q2728899) (← links)
- Automatic layout of statecharts (Q2783199) (← links)
- Simultaneous Visibility Representations of Plane st-graphs Using L-shapes (Q2827815) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- Combinatorial Vector Field Topology in Three Dimensions (Q2915450) (← links)
- Realizability of Graphs as Triangle Cover Contact Graphs (Q2958333) (← links)
- 1-Bend Upward Planar Drawings of SP-Digraphs (Q2961509) (← links)
- On the Density of Non-simple 3-Planar Graphs (Q2961527) (← links)
- Hanani-Tutte for Radial Planarity II (Q2961539) (← links)
- An Experimental Study on the Ply Number of Straight-Line Drawings (Q2980905) (← links)
- A Satisfiability-Based Approach for Embedding Generalized Tanglegrams on Level Graphs (Q3007679) (← links)
- The Straight-Line RAC Drawing Problem Is NP-Hard (Q3075508) (← links)
- Algorithms and Bounds for L-Drawings of Directed Graphs (Q3177336) (← links)
- Drawing Graphs with Right Angle Crossings (Q3183456) (← links)
- Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames (Q3223941) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- Overloaded Orthogonal Drawings (Q3223958) (← links)
- Force-Directed Lombardi-Style Graph Drawing (Q3223966) (← links)
- Monotone Drawings of Graphs with Fixed Embedding (Q3223970) (← links)
- Classification of Planar Upward Embedding (Q3223973) (← links)
- Random Generation of Directed Acyclic Graphs (Q3438982) (← links)
- Geometric Thickness in a Grid of Linear Area (Q3438999) (← links)
- Straight-Line Drawability of a Planar Graph Plus an Edge (Q3449828) (← links)
- A GENERAL APPROXIMATION ALGORITHM FOR PLANAR MAPS WITH APPLICATIONS (Q3503105) (← links)
- On embedding triconnected cubic graphs on point sets (Q3503515) (← links)
