The following pages link to Johannes Zink (Q1725746):
Displaying 13 items.
- Faster force-directed graph drawing with the well-separated pair decomposition (Q1736822) (← links)
- Layered drawing of undirected graphs with generalized port constraints (Q2144464) (← links)
- Upward planar drawings with three and more slopes (Q2151439) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- Computing height-optimal tangles faster (Q2206851) (← links)
- Consistent simplification of polyline tree bundles (Q2695291) (← links)
- Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition (Q2959742) (← links)
- Layered Drawing of Undirected Graphs with Generalized Port Constraints (Q5014119) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
- Upward Planar Drawings with Three and More Slopes (Q5886036) (← links)
- Compact drawings of 1-planar graphs with right-angle crossings and few bends (Q5915941) (← links)
- Simplification of Polyline Bundles (Q6059203) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
