default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCharl J. Ras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j28]Marcus Brazil, Michael Hendriksen, Jae Lee, Michael S. Payne, Charl J. Ras
, Doreen A. Thomas:
An exact algorithm for the Euclidean k-Steiner tree problem. Comput. Geom. 121: 102099 (2024)- 2023
- [j27]Alexander Westcott, Marcus Brazil, Charl J. Ras:
Structural Properties of Minimum Multi-source Multi-Sink Steiner Networks in the Euclidean Plane. J. Optim. Theory Appl. 197(3): 1104-1139 (2023) - [j26]Nicolau Andrés-Thió, Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Network augmentation for disaster-resilience against geographically correlated failure. Networks 81(4): 419-444 (2023) - 2022
- [j25]Nicolau Andrés-Thió, Marcus Brazil, Charl J. Ras, Doreen A. Thomas, Marcus Volz:
An exact algorithm for constructing minimum Euclidean skeletons of polygons. J. Glob. Optim. 83(1): 137-162 (2022) - [j24]Marcus Volz, Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Simplifying obstacles for Steiner network problems in the plane. Networks 80(1): 77-92 (2022) - 2021
- [j23]Charl J. Ras, Marcus Brazil, Doreen A. Thomas:
Computational complexity of the 2-connected Steiner network problem in the ℓp plane. Theor. Comput. Sci. 850: 168-184 (2021) - 2020
- [j22]Patrick J. Andersen, Charl J. Ras:
Degree bounded bottleneck spanning trees in three dimensions. J. Comb. Optim. 39(2): 457-491 (2020) - [j21]Marcus Volz, Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Computing Skeletons for Rectilinearly Convex Obstacles in the Rectilinear Plane. J. Optim. Theory Appl. 186(1): 102-133 (2020) - [j20]Charl J. Ras:
Fixed parameter tractability of a biconnected bottleneck Steiner network problem. Networks 75(3): 310-320 (2020) - 2019
- [j19]Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas:
New pruning rules for the Steiner tree problem and 2-connected Steiner network problem. Comput. Geom. 78: 37-49 (2019) - [j18]Patrick J. Andersen, Charl J. Ras:
Algorithms for Euclidean Degree Bounded Spanning Tree Problems. Int. J. Comput. Geom. Appl. 29(2): 121-160 (2019) - [j17]Edward Barker, Charl J. Ras:
Unsupervised Basis Function Adaptation for Reinforcement Learning. J. Mach. Learn. Res. 20: 128:1-128:73 (2019) - [j16]Marcus Brazil, Marcus Volz, Martin Zachariasen, Charl J. Ras, Doreen A. Thomas:
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane. Networks 73(1): 89-103 (2019) - 2018
- [j15]Christina N. Burt, Alysson M. Costa, Charl J. Ras:
Algorithms for the power-p Steiner tree problem in the Euclidean plane. RITA 25(4): 28-42 (2018) - 2017
- [j14]Charl J. Ras, Konrad J. Swanepoel, Doreen Anne Thomas:
Approximate Euclidean Steiner Trees. J. Optim. Theory Appl. 172(3): 845-873 (2017) - 2016
- [j13]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
An exact algorithm for the bottleneck 2-connected k-Steiner network problem in Lp planes. Discret. Appl. Math. 201: 47-69 (2016) - [j12]Patrick J. Andersen, Charl J. Ras:
Minimum bottleneck spanning trees with degree bounds. Networks 68(4): 302-314 (2016) - 2015
- [j11]Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
Generalised k-Steiner Tree Problems in Normed Planes. Algorithmica 71(1): 66-86 (2015) - [j10]Charl J. Ras:
Survivable minimum bottleneck networks. Comput. Geom. 50: 17-23 (2015) - 2014
- [j9]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
A geometric characterisation of the quadratic min-power centre. Eur. J. Oper. Res. 233(1): 34-42 (2014) - [j8]Marcus N. Brazil, Charl J. Ras, Doreen A. Thomas:
A flow-dependent quadratic steiner tree problem in the Euclidean plane. Networks 64(1): 18-28 (2014) - 2013
- [j7]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Relay augmentation for lifetime extension of wireless sensor networks. IET Wirel. Sens. Syst. 3(2) (2013) - [j6]M. G. Volz, Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
The Gilbert arborescence problem. Networks 61(3): 238-247 (2013) - 2012
- [j5]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
The bottleneck 2-connected k-Steiner network problem for k≤2. Discret. Appl. Math. 160(7-8): 1028-1038 (2012) - 2010
- [j4]Deborah King, Charl J. Ras, Sanming Zhou:
The L(h, 1, 1)-labelling problem for trees. Eur. J. Comb. 31(5): 1295-1306 (2010) - [j3]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Approximating minimum Steiner point trees in Minkowski planes. Networks 56(4): 244-254 (2010) - 2009
- [j2]Johannes H. Hattingh, Elizabeth Jonck, Charl J. Ras:
A class of full (d, 1)-colorable trees. Australas. J Comb. 45: 277-290 (2009) - [j1]Elizabeth Jonck, Johannes H. Hattingh, Charl J. Ras:
A characterization of lambdad, 1-minimal trees and other attainable classes. Discret. Math. 309(8): 2340-2348 (2009)
Informal and Other Publications
- 2020
- [i13]Michael S. Payne, Charl J. Ras, Marcus Volz:
Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem. CoRR abs/2002.06752 (2020) - [i12]Marcus Volz, Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Computing skeletons for rectilinearly-convex obstacles in the rectilinear plane. CoRR abs/2004.04365 (2020) - 2019
- [i11]Marcus Brazil, Charl J. Ras, Doreen A. Thomas, G. Xu:
The 2-connected bottleneck Steiner network problem is NP-hard in any 𝓁p plane. CoRR abs/1907.03474 (2019) - 2018
- [i10]Patrick J. Andersen, Charl J. Ras:
Algorithms for Euclidean Degree Bounded Spanning Tree Problems. CoRR abs/1809.09348 (2018) - [i9]Patrick J. Andersen, Charl J. Ras:
Degree Bounded Bottleneck Spanning Trees in Three Dimensions. CoRR abs/1812.11177 (2018) - 2017
- [i8]Edward W. Barker, Charl J. Ras:
Unsupervised Basis Function Adaptation for Reinforcement Learning. CoRR abs/1703.01026 (2017) - [i7]Edward W. Barker, Charl J. Ras:
Unsupervised Basis Function Adaptation for Reinforcement Learning. CoRR abs/1703.07940 (2017) - 2013
- [i6]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Relay Augmentation for Lifetime Extension of Wireless Sensor Networks. CoRR abs/1301.4728 (2013) - [i5]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Approximating Minimum Steiner Point Trees in Minkowski Planes. CoRR abs/1307.2987 (2013) - 2011
- [i4]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
The bottleneck 2-connected $k$-Steiner network problem for $k\leq 2$. CoRR abs/1108.3655 (2011) - [i3]Marcus Brazil, Charl J. Ras, Konrad J. Swanepoel, Doreen A. Thomas:
Generalised k-Steiner Tree Problems in Normed Planes. CoRR abs/1111.1464 (2011) - [i2]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Exact algorithm for the bottleneck 2-connected $k$-Steiner network problem. CoRR abs/1111.2105 (2011) - [i1]Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
A Flow-dependent Quadratic Steiner Tree Problem in the Euclidean Plane. CoRR abs/1111.2109 (2011)
Coauthor Index
aka: Marcus N. Brazil
aka: Doreen Anne Thomas
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-13 01:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
