The following pages link to (Q3997942):
Displayed 50 items.
- Orders induced by segments in floorplans and (2-14-3, 3-41-2)-avoiding permutations (Q1953524) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- Orthogonal planarity testing of bounded treewidth graphs (Q2071827) (← links)
- A novel formulation of the max-cut problem and related algorithm (Q2287710) (← links)
- Spectral bounds for graph partitioning with prescribed partition sizes (Q2328109) (← links)
- Optimal two-sided embeddings of complete binary trees in rectangular grids (Q2332034) (← links)
- Well-solvable cases of the QAP with block-structured matrices (Q2345597) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- Efficient cell-based migration of VLSI layout (Q2357851) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- A simple optimal binary representation of mosaic floorplans and Baxter permutations (Q2445870) (← links)
- A better heuristic for area-compaction of orthogonal representations (Q2489402) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Worst-case ratios of networks in the rectilinear plane (Q2764995) (← links)
- Automatic layout of statecharts (Q2783199) (← links)
- SDP Relaxations for Some Combinatorial Optimization Problems (Q2802546) (← links)
- Constrained Min-Cut Replication for <i>K</i>-Way Hypergraph Partitioning (Q2962559) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- An implicit enumeration scheme for the batch selection problem (Q3156829) (← links)
- Graph Compact Orthogonal Layout Algorithm (Q3195336) (← links)
- Overloaded Orthogonal Drawings (Q3223958) (← links)
- The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures (Q3300489) (← links)
- A spectral heuristic for bisecting random graphs (Q3419599) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- Adapting Iterative-Improvement Heuristics for Scheduling File-Sharing Tasks on Heterogeneous Platforms (Q3603112) (← links)
- VLSI Placement Using Quadratic Programming and Network Partitioning Techniques (Q3842992) (← links)
- Optimal compactification of a floorplan and its relation to other optimization problems-a dynamic programming approach (Q4031971) (← links)
- Finding part-machine families using graph partitioning techniques (Q4230183) (← links)
- An optimal algorithm for layered wheel floorplan designs (Q4262697) (← links)
- Efficient algorithms for minimum range cut problems (Q4313630) (← links)
- A linear algorithm for compact box-drawings of trees (Q4432764) (← links)
- Un Algorithme pour la Bipartition d'un Graphe en Sous-graphes de Cardinalité Fixée (Q4546064) (← links)
- Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees (Q4603494) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- PATHWIDTH AND LAYERED DRAWINGS OF TREES (Q4652929) (← links)
- Data structures for maintaining set partitions (Q4810507) (← links)
- COMBINING HELPFUL SETS AND PARALLEL SIMULATED ANNEALING FOR THE GRAPH-PARTITIONING PROBLEM∗ (Q4820145) (← links)
- Global convergence of the alternating projection method for the Max-Cut relaxation problem (Q5005866) (← links)
- On Turn-Regular Orthogonal Representations (Q5014121) (← links)
- On Turn-Regular Orthogonal Representations (Q5049999) (← links)
- On triangulating planar graphs under the four-connectivity constraint (Q5056168) (← links)
- Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
- On bipartite crossings, largest biplanar subgraphs, and the linear arrangement problem (Q5096926) (← links)
- (Q5111755) (← links)
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning (Q5140705) (← links)
- A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks (Q5357510) (← links)
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS (Q5470176) (← links)
- On the approximability of time disjoint walks (Q5918517) (← links)