The following pages link to Boris Klemz (Q1627185):
Displayed 16 items.
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- Simplifying non-simple fan-planar drawings (Q2151431) (← links)
- On the edge-vertex ratio of maximal thrackles (Q2206880) (← links)
- Recognizing Weighted Disk Contact Graphs (Q2959776) (← links)
- (Q3132871) (← links)
- Minimum Tree Supports for Hypergraphs and Low-Concurrency Euler Diagrams (Q3188901) (← links)
- Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity (Q4625134) (← links)
- Simplifying Non-Simple Fan-Planar Drawings (Q5886039) (← links)
- Convexity-increasing morphs of planar graphs (Q5915593) (← links)
- Convexity-increasing morphs of planar graphs (Q5919691) (← links)
- The segment number: algorithms and universal lower bounds for some classes of planar graphs (Q6039428) (← links)
- Convex Drawings of Hierarchical Graphs in Linear Time, with Applications to Planar Graph Morphing (Q6075949) (← links)
- (Q6104075) (← links)
- The complexity of finding tangles (Q6114453) (← links)
- Outside-obstacle representations with all vertices on the outer face (Q6172219) (← links)
- On the edge-vertex ratio of maximal thrackles (Q6324092) (← links)