The following pages link to (Q3997942):
Displayed 37 items.
- 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)
- The DFS-heuristic for orthogonal graph drawing (Q5943316) (← links)
- On the complexity of orthogonal compaction (Q5943322) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- Some polynomially solvable subcases of the detailed routing problem in VLSI design (Q5954248) (← links)
- Rectangular drawings of plane graphs without designated corners (Q5959556) (← links)
- Graph Bipartization Problem with Applications to Via Minimization in VLSI Design (Q6132388) (← links)
- A local search approximation algorithm for the multiway cut problem (Q6166037) (← links)
- Visibility representations of toroidal and Klein-bottle graphs (Q6172216) (← links)
- New approximation results on graph matching and related problems (Q6184382) (← links)