#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2000

2017

- This year (2)
- Last 5 years (8)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- M Sugrue, Adrian Bauman, +6 authors Stephen A. Deane
- World Journal of Surgery
- 2002

This study was designed to establish if clinical examination can accurately predict intraabdominal pressure (IAP). Between August 1998 and March 2000 a prospective blinded observational study of postoperative intensive care unit patients was undertaken at a major trauma center. IAP was measured using an intravesicular technique and compared with clinical… (More)

- Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
- Theor. Comput. Sci.
- 2016

A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 from each other. The Square Root problem is that of deciding whether a given graph admits a square root. We consider this problem for planar graphs in the context of the “distance from triviality” framework. For… (More)

- Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
- IWOCA
- 2016

A graph H is a square root of a graph G, or equivalently, G is the square of H, if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. The problem of testing whether a graph admits a square root which belongs to some specified… (More)

- Steven Toikilik, George Tuges, +9 authors Christopher J Clements
- Vaccine
- 2010

OBJECTIVE
To measure immunization coverage among children aged 12-23 months in Papua New Guinea (PNG) and to assess if and why there are differences between hard-to-reach and more accessible communities.
METHODS
WHO cluster sampling methodology was employed to measure immunization coverage in PNG's four regions. Survey data were re-analyzed according to a… (More)

- Petr A. Golovach, Dieter Kratsch, Daniël Paulusma, Anthony Stewart
- Electronic Notes in Discrete Mathematics
- 2016

A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 of each other. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial… (More)

A homomorphism from a graph G to a graph H is a vertex mapping f from the vertex set of G to the vertex set of H such that there is an edge between vertices f(u) and f(v) of H whenever there is an edge between vertices u and v of G. The H-Colouring problem is to decide if a graph G allows a homomorphism to a fixed graph H . We continue a study on a variant… (More)

- Matthew Johnson, Daniël Paulusma, Anthony Stewart
- Discrete Applied Mathematics
- 2014

The problem of finding a disconnected cut in a graph is NP-hard in general but polynomial-time solvable on planar graphs. The problem of finding a minimal disconnected cut is also NP-hard but its computational complexity was not known for planar graphs. We show that it is polynomial-time solvable on 3-connected planar graphs but NP-hard for 2-connected… (More)

- Barbara J Khan, Ajay Kumar, +4 authors Zeeshan Samad
- Public health action
- 2017

Setting: All public-private mix (PPM) facilities caring for tuberculosis (TB) patients in Lahore city, Pakistan, under four models: PPM1 (general practitioners), PPM2 (non-governmental organisations), PPM3 (private hospitals) and PPM4 (others). Objective: To assess the pre-treatment loss to follow-up (LTFU), defined as patients documented in the laboratory… (More)

A graph H is a square root of a graph G if G can be obtained from H by adding an edge between any two vertices in H that are of distance 2. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph… (More)