Pages that link to "Item:Q3950484"
From MaRDI portal
The following pages link to New lower bound techniques for VLSI (Q3950484):
Displaying 40 items.
- Degrees of nonlinearity in forbidden 0-1 matrix problems (Q409347) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Complexities of layouts in three-dimensional VLSI circuits (Q753802) (← links)
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- Multilayer grid embeddings for VLSI (Q916362) (← links)
- A lower bound on the area of permutation layouts (Q922710) (← links)
- A bipartite strengthening of the crossing Lemma (Q968451) (← links)
- On edges crossing few other edges in simple topological complete graphs (Q1011770) (← links)
- Extremal problems on triangle areas in two and three dimensions (Q1040833) (← links)
- Long edges in the layouts of shuffle-exchange and cube-connected cycles graphs (Q1084869) (← links)
- A compact layout for the three-dimensional tree of meshes (Q1105621) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Shallow grates (Q1314391) (← links)
- The crossing number of locally twisted cubes \(L T Q_n\) (Q1671371) (← links)
- Orthogonal and smooth orthogonal layouts of 1-planar graphs with low edge complexity (Q1725786) (← links)
- On the \(k\)-planar local crossing number (Q1727762) (← links)
- An asymptotically optimal layout for the shuffle-exchange graph (Q1838315) (← links)
- Which crossing number is it anyway? (Q1850498) (← links)
- Crossing number, pair-crossing number, and expansion (Q1880792) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Testing gap \(k\)-planarity is NP-complete (Q2032139) (← links)
- Crossing lemma for the odd-crossing number (Q2088881) (← links)
- Separator-based graph embedding into multidimensional grids with small edge-congestion (Q2341722) (← links)
- Feedback vertex sets in mesh-based networks (Q2383604) (← links)
- On the decay of crossing numbers (Q2464150) (← links)
- An upper bound for the crossing number of augmented cubes (Q2868165) (← links)
- Space Crossing Numbers (Q2888867) (← links)
- Crossing and Weighted Crossing Number of Near-Planar Graphs (Q3611835) (← links)
- Crossing numbers of random graphs (Q4798172) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)
- A survey of graphs with known or bounded crossing numbers (Q5139701) (← links)
- SIMULTANEOUS ARITHMETIC PROGRESSIONS ON ALGEBRAIC CURVES (Q5198395) (← links)
- Applications of a New Separator Theorem for String Graphs (Q5414146) (← links)
- A Bipartite Strengthening of the Crossing Lemma (Q5452205) (← links)
- Non-Crossing Shortest Paths in Undirected Unweighted Planar Graphs in Linear Time (Q5886044) (← links)
- String graphs and incomparability graphs (Q5891657) (← links)
- From art and circuit design to geometry and combinatorics (Q6064580) (← links)
- Non-crossing shortest paths lengths in planar graphs in linear time (Q6153472) (← links)
