adjacency trees

Stell, John and Worboys, Michael (2011) Relations between adjacency trees. Theoretical Computer Science, 412 (34). pp. 4452-4468. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2011.04.029)

bigraph

Worboys, M.F. (2013) Using bigraphs to model topological graphs embedded in orientable surfaces. Theoretical Computer Science, 484. pp. 56-69. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2013.02.018)

combinatorial map

Worboys, M.F. (2013) Using bigraphs to model topological graphs embedded in orientable surfaces. Theoretical Computer Science, 484. pp. 56-69. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2013.02.018)

dynamic programming

Kelleler, Hans and Strusevich, Vitaly a. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369. pp. 230-238. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2006.08.030)

FPTAS

Kelleler, Hans and Strusevich, Vitaly a. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369. pp. 230-238. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2006.08.030)

graph embedding

Worboys, M.F. (2013) Using bigraphs to model topological graphs embedded in orientable surfaces. Theoretical Computer Science, 484. pp. 56-69. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2013.02.018)

qualitative spatial change

Stell, John and Worboys, Michael (2011) Relations between adjacency trees. Theoretical Computer Science, 412 (34). pp. 4452-4468. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2011.04.029)

relations

Stell, John and Worboys, Michael (2011) Relations between adjacency trees. Theoretical Computer Science, 412 (34). pp. 4452-4468. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2011.04.029)

single machine scheduling

Kelleler, Hans and Strusevich, Vitaly a. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369. pp. 230-238. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2006.08.030)

spatial modeling

Worboys, M.F. (2013) Using bigraphs to model topological graphs embedded in orientable surfaces. Theoretical Computer Science, 484. pp. 56-69. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2013.02.018)

spatial reasoning

Stell, John and Worboys, Michael (2011) Relations between adjacency trees. Theoretical Computer Science, 412 (34). pp. 4452-4468. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2011.04.029)

weighted total tardiness

Kelleler, Hans and Strusevich, Vitaly a. (2006) A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date. Theoretical Computer Science, 369. pp. 230-238. ISSN 0304-3975 (doi:https://doi.org/10.1016/j.tcs.2006.08.030)