https://nova.newcastle.edu.au/vital/access/manager/Index ${session.getAttribute("locale")} 5 Labelings of plane graphs containing Hamilton Path https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:12213 Wed 28 Mar 2018 14:34:22 AEDT ]]> Comparative study of data mining techniques for predicting explosions in coal mines https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:47199 Wed 14 Dec 2022 16:10:00 AEDT ]]> Multi-guarded safe zone: an effective technique to monitor moving circular range queries https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:10058 Wed 11 Apr 2018 16:49:02 AEST ]]> Special collection: privacy (editorial) https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:4683 Wed 11 Apr 2018 16:38:25 AEST ]]> Approximability of a {0,1} - matrix problem https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:2987 Wed 11 Apr 2018 16:18:25 AEST ]]> Special collection: security (editorial) https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:4682 Wed 11 Apr 2018 15:33:12 AEST ]]> Building information modelling project decision support framework https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:5979 Wed 11 Apr 2018 15:03:04 AEST ]]> VICUS - A noise addition technique for categorical data https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:17571 Wed 11 Apr 2018 13:17:45 AEST ]]> Building information modelling: what is in there for the architects? https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:4280 Wed 11 Apr 2018 12:47:33 AEST ]]> Statistical disclosure control: to trust or not to trust https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:6117 Wed 11 Apr 2018 12:29:34 AEST ]]> Hard theorems made easier: visualisation and interactivity https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:17183 Wed 11 Apr 2018 12:15:58 AEST ]]> Adopting building information modeling (BIM) as collaboration platform in the design industry https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:6163 Wed 11 Apr 2018 11:56:49 AEST ]]> A survey of face-antimagic evaluations of graphs https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:30604 Wed 11 Apr 2018 10:30:31 AEST ]]> The many facets of upper domination https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:36150 Tue 18 Feb 2020 10:30:14 AEDT ]]> Domination chain: Characterisation, classical complexity, parameterised complexity and approximability https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:45878 Tue 06 Dec 2022 08:43:22 AEDT ]]> Teaching mathematical reasoning: from textbooks to software https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:31790 Sat 24 Mar 2018 08:42:50 AEDT ]]> Premature partial Latin squares https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:1521 Sat 24 Mar 2018 08:30:52 AEDT ]]> On range query usability of statistical databases https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:1518 Sat 24 Mar 2018 08:30:47 AEDT ]]> Labellings of trees with maximum degree three---an improved bound https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:924 Sat 24 Mar 2018 08:29:42 AEDT ]]> Privacy preserving data mining: a noise addition framework using a novel clustering technique https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:12421 Sat 24 Mar 2018 08:17:47 AEDT ]]> Combining two worlds: parameterised approximation for vertex cover https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:12013 k). Additionally, we present an improved polynomial-time approximation algorithm for graphs of average degree four.]]> Sat 24 Mar 2018 08:11:34 AEDT ]]> Privacy-preserving data mining https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:9846 Sat 24 Mar 2018 08:10:36 AEDT ]]> A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:10045 Sat 24 Mar 2018 08:10:14 AEDT ]]> Statistical database security https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:9798 Sat 24 Mar 2018 08:10:03 AEDT ]]> BIM adoption: expectations across disciplines https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:11408 Sat 24 Mar 2018 08:09:56 AEDT ]]> Towards the development of a project decision support framework for adoption of an integrated Building Information Model using a model server https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:11406 Sat 24 Mar 2018 08:09:56 AEDT ]]> Edge-antimagicness for a class of disconnected graphs https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:10506 Sat 24 Mar 2018 08:08:28 AEDT ]]> Breaking the 2ⁿ-barrier for irredundance: two lines of attack https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:12245 Sat 24 Mar 2018 08:08:09 AEDT ]]> An energy-efficient symmetric cryptography based authentication scheme for wireless sensor networks https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:11721 Sat 24 Mar 2018 08:07:23 AEDT ]]> On the linearity of cryptographic sequence generators https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:10109 Sat 24 Mar 2018 08:07:15 AEDT ]]> Reflection and guided problem-based learning in software engineering https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:21415 Sat 24 Mar 2018 08:05:03 AEDT ]]> On d-antimagic labelings of plane graphs https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:18754 Sat 24 Mar 2018 08:02:48 AEDT ]]> Industry consultation report https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:16455 Sat 24 Mar 2018 08:02:16 AEDT ]]> Graceful labelling: state of the art, applications and future directions https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:17749 Sat 24 Mar 2018 07:57:20 AEDT ]]> A novel parameterised approximation algorithm for minimum vertex cover https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:16260 Sat 24 Mar 2018 07:54:17 AEDT ]]> Parameterized approximation algorithms for HITTING SET https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:16311 Sat 24 Mar 2018 07:53:20 AEDT ]]> Triangle randomization for social network data anonymization https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:18822 Sat 24 Mar 2018 07:51:08 AEDT ]]> Labelings of plane graphs with determined face weights https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:6827 Sat 24 Mar 2018 07:45:42 AEDT ]]> Industry perception of BIM adoption in design sector https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:6136 Sat 24 Mar 2018 07:44:34 AEDT ]]> BIM: expectations and a reality check https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:6139 Sat 24 Mar 2018 07:44:33 AEDT ]]> Quantifying privacy: a novel entropy-based measure of disclosure risk https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:28438 Sat 24 Mar 2018 07:29:04 AEDT ]]> Ethical and privacy issues in genetic databases https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:3987 Sat 24 Mar 2018 07:21:26 AEDT ]]> Perspectives of Australian adults about protecting the privacy of their health information in statistical databases https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:23576 Sat 24 Mar 2018 07:12:46 AEDT ]]> On the complexity landscape of the domination chain https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:24690 log log n), no such result is known for Upper Irredundance. Their complementary versions are constantfactor approximable in polynomial time. All these four versions are APXhard even on cubic graphs.]]> Sat 24 Mar 2018 07:10:53 AEDT ]]> Upper domination: complexity and approximation https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:24680 0, making it significantly harder than Dominating Set, while it remains hard even on severely restricted special cases, such as cubic graphs (APX-hard), and planar subcubic graphs (NP-hard). We complement our negative results by showing that the problem admits an O(Δ) approximation on graphs of maximum degree Δ, as well as an EPTAS on planar graphs. Along the way, we also derive essentially tight n1−1d upper and lower bounds on the approximability of the related problem Maximum Minimal Hitting Set on d-uniform hypergraphs, generalising known results for Maximum Minimal Vertex Cover.]]> Sat 24 Mar 2018 07:10:51 AEDT ]]> Algorithmic aspects of upper domination: a parameterised perspective https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:25053 Sat 24 Mar 2018 07:10:44 AEDT ]]> Smart meter data analysis https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:25055 O(log(m)).]]> Sat 24 Mar 2018 07:10:44 AEDT ]]> Linear-time superbubble identification algorithm for genome assembly https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:24351 superbubble. In this paper, we propose an O(n+m)-time algorithm to detect all superbubbles in a directed acyclic graph with n vertices and m (directed) edges, improving the best-known O(mlog⁡m)-time algorithm by Sung et al.]]> Sat 24 Mar 2018 07:10:16 AEDT ]]> Predicting Deflagration and Detonation in Detonation Tube https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:52839 Mon 30 Oct 2023 09:41:40 AEDT ]]> Teaching advanced computing technologies to managers, engineers and other professionals https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:32240 Mon 23 Sep 2019 13:50:39 AEST ]]> Continuous monitoring of distance-based range queries https://nova.newcastle.edu.au/vital/access/manager/Repository/uon:13810 Mon 20 Nov 2023 15:54:43 AEDT ]]>