The following pages link to Petra Mutzel (Q548666):
Displaying 50 items.
- A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks (Q3527257) (← links)
- A New Approach to Exact Crossing Minimization (Q3541091) (← links)
- On Open Problems in Biological Network Visualization (Q3557884) (← links)
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints (Q3595460) (← links)
- A New Approximation Algorithm for Bend Minimization in the Kandinsky Model (Q3595481) (← links)
- Computing Maximum C-Planar Subgraphs (Q3611845) (← links)
- Approximating the Crossing Number of Apex Graphs (Q3611879) (← links)
- The Crossing Number of Graphs: Theory and Computation (Q3644730) (← links)
- Planar Biconnectivity Augmentation with Fixed Embedding (Q3651554) (← links)
- (Q4232783) (← links)
- (Q4234163) (← links)
- (Q4249523) (← links)
- (Q4250191) (← links)
- (Q4263720) (← links)
- (Q4263724) (← links)
- 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms (Q4381060) (← links)
- (Q4398382) (← links)
- (Q4422269) (← links)
- (Q4422278) (← links)
- (Q4449162) (← links)
- (Q4450516) (← links)
- (Q4471659) (← links)
- (Q4471661) (← links)
- (Q4472290) (← links)
- (Q4472293) (← links)
- (Q4494408) (← links)
- (Q4501694) (← links)
- (Q4501703) (← links)
- Bishellable drawings of $K_n$ (Q4555043) (← links)
- (Q4608592) (← links)
- A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs (Q4611386) (← links)
- (Q4633846) (← links)
- A Sidetrack-Based Algorithm for Finding the k Shortest Simple Paths in a Directed Graph (Q4636533) (← links)
- (Q4808670) (← links)
- The Rooted Maximum Node-Weight Connected Subgraph Problem (Q4922919) (← links)
- Largest Weight Common Subtree Embeddings with Distance Penalties (Q5005156) (← links)
- (Q5090449) (← links)
- Quantum Annealing versus Digital Computing (Q5102052) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- (Q5136229) (← links)
- Shrinking Trees not Blossoms: A Recursive Maximum Matching Approach (Q5147506) (← links)
- Graph Drawing (Q5193163) (← links)
- Practical Experience with Hanani-Tutte for Testing c-Planarity (Q5232494) (← links)
- A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints (Q5232757) (← links)
- A Flow Formulation for Horizontal Coordinate Assignment with Prescribed Width (Q5233133) (← links)
- Obtaining Optimal<i>k</i>-Cardinality Trees Fast (Q5233508) (← links)
- An SDP Approach to Multi-level Crossing Minimization (Q5233706) (← links)
- The Maximum Weight Connected Subgraph Problem (Q5265172) (← links)
- Recent Advances in Exact Crossing Minimization (Extended Abstract) (Q5300976) (← links)
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints (Q5301429) (← links)
