The following pages link to Petra Mutzel (Q548666):
Displaying 14 items.
- (Q78729) (redirect page) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- Optimal labeling of point features in rectangular labeling models (Q1411626) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (Q2942616) (← links)
- Compact Layered Drawings of General Directed Graphs (Q2961517) (← links)
- Improved Steiner Tree Algorithms for Bounded Treewidth (Q3111665) (← links)
- On Open Problems in Biological Network Visualization (Q3557884) (← links)
- Approximating the Crossing Number of Apex Graphs (Q3611879) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- SAHN Clustering in Arbitrary Metric Spaces Using Heuristic Nearest Neighbor Search (Q5746249) (← links)
- Bend Minimization in Planar Orthogonal Drawings Using Integer Programming (Q5757344) (← links)
