The following pages link to Tilo Wiedera (Q2110634):
Displaying 16 items.
- Star-struck by fixed embeddings: modern crossing number heuristics (Q2151428) (← links)
- An experimental study of ILP formulations for the longest induced path problem (Q2225052) (← links)
- Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) (Q2678451) (← links)
- Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem (Q2819516) (← links)
- A Note on the Practicality of Maximal Planar Subgraph Algorithms (Q2961528) (← links)
- An ILP-based Proof System for the Crossing Number Problem (Q4606298) (← links)
- (Q5009576) (← links)
- Stronger ILPs for the Graph Genus Problem. (Q5075767) (← links)
- Properties of Large 2-Crossing-Critical Graphs (Q5084710) (← links)
- (Q5088941) (← links)
- (Q5140734) (← links)
- Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics (Q5886037) (← links)
- Inserting one edge into a simple drawing is hard (Q5918599) (← links)
- Approximating multistage matching problems (Q5918627) (← links)
- Approximating multistage matching problems (Q5918760) (← links)
- Inserting one edge into a simple drawing is hard (Q5925627) (← links)
