The following pages link to Charl J. Ras (Q976151):
Displaying 31 items.
- (Q297176) (redirect page) (← links)
- A geometric characterisation of the quadratic min-power centre (Q297177) (← links)
- The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\) (Q423908) (← links)
- (Q779858) (redirect page) (← links)
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane (Q779860) (← links)
- Survivable minimum bottleneck networks (Q904084) (← links)
- Distance labellings of Cayley graphs of semigroups (Q906971) (← links)
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes (Q908293) (← links)
- The \(L(h,1,1)\)-labelling problem for trees (Q976152) (← links)
- A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes (Q1025490) (← links)
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem (Q1631775) (← links)
- An exact algorithm for constructing minimum Euclidean skeletons of polygons (Q2131144) (← links)
- Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434) (← links)
- Generalised \(k\)-Steiner tree problems in normed planes (Q2258073) (← links)
- Degree bounded bottleneck spanning trees in three dimensions (Q2292155) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- (Q3059011) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
- Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane (Q4628046) (← links)
- Minimum bottleneck spanning trees with degree bounds (Q4642403) (← links)
- A flow‐dependent quadratic steiner tree problem in the Euclidean plane (Q4642476) (← links)
- Algorithms for Euclidean Degree Bounded Spanning Tree Problems (Q5197492) (← links)
- (Q5214220) (← links)
- The Gilbert arborescence problem (Q5326792) (← links)
- (Q5488332) (← links)
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem (Q6066052) (← links)
- Simplifying obstacles for Steiner network problems in the plane (Q6087564) (← links)
- Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane (Q6167087) (← links)
- Network augmentation for disaster‐resilience against geographically correlated failure (Q6179691) (← links)
- Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth Reformulation (Q6530747) (← links)
- An exact algorithm for the Euclidean \(k\)-Steiner tree problem (Q6577436) (← links)
