Outputs (75)

Emergent properties in optically bound matter (2008)
Journal Article
Taylor, J., Wong, L., Bain, C., & Love, G. (2008). Emergent properties in optically bound matter. Optics Express, 16(10), 6921-6929. https://doi.org/10.1364/oe.16.006921

Sub-micron particles have been observed to spontaneously form regular two-dimensional structures in counterpropagating evanescent laser fields. We show that collective properties of large numbers of optically-trapped particles can be qualitatively di... Read More about Emergent properties in optically bound matter.

Picking up the Pieces: Self-Healing in reconfigurable networks (2008)
Presentation / Conference Contribution
Saia, J., & Trehan, A. (2008, April). Picking up the Pieces: Self-Healing in reconfigurable networks. Presented at IPDPS. 22nd IEEE International Symposium on Parallel and Distributed Processing

Nature Reserve Selection Problem: A Tight Approximation Algorithm (2008)
Journal Article
Bordewich, M., & Semple, C. (2008). Nature Reserve Selection Problem: A Tight Approximation Algorithm. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(2), 275-280. https://doi.org/10.1109/tcbb.2007.70252

The nature reserve selection problem is a problem that arises in the context of studying biodiversity conservation. Subject to budgetary constraints, the problem is to select a set of regions to be conserved so that the phylogenetic diversity of the... Read More about Nature Reserve Selection Problem: A Tight Approximation Algorithm.

Relative length of longest paths and longest cycles in triangle-free graphs (2008)
Journal Article
Paulusma, D., & Yoshimoto, K. (2008). Relative length of longest paths and longest cycles in triangle-free graphs. Discrete Mathematics, 308(7), 1222-1229. https://doi.org/10.1016/j.disc.2007.03.070

In this paper, we study triangle-free graphs. Let G=(V,E) be an arbitrary triangle-free graph with minimum degree at least two and σ4(G)|V(G)|+2. We first show that either for any path P in G there exists a cycle C such that |VPVC|1, or G is isomorph... Read More about Relative length of longest paths and longest cycles in triangle-free graphs.

A matrix characterization of interval and proper interval graphs (2008)
Journal Article
Mertzios, G. (2008). A matrix characterization of interval and proper interval graphs. Applied Mathematics Letters, 21(4), 332-337. https://doi.org/10.1016/j.aml.2007.04.001

In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of... Read More about A matrix characterization of interval and proper interval graphs.

On the Stability of Dynamic Diffusion Load Balancing. (2008)
Journal Article
Berenbrink, P., Friedetzky, T., & Martin, R. (2008). On the Stability of Dynamic Diffusion Load Balancing. Algorithmica, 50(3), 329-350. https://doi.org/10.1007/s00453-007-9081-y

Complexity of Decoding Gabidulin Codes (2008)
Presentation / Conference Contribution
Gadouleau, M., & Yan, Z. (2008, March). Complexity of Decoding Gabidulin Codes. Presented at CISS, Princeton, NJ

Connectedness of the graph of vertex-colourings (2008)
Journal Article
Cereceda, L., van den Heuvel, J., & Johnson, M. (2008). Connectedness of the graph of vertex-colourings. Discrete Mathematics, 308(5-6), 913-919. https://doi.org/10.1016/j.disc.2007.07.028

For a positive integer k and a graph G, the k-colour graph of G , Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k -colourings are joined by an edge in Ck(G) if they differ in colour on just one vertex of... Read More about Connectedness of the graph of vertex-colourings.

MacWilliams Identity for Codes with the Rank Metric (2008)
Journal Article
Gadouleau, M., & Yan, Z. (2008). MacWilliams Identity for Codes with the Rank Metric. EURASIP Journal on Wireless Communications and Networking, 2008, Article 754021. https://doi.org/10.1155/2008/754021

The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear codes with... Read More about MacWilliams Identity for Codes with the Rank Metric.

The computational complexity of the parallel knock-out problem (2008)
Journal Article
Broersma, H., Johnson, M., Paulusma, D., & Stewart, I. (2008). The computational complexity of the parallel knock-out problem. Theoretical Computer Science, 393(1-3), 182-195. https://doi.org/10.1016/j.tcs.2007.11.021

We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates exactly one of its neighbours. We show that the problem of whether, for... Read More about The computational complexity of the parallel knock-out problem.