Skip to main content

Research Repository

Advanced Search

All Outputs (3019)

Polygonal mesh watermarking using Laplacian coordinates (2010)
Journal Article
Yang, Y., & Ivrissimtzis, I. (2010). Polygonal mesh watermarking using Laplacian coordinates. Computer Graphics Forum, 29(5), 1585-1593. https://doi.org/10.1111/j.1467-8659.2010.01767.x

We propose a watermarking algorithm for polygonal meshes based on the modification of the Laplacian coordinates. More specifically, we first compute the Laplacian coordinates (x; y; z) of the mesh vertices, then construct the histogram of the lengths... Read More about Polygonal mesh watermarking using Laplacian coordinates.

Placing regenerators in optical networks to satisfy multiple sets of requests (2010)
Presentation / Conference Contribution
Mertzios, G., Sau, I., Shalom, M., & Zaks, S. (2010, July). Placing regenerators in optical networks to satisfy multiple sets of requests. Presented at 37th International Colloquium on Automata, Languages and Programming (ICALP), Bordeaux, France

The placement of regenerators in optical networks has become an active area of research during the last years. Given a set of lightpaths in a network G and a positive integer d, regenerators must be placed in such a way that in any lightpath there ar... Read More about Placing regenerators in optical networks to satisfy multiple sets of requests.

Window-games between TCP flows (2010)
Journal Article
Efraimidis, P., Tsavlidis, L., & Mertzios, G. (2010). Window-games between TCP flows. Theoretical Computer Science, 411(31-33), 2798-2817. https://doi.org/10.1016/j.tcs.2010.03.031

We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. Analytical and experimental results show the relevance of the Window-game... Read More about Window-games between TCP flows.

Frameworks for logically classifying polynomial-time optimisation problems (2010)
Presentation / Conference Contribution
Gate, J., & Stewart., I. (2010, June). Frameworks for logically classifying polynomial-time optimisation problems. Presented at 5th International Computer Science Symposium in Russia (CSR 2010), Kazan, Russia

We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimisation problems, cannot hope to do so, under the assumption that P ≠ NP... Read More about Frameworks for logically classifying polynomial-time optimisation problems.

Obtaining online ecological colourings by generalizing first-fit (2010)
Presentation / Conference Contribution
Johnson, M., Patel, V., Paulusma, D., & Trunck, T. (2010, December). Obtaining online ecological colourings by generalizing first-fit. Presented at 5th International Computer Science Symposium in Russia (CSR 2010), Kazan, Russia

A colouring of a graph is ecological if every pair of vertices that have the same set of colours in their neighbourhood are coloured alike. We consider the following problem: if a graph G and an ecological colouring c of G are given, can further vert... Read More about Obtaining online ecological colourings by generalizing first-fit.

A class of hierarchical graphs as topologies for interconnection networks (2010)
Journal Article
Lai, P., Hsu, H., Tsai, C., & Stewart, I. (2010). A class of hierarchical graphs as topologies for interconnection networks. Theoretical Computer Science, 411(31-33), 2912-2924. https://doi.org/10.1016/j.tcs.2010.04.022

We study some topological and algorithmic properties of a recently defined hierarchical interconnection network, the hierarchical crossed cube HCC(k,n), which draws upon constructions used within the well-known hypercube and also the crossed cube. In... Read More about A class of hierarchical graphs as topologies for interconnection networks.

A new intersection model and improved algorithms for tolerance graphs (2010)
Presentation / Conference Contribution
Mertzios, G., Sau, I., & Zaks, S. (2010, June). A new intersection model and improved algorithms for tolerance graphs. Presented at 35th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Montpellier, France

Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in conflict. This class of graphs, which generalizes in a natural way both interval and permutation graphs, has attracted ma... Read More about A new intersection model and improved algorithms for tolerance graphs.

Variability in the control of cell division underlies sepal epidermal patterning in Arabidopsis thaliana (2010)
Journal Article
Roeder, A. H., Chickarmane, V., Cunha, A., Obara, B., Manjunath, B., & Meyerowitz, E. M. (2010). Variability in the control of cell division underlies sepal epidermal patterning in Arabidopsis thaliana. PLoS Biology, 8(5), Article e1000367. https://doi.org/10.1371/journal.pbio.1000367

