The following pages link to Petra Mutzel (Q548666):
Displaying 50 items.
- (Q78729) (redirect page) (← links)
- Gunnar W. Klau (Q534774) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← links)
- Vertex insertion approximates the crossing number of apex graphs (Q661940) (← links)
- A branch-and-cut approach to the crossing number problem (Q951113) (← links)
- The thickness of a minor-excluded class of graphs (Q1379835) (← links)
- The thickness of graphs: A survey (Q1385299) (← links)
- Optimal labeling of point features in rectangular labeling models (Q1411626) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs (Q1670994) (← links)
- The crossing number of seq-shellable drawings of complete graphs (Q1671011) (← links)
- On maximum common subgraph problems in series-parallel graphs (Q1678090) (← links)
- Matheuristics for optimizing the network in German wagonload traffic (Q1707082) (← links)
- A flow formulation for horizontal coordinate assignment with prescribed width (Q1725752) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Inserting an edge into a planar graph (Q1774149) (← links)
- (Q1920419) (redirect page) (← links)
- Maximum planar subgraphs and nice embeddings: Practical layout tools (Q1920420) (← links)
- On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm (Q1920431) (← links)
- Improved Steiner tree algorithms for bounded treewidth (Q1932355) (← links)
- Exact ground states of two-dimensional \(\pm J\) Ising spin glasses (Q1946872) (← links)
- Crossing number for graphs with bounded pathwidth (Q1986966) (← links)
- 10 reasons to get interested in graph drawing (Q2075765) (← links)
- A unifying view of explicit and implicit feature maps of graph kernels (Q2218378) (← links)
- Fixed-parameter algorithms for the weighted max-cut problem on embedded 1-planar graphs (Q2220841) (← links)
- New integer linear programming models for the vertex coloring problem (Q2294722) (← links)
- On the enumeration of bicriteria temporal paths (Q2327503) (← links)
- Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm (Q2500052) (← links)
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem (Q2583134) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- An alternative method to crossing minimization on hierarchical graphs (Q2719241) (← links)
- (Q2766818) (← links)
- (Q2766843) (← links)
- Inserting an edge into a planar graph (Q2768302) (← links)
- Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (Q2922637) (← links)
- Practical SAHN Clustering for Very Large Data Sets and Expensive Distance Metrics (Q2938753) (← links)
- Enumeration of Maximum Common Subtree Isomorphisms with Polynomial-Delay (Q2942616) (← links)
- On Maximum Common Subgraph Problems in Series-Parallel Graphs (Q2946055) (← links)
- Compact Layered Drawings of General Directed Graphs (Q2961517) (← links)
- Finding Largest Common Substructures of Molecules in Quadratic Time (Q2971143) (← links)
- Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem (Q2980909) (← links)
- (Q3043769) (← links)
- (Q3043780) (← links)
- Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut (Q3060753) (← links)
- An Experimental Evaluation of Multilevel Layout Methods (Q3073662) (← links)
- Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints (Q3073668) (← links)
- Improved Steiner Tree Algorithms for Bounded Treewidth (Q3111665) (← links)
- Simple and Efficient Bilayer Cross Counting (Q3378492) (← links)
- On the Minimum Cut of Planarizations (Q3439582) (← links)
- Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems (Q3452793) (← links)
