The following pages link to (Q3997942):
Displaying 50 items.
- Relating bends and size in orthogonal graph drawings (Q293201) (← links)
- Self-organizing maps for drawing large graphs (Q293353) (← links)
- Two-layer planarization parameterized by feedback edge set (Q391093) (← links)
- Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices (Q436766) (← links)
- Partitioning strategies for the block Cimmino algorithm (Q525251) (← links)
- New algorithms for mimizing the longest wire length during circuit compaction. (Q676272) (← links)
- A parallel algorithm to construct a dominance graph on nonoverlapping rectangles (Q688835) (← links)
- Complexity of pairwise shortest path routing in the grid (Q703544) (← links)
- Layout algorithm for computer-aided design of double-sided printed circuit boards (Q809893) (← links)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem (Q831743) (← links)
- The number of guillotine partitions in \(d\) dimensions (Q844186) (← links)
- The shortest multipaths problem in a capacitated dense channel (Q859708) (← links)
- On partitioning of hypergraphs (Q879389) (← links)
- Approximating the bottleneck plane perfect matching of a point set (Q904112) (← links)
- A note on data structures for maintaining bipartitions (Q924550) (← links)
- On routing in VLSI design and communication networks (Q944702) (← links)
- On the parameterized complexity of layered graph drawing (Q958215) (← links)
- Area-time tradeoffs for universal VLSI circuits (Q959803) (← links)
- Polychromatic 4-coloring of guillotine subdivisions (Q989455) (← links)
- A Matrix Partitioning Interface to PaToH in MATLAB (Q991106) (← links)
- Mathematical methods for physical layout of printed circuit boards: an overview (Q991814) (← links)
- Octagonal drawings of plane graphs with prescribed face areas (Q1000923) (← links)
- Drawing slicing graphs with face areas (Q1007248) (← links)
- Geometric quadrisection in linear time, with application to VLSI placement (Q1019299) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- An assignment algorithm with applications to integrated circuit layout (Q1069442) (← links)
- A logic-topological calculus for the construction of integrated circuits. II. (Q1096590) (← links)
- Models and algorithms for structured layout (Q1113699) (← links)
- A framework for 1-D compaction with forbidden region avoidance (Q1194311) (← links)
- Minimum separation for single-layer channel routing (Q1199882) (← links)
- Modeling hypergraphs by graphs with the same mincut properties (Q1209979) (← links)
- Switchbox routing in VLSI design: Closing the complexity gap (Q1274317) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization (Q1276959) (← links)
- A note on formulations for the \(A\)-partition problem on hypergraphs (Q1276964) (← links)
- A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis (Q1276973) (← links)
- Combinatorial optimization models for production scheduling in automated manufacturing systems (Q1278813) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- A cell formation algorithm: Hypergraph approximation -- cut tree (Q1303737) (← links)
- The \(\gamma\)-connected assignment problem (Q1307813) (← links)
- The complexity of detecting crossingfree configurations in the plane (Q1317860) (← links)
- Node and edge relaxations of the max-cut problem (Q1319044) (← links)
- Some combinatorial optimization problems arising from VLSI circuit design (Q1319148) (← links)
- Best-so-far vs. where-you-are: Implications for optimal finite-time annealing (Q1319482) (← links)
- A near-optimal Manhattan channel router for a class of nets with the shift-right-one pattern (Q1324494) (← links)
- Dynamic programming and graph optimization problems (Q1327180) (← links)
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs (Q1327216) (← links)
- Quadratic \(0/1\) optimization and a decomposition approach for the placement of electronic circuits (Q1327559) (← links)
- The rectilinear class Steiner tree problem for intervals on two parallel lines (Q1327560) (← links)