How growth and proliferation are precisely controlled in organs during development and how the regulation of cell division contributes to the formation of complex cell type patterns are important questions in developmental biology. Such a pattern of... Read More about Variability in the control of cell division underlies sepal epidermal patterning in Arabidopsis thaliana.

Path factors and parallel knock-out schemes of almost claw-free graphs (2010)
Journal Article
Johnson, M., Paulusma, D., & Wood, C. (2010). Path factors and parallel knock-out schemes of almost claw-free graphs. Discrete Mathematics, 310(9), 1413-1423. https://doi.org/10.1016/j.disc.2009.04.022

An H1,{H2}-factor of a graph G is a spanning subgraph of G with exactly one component isomorphic to the graph H1 and all other components (if there are any) isomorphic to the graph H2. We completely characterise the class of connected almost claw-fre... Read More about Path factors and parallel knock-out schemes of almost claw-free graphs.

A Network Approach to Study Karyotypic Evolution: The Chromosomal Races of the Common Shrew (Sorex araneus) and House Mouse (Mus musculus) as Model Systems (2010)
Journal Article
White, T. A., Bordewich, M., & Searle, J. B. (2010). A Network Approach to Study Karyotypic Evolution: The Chromosomal Races of the Common Shrew (Sorex araneus) and House Mouse (Mus musculus) as Model Systems. Systematic Biology, 59(3), 262-276. https://doi.org/10.1093/sysbio/syq004

The development of methods to reconstruct phylogenies from karyotypic data has lagged behind what has been achieved with molecular and morphological characters. This hampers our understanding of the role of chromosomal rearrangements in speciation, w... Read More about A Network Approach to Study Karyotypic Evolution: The Chromosomal Races of the Common Shrew (Sorex araneus) and House Mouse (Mus musculus) as Model Systems.

Comparing universal covers in polynomial time (2010)
Journal Article
Fiala, J., & Paulusma., D. (2010). Comparing universal covers in polynomial time. Theory of Computing Systems, 46(4), 620-635. https://doi.org/10.1007/s00224-009-9200-z

The universal cover T G of a connected graph G is the unique (possibly infinite) tree covering G, i.e., that allows a locally bijective homomorphism from T G to G. It is well-known that if a graph G covers a graph H, then their universal covers are i... Read More about Comparing universal covers in polynomial time.

Automatic Salient Object Detection in UAV Imagery (2010)
Presentation / Conference Contribution
Sokalski, J., Breckon, T., & Cowling, I. (2010, April). Automatic Salient Object Detection in UAV Imagery. Presented at Proc. 25th International Conference on Unmanned Air Vehicle Systems

The value of mapping studies – A participant-observer case study (2010)
Presentation / Conference Contribution
Kitchenham, B. A., Budgen, D., & Brereton, O. P. (2010, April). The value of mapping studies – A participant-observer case study. Presented at 14th International Conference on Evaluation and Assessment in Software Engineering, EASE 2010, Keele University, UK

Background: We are strong advocates of evidence-based software engineering (EBSE) in general and systematic literature reviews (SLRs) in particular. We believe it is essential that the SLR methodology is being used constructively to support software... Read More about The value of mapping studies – A participant-observer case study.

A new characterization of P6-free graphs (2010)
Journal Article
Hof, P. V. '., & Paulusma, D. (2010). A new characterization of P6-free graphs. Discrete Applied Mathematics, 158(7), 731-740. https://doi.org/10.1016/j.dam.2008.08.025

We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if and only if each connected induced subgraph of G on more than one vertex... Read More about A new characterization of P6-free graphs.

A general algorithm for detecting faults under the comparison diagnosis model (2010)
Presentation / Conference Contribution
Stewart, I. (2010, April). A general algorithm for detecting faults under the comparison diagnosis model. Presented at 24th IEEE International Parallel and Distributed Processing Symposium (IPDPS 2010), Atlanta, Georgia, U.S.A

We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty processors. In particular, we prove that if the underlying graph G = (V,E... Read More about A general algorithm for detecting faults under the comparison diagnosis model.