Skip to main content

Research Repository

Advanced Search

All Outputs (211)

Modelling complex phenomena in optical fibres (2012)
Presentation / Conference Contribution
Allington-Smith, J., Murray, G., & Lemke, U. (2012). Modelling complex phenomena in optical fibres. In I. McLean, S. Ramsay, & H. Takami (Eds.), . https://doi.org/10.1117/12.926010

We present a new model for predicting the performance of fibre systems in the multimode limit. This is based on ray-­‐tracing but includes a semi-­‐empirical description of Focal Ratio Degradation (FRD). We show how FRD is simulated by the model. Wit... Read More about Modelling complex phenomena in optical fibres.

Solutions for the stable rommates problem with payments (2012)
Presentation / Conference Contribution
Biró, P., Bomhoff, M., Golovach, P. A., Kern, W., & Paulusma, D. (2012, December). Solutions for the stable rommates problem with payments

The stable roommates problem with payments has as input a graph G = (V,E) with an edge weighting w: E → ℝ +  and the problem is to find a stable solution. A solution is a matching M with a vector p∈R V + that satisfies pu + pv = w(uv) for all uv ∈ M... Read More about Solutions for the stable rommates problem with payments.

Coloring graphs characterized by a forbidden subgraph (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & Ries, B. (2012, December). Coloring graphs characterized by a forbidden subgraph

The Coloring problem is to test whether a given graph can be colored with at most k colors for some given k, such that no two adjacent vertices receive the same color. The complexity of this problem on graphs that do not contain some graph H as an in... Read More about Coloring graphs characterized by a forbidden subgraph.

4-Coloring H-free graphs when H is small (2012)
Presentation / Conference Contribution
Golovach, P., Paulusma, D., & Song, J. (2012, December). 4-Coloring H-free graphs when H is small

The k-Coloring problem is to test whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. If a graph G does not contain a graph H as an induced subgraph, then G is called H-free. For any fixed g... Read More about 4-Coloring H-free graphs when H is small.

How to eliminate a graph (2012)
Presentation / Conference Contribution
Golovach, P., Heggernes, P., van 't Hof, P., Manne, F., Paulusma, D., & Pilipczuk, M. (2012, December). How to eliminate a graph

Vertex elimination is a graph operation that turns the neighborhood of a vertex into a clique and removes the vertex itself. It has widely known applications within sparse matrix computations. We define the Elimination problem as follows: given two g... Read More about How to eliminate a graph.

Characterizing graphs of small carving-width (2012)
Presentation / Conference Contribution
Belmonte, R., van 't Hof, P., Kaminski, M., Paulusma, D., & Thilikos, D. (2012, December). Characterizing graphs of small carving-width

We characterize all graphs that have carving-width at most k for k = 1,2,3. In particular, we show that a graph has carving-width at most 3 if and only if it has maximum degree at most 3 and treewidth at most 2. This enables us to identify the immers... Read More about Characterizing graphs of small carving-width.