Charl J. Ras

From MaRDI portal
Revision as of 20:48, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Charl J. Ras to Charl J. Ras: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:976151

Available identifiers

zbMath Open ras.charl-jMaRDI QIDQ976151

List of research outcomes





PublicationDate of PublicationType
An exact algorithm for the Euclidean \(k\)-Steiner tree problem2024-07-23Paper
Network augmentation for disaster‐resilience against geographically correlated failure2023-12-18Paper
Simplifying obstacles for Steiner network problems in the plane2023-12-12Paper
Fixed parameter tractability of a biconnected bottleneck Steiner network problem2023-11-15Paper
Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane2023-07-07Paper
An exact algorithm for constructing minimum Euclidean skeletons of polygons2022-04-25Paper
Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane2020-12-16Paper
Computing skeletons for rectilinearly convex obstacles in the rectilinear plane2020-07-14Paper
https://portal.mardi4nfdi.de/entity/Q52142202020-02-07Paper
Degree bounded bottleneck spanning trees in three dimensions2020-02-03Paper
Algorithms for Euclidean Degree Bounded Spanning Tree Problems2019-09-24Paper
The $2$-connected bottleneck Steiner network problem is NP-hard in any $\ell_p$ plane2019-07-08Paper
Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane2019-03-06Paper
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem2018-12-07Paper
Minimum bottleneck spanning trees with degree bounds2018-05-23Paper
A flow‐dependent quadratic steiner tree problem in the Euclidean plane2018-05-23Paper
Approximate Euclidean Steiner trees2017-05-22Paper
A geometric characterisation of the quadratic min-power centre2016-06-24Paper
An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes2016-02-04Paper
Distance labellings of Cayley graphs of semigroups2016-02-01Paper
Survivable minimum bottleneck networks2016-01-15Paper
An algorithm for finding Hamiltonian Cycles in Cubic Planar Graphs2015-12-04Paper
Generalised \(k\)-Steiner tree problems in normed planes2015-03-02Paper
The Gilbert arborescence problem2013-08-06Paper
The bottleneck 2-connected \(k\)-Steiner network problem for \(k \leq 2\)2012-05-30Paper
Approximating minimum Steiner point trees in Minkowski planes2010-12-20Paper
https://portal.mardi4nfdi.de/entity/Q30590112010-12-08Paper
The \(L(h,1,1)\)-labelling problem for trees2010-06-17Paper
A characterization of \(\lambda _{d,1}\)-minimal trees and other attainable classes2009-06-19Paper
https://portal.mardi4nfdi.de/entity/Q54883322006-09-14Paper
Identification of Active Subfunctions in Finite-Max Minimisation via a Smooth ReformulationN/APaper

Research outcomes over time

This page was built for person: Charl J. Ras