The following pages link to (Q3997942):
Displayed 50 items.
- Geometric thickness in a grid (Q1417581) (← links)
- Orthogonal drawings based on the stratification of planar graphs (Q1422412) (← links)
- A new lower bound for the bipartite crossing number with applications (Q1575746) (← links)
- Algorithms for graph partitioning problems by means of eigenspace relaxations (Q1577115) (← links)
- Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem (Q1602704) (← links)
- Greedy splitting algorithms for approximating multiway partition problems (Q1769071) (← links)
- The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation. (Q1853036) (← links)
- On the area of hypercube layouts. (Q1853103) (← links)
- Two-dimensional packing algorithms for layout of disconnected graphs (Q1857089) (← links)
- Graph multidimensional scaling with self-organizing maps (Q1857090) (← links)
- On generalized greedy splitting algorithms for multiway partition problems (Q1887049) (← links)
- Monge matrices make maximization manageable (Q1890948) (← links)
- Drawing graphs on rectangular grids (Q1902892) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
- Unconstrained multilayer switchbox routing (Q1904736) (← links)
- A variable-depth search algorithm for the recursive bipartitioning of signal flow graphs (Q1909003) (← links)
- Minimum transversals of maximum matchings as approximate solutions to the bisection problem (Q1913329) (← links)
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270) (← links)
- Packing Steiner trees: Polyhedral investigations (Q1919089) (← links)
- Packing Steiner trees: A cutting plane algorithm and computational results (Q1919090) (← links)
- Semidefinite programming relaxations for the graph partitioning problem (Q1961466) (← 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)
- An implicit enumeration scheme for the batch selection problem (Q3156829) (← links)
- Overloaded Orthogonal Drawings (Q3223958) (← 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)
- (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)
- 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)
- INNER RECTANGULAR DRAWINGS OF PLANE GRAPHS (Q5470176) (← 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)