Charl J. Ras

According to our database1, Charl J. Ras authored at least 26 papers between 2009 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Fixed parameter tractability of a biconnected bottleneck Steiner network problem.
Networks, 2020

Degree bounded bottleneck spanning trees in three dimensions.
J. Comb. Optim., 2020

Computing skeletons for rectilinearly-convex obstacles in the rectilinear plane.
CoRR, 2020

Overlaid oriented Voronoi diagrams and the 1-Steiner tree problem.
CoRR, 2020

2019
Computing minimum 2-edge-connected Steiner networks in the Euclidean plane.
Networks, 2019

Unsupervised Basis Function Adaptation for Reinforcement Learning.
J. Mach. Learn. Res., 2019

Algorithms for Euclidean Degree Bounded Spanning Tree Problems.
Int. J. Comput. Geom. Appl., 2019

The 2-connected bottleneck Steiner network problem is NP-hard in any 𝓁p plane.
CoRR, 2019

New pruning rules for the Steiner tree problem and 2-connected Steiner network problem.
Comput. Geom., 2019

2018
Algorithms for the power-p Steiner tree problem in the Euclidean plane.
RITA, 2018

2017
Approximate Euclidean Steiner Trees.
J. Optim. Theory Appl., 2017

2016
Minimum bottleneck spanning trees with degree bounds.
Networks, 2016

An exact algorithm for the bottleneck 2-connected k-Steiner network problem in Lp planes.
Discret. Appl. Math., 2016

2015
Survivable minimum bottleneck networks.
Comput. Geom., 2015

Generalised k-Steiner Tree Problems in Normed Planes.
Algorithmica, 2015

2014
A flow-dependent quadratic steiner tree problem in the Euclidean plane.
Networks, 2014

A geometric characterisation of the quadratic min-power centre.
Eur. J. Oper. Res., 2014

2013
The Gilbert arborescence problem.
Networks, 2013

Relay augmentation for lifetime extension of wireless sensor networks.
IET Wireless Sensor Systems, 2013

2012
The bottleneck 2-connected k-Steiner network problem for k≤2.
Discret. Appl. Math., 2012

2011
Exact algorithm for the bottleneck 2-connected $k$-Steiner network problem
CoRR, 2011

The bottleneck 2-connected $k$-Steiner network problem for $k\leq 2$
CoRR, 2011

2010
Approximating minimum Steiner point trees in Minkowski planes.
Networks, 2010

The L(h, 1, 1)-labelling problem for trees.
Eur. J. Comb., 2010

2009
A characterization of lambdad, 1-minimal trees and other attainable classes.
Discret. Math., 2009

A class of full (d, 1)-colorable trees.
Australas. J Comb., 2009


  Loading...