Pages that link to "Item:Q4706191"

The following pages link to Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas (Q4706191):

Displaying 15 items.

• Orthogonal drawings and crossing numbers of the Kronecker product of two cycles (Q433407) (← links)
• Planar crossing numbers of graphs of bounded genus (Q452001) (← links)
• Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
• A tighter insertion-based approximation of the crossing number (Q2012882) (← links)
• Exact crossing number parameterized by vertex cover (Q2206863) (← links)
• Approximating the rectilinear crossing number (Q2331210) (← links)
• Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
• Crossing number additivity over edge cuts (Q2444731) (← links)
• A bottleneck matching problem with edge-crossing constraints (Q2792796) (← links)
• Approximating the Rectilinear Crossing Number (Q2961535) (← links)
• The crossing number of a projective graph is quadratic in the face–width (Q3503476) (← links)
• The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
• Approximating the Crossing Number of Toroidal Graphs (Q5387753) (← links)
• Crossing minimization in perturbed drawings (Q5896138) (← links)
• Inserting Multiple Edges into a Planar Graph (Q6075710) (← links)