Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Judith Egan"'
Publikováno v:
Home Healthcare Now. 34:485-490
Nurse managers and nursing faculty report, anecdotally, on their difficulty identifying nurses willing to precept new staff or students. To understand more about this topic, we queried home care nurses at a small agency on their perceived incentives
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::94d234a2f91fbc35b13c9a0ef4daf697
https://doi.org/10.1097/nhh.0000000000000454
https://doi.org/10.1097/nhh.0000000000000454
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319961507
ISCO
ISCO
In the Cluster Editing problem, a given graph is to be transformed into a disjoint union of cliques via a minimum number of edge editing operations. In this paper we introduce a new variant of Cluster Editing whereby a vertex can be divided, or split
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a5fc2bedb1ebed39256ec1f1a3a29328
https://doi.org/10.1007/978-3-319-96151-4_1
https://doi.org/10.1007/978-3-319-96151-4_1
Publikováno v:
Theoretical Computer Science. 607:426-434
In a dynamic version of a (base) problem X it is assumed that some solution to an instance of X is no longer feasible due to changes made to the original instance, and it is required that a new feasible solution be obtained from what "remained" from
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::29fdef9a4bcb7799302bbe516a2945e6
https://doi.org/10.1016/j.tcs.2015.06.053
https://doi.org/10.1016/j.tcs.2015.06.053
Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319559100
TAMC
TAMC
Turbo-charging is a recent algorithmic technique that is based on the fixed-parameter tractability of the dynamic versions of some problems as a way to improve heuristics. We demonstrate the effectiveness of this technique and develop the turbo-charg
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac4cddaa0fc8070c166ecd2655899b63
https://doi.org/10.1007/978-3-319-55911-7_5
https://doi.org/10.1007/978-3-319-55911-7_5
Publikováno v:
Tsinghua Science and Technology. 19:329-337
The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them. We introduce a dynamic version of the DOMINATING SET problem and prove that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fa27f6268d35685a56ec786a6687f70
https://doi.org/10.1109/tst.2014.6867515
https://doi.org/10.1109/tst.2014.6867515
Autor:
Ian M. Wanless, Judith Egan
Publikováno v:
Journal of Combinatorial Designs. 20:344-361
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1332b087d1db8047c0a7abb8d4855ea
https://doi.org/10.1002/jcd.21316
https://doi.org/10.1002/jcd.21316
Autor:
Ian M. Wanless, Judith Egan
Publikováno v:
Journal of Combinatorial Designs. 20:124-141
The original article to which this erratum refers was correctly published online on 1 December 2011. Due to an error at the publisher, it was then published in Journal of Combinatorial Designs 20: 124–141, 2012 without the required shading in sever
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7d3ce15f452348a301f58cc09f499fe9
https://doi.org/10.1002/jcd.20297
https://doi.org/10.1002/jcd.20297
Autor:
Judith Egan
Publikováno v:
Journal of Combinatorial Designs. 19:304-312
In a latin square of order n, a k-plex is a selection of kn entries in which each row, column, and symbol occurs k times. A 1-plex is also called a transversal. A k-plex is indivisible if it contains no c-plex for 0
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0162de7100f4b6215e8e2b6ca4bccd66
https://doi.org/10.1002/jcd.20281
https://doi.org/10.1002/jcd.20281
Autor:
Ian M. Wanless, Judith Egan
Publikováno v:
Journal of Statistical Planning and Inference. 141:402-417
In a latin square of order n, a k-plex is a selection of kn entries in which each row, column and symbol occurs k times. A 1-plex is also called a transversal. An indivisible k-plex is one that contains no c-plex for 0 c k . For orders n ∉ { 2 , 6
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a26f25f4446ecfd0e8315d0378cfafc
https://doi.org/10.1016/j.jspi.2010.06.020
https://doi.org/10.1016/j.jspi.2010.06.020
Publikováno v:
Designs, Codes and Cryptography. 52:93-105
A k-plex is a selection of kn entries of a latin square of order n in which each row, column and symbol is represented precisely k times. A transversal of a latin square corresponds to the case k = 1. A k-plex is said to be indivisible if it contains
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::797c581c672efbb40a8fc6013372ddea
https://doi.org/10.1007/s10623-009-9269-z
https://doi.org/10.1007/s10623-009-9269-z