https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 Polynomial-time data reduction for dominating set https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:2818 Wed 11 Apr 2018 11:50:38 AEST ]]> Clique-width is NP-complete https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:6974 Sat 24 Mar 2018 10:46:35 AEDT ]]> On problems without polynomial kernels https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7412 Sat 24 Mar 2018 08:42:44 AEDT ]]> Derivation of algorithms for cutwidth and related graph layout parameters https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7231 Sat 24 Mar 2018 08:40:26 AEDT ]]> Clustering with partial information https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9422 2.]]> Sat 24 Mar 2018 08:39:18 AEDT ]]> Parameterized complexity of stabbing rectangles and squares in the plane https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8863 Sat 24 Mar 2018 08:39:03 AEDT ]]> Well-quasi-orders in subclasses of bounded treewidth graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8865 Sat 24 Mar 2018 08:39:03 AEDT ]]> Distortion is fixed parameter tractable https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8861 Sat 24 Mar 2018 08:39:02 AEDT ]]> Graph-based data clustering with overlaps https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8860 Sat 24 Mar 2018 08:39:02 AEDT ]]> What makes equitable connected partition easy https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8862 Sat 24 Mar 2018 08:39:02 AEDT ]]> A complexity dichotomy for finding disjoint solutions of vertex deletion problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8859 Sat 24 Mar 2018 08:39:01 AEDT ]]> Haplotype inference constrained by plausible haplotype data https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:8866 Sat 24 Mar 2018 08:39:01 AEDT ]]> On the parameterized complexity of multiple-interval graph problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7815 Sat 24 Mar 2018 08:37:37 AEDT ]]> Fixed-parameter algorithms for Kemeny rankings https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:7655 Sat 24 Mar 2018 08:35:58 AEDT ]]> The parameterized complexity of some minimum label problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9700 Sat 24 Mar 2018 08:34:38 AEDT ]]> Clique width minimization is NP-hard https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:2778 Sat 24 Mar 2018 08:32:55 AEDT ]]> FPT is P-Time extremal structure I https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:2779 Sat 24 Mar 2018 08:32:55 AEDT ]]> Cutting up is hard to do: the parameterized complexity of k-Cut and related probelms https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:946 Sat 24 Mar 2018 08:29:53 AEDT ]]> On finding short resolution refutations and small unsatisfiable subsets https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:9924 Sat 24 Mar 2018 08:14:19 AEDT ]]> Quadratic kernelization for convex recoloring of trees https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12243 k n 4). The Moran and Snir result did not provide any nontrivial kernelization. In this paper, we show that CR has a kernel of size O(k²).]]> Sat 24 Mar 2018 08:08:12 AEDT ]]> Upper and lower bounds for finding connected motifs in vertex-colored graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:16090 Sat 24 Mar 2018 07:53:11 AEDT ]]> Clustering with partial information https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5965 2.]]> Sat 24 Mar 2018 07:47:27 AEDT ]]> On problems without polynomial kernels https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5974 Sat 24 Mar 2018 07:47:24 AEDT ]]> Parameterized algorithms and hardness results for some graph Motif problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5973 Sat 24 Mar 2018 07:47:24 AEDT ]]> On the parameterized complexity of layered graph drawing https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5471 Sat 24 Mar 2018 07:47:04 AEDT ]]> Computing Kemeny rankings, parameterized by the average K-T distance https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5956 Sat 24 Mar 2018 07:46:24 AEDT ]]> Fixed-parameter algorithms for Kemeny Scores https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5955 Sat 24 Mar 2018 07:46:24 AEDT ]]> Leaf powers and their properties: using the trees https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:6126 Sat 24 Mar 2018 07:44:30 AEDT ]]> Graph layout problems parameterized by vertex cover https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:6092 Sat 24 Mar 2018 07:44:27 AEDT ]]> Parameterized approximation of dominating set problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:5217 Sat 24 Mar 2018 07:44:20 AEDT ]]> A refined search tree technique for Dominating Set on planar graphs https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:86 Sat 24 Mar 2018 07:42:15 AEDT ]]> The Computer Journal special issue on parameterized complexity: foreword by the guest editors (editorial) https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:4731 Sat 24 Mar 2018 07:21:10 AEDT ]]>