Skip to main content

Research Repository

Advanced Search

All Outputs (2803)

Advances in tensiometer-based suction control systems (2011)
Presentation / Conference Contribution
Lourenço, S. D. N., Gallipoli, D., Toll, D. G., Augarde, C. E., & Evans, F. D. (2011, September). Advances in tensiometer-based suction control systems. Presented at 5th International Conference on Unsaturated Soils, Barcelona, Spain

Cunningham (2000) and Jotisankasa (2005) pioneered the development of tensiometer-based suction control systems. In these systems, wetting and drying of the soil are achieved by water injection and circulation of air in contact with the specimen whil... Read More about Advances in tensiometer-based suction control systems.

Time resolved measurements in the Durham Cascade (2011)
Presentation / Conference Contribution
Forster, F., Sims-Williams, D., Ingram, G., & Dominy, R. (2023, June). Time resolved measurements in the Durham Cascade. Presented at ASME Turbo Expo 2011, Vancouver, Canada

This paper describes investigations into unsteady flow phenomena in a high turning linear cascade with a nominal steady flow. Traditionally time averaged instrumentation is used in such a cascade. Detailed intermittency readings were taken inside the... Read More about Time resolved measurements in the Durham Cascade.

Pressure buildup due to CO2 injection in brine aquifers (2011)
Presentation / Conference Contribution
Gonzalez, G., & Mathias, S. (2011, February). Pressure buildup due to CO2 injection in brine aquifers. Presented at Novel multi-scale methods for porous media flow II, International Centre for Mathematical Sciences (ICMS), 15 South College Street Edinburgh

Finding contractions and induced minors in chordal graphs via disjoint paths (2011)
Presentation / Conference Contribution
Belmonte, R., Golovach, P. A., Heggernes, P., Hof van 't, P., Kaminski, M., & Paulusma, D. (2011, December). Finding contractions and induced minors in chordal graphs via disjoint paths. Presented at 22nd International Symposium on Algorithms and Computation, ISAAC 2011, Yokohama, Japan

The k-Disjoint Paths problem, which takes as input a graph G and k pairs of specified vertices (s i ,t i ), asks whether G contains k mutually vertex-disjoint paths P i such that P i connects s i and t i , for i = 1,…,k. We study a natural variant of... Read More about Finding contractions and induced minors in chordal graphs via disjoint paths.

Coloring graphs without short cycles and long induced paths (2011)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & Song, J. (2011, December). Coloring graphs without short cycles and long induced paths. Presented at Fundamentals of Computation Theory, 18th International Symposium, FCT 2011, Oslo, Norway

The girth of a graph G is the length of a shortest cycle in G. For any fixed girth g ≥ 4 we determine a lower bound ℓ(g) such that every graph with girth at least g and with no induced path on ℓ(g) vertices is 3-colorable. In contrast, we show the ex... Read More about Coloring graphs without short cycles and long induced paths.

Computing vertex-surjective homomorphisms to partially reflexive trees (2011)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & Song, J. (2011, December). Computing vertex-surjective homomorphisms to partially reflexive trees. Presented at 6th International Computer Science Symposium in Russia, CSR 2011., St Petersburg, Russia

The Recognition of Triangle Graphs (2011)
Presentation / Conference Contribution
Mertzios, G. (2011, December). The Recognition of Triangle Graphs. Presented at 28th International Symposium on Theoretical Aspects of Computer Science (STACS), Dortmund, Germany

Trapezoid graphs are the intersection graphs of trapezoids, where every trapezoid has a pair of opposite sides lying on two parallel lines L_{1} and L_{2} of the plane. Strictly between permutation and trapezoid graphs lie the simple-triangle graphs... Read More about The Recognition of Triangle Graphs.

Simulating haemorrhage in mdical students using a lower body negative pressure chamber : measuring the consequences for tissue oxygenation (2011)
Presentation / Conference Contribution
Sawdon, M., Finn, G., Griksaitis, M., & Kirkman, E. (2011, June). Simulating haemorrhage in mdical students using a lower body negative pressure chamber : measuring the consequences for tissue oxygenation. Presented at Association for Simulated Practice in Healthcare (SESAM) 2011, Society in Europe for Applied Simulation Conference., Granada, Spain

Step-drawdown tests and the Forchheimer equation (2011)
Presentation / Conference Contribution
Mathias, S. (2011, February). Step-drawdown tests and the Forchheimer equation. Presented at Novel multi-scale methods for porous media flow II, International Centre for Mathematical Sciences (ICMS), 15 South College Street Edinburgh

List coloring in the absence of a linear forest (2011)
Presentation / Conference Contribution
Couturier, J. F., Golovach, P. A., Kratsch, D., & Paulusma, D. (2011, December). List coloring in the absence of a linear forest. Presented at 37th International Workshop on Graph Theoretic Concepts in Computer Science, WG 2011, Tepla Monastery, Czech Republic

The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The List k -Coloring problem requires in addition that every vertex u must receive a color from some g... Read More about List coloring in the absence of a linear forest.

The computational complexity of Disconnected Cut and 2K2-Partition (2011)
Presentation / Conference Contribution
Martin, B., & Paulusma, D. (2011, December). The computational complexity of Disconnected Cut and 2K2-Partition. Presented at Principles and Practice of Constraint Programming, 17th International Conference, CP 2011, Perugia, Italy

For a connected graph G = (V,E), a subset U ⊆ V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the problem to test whether a graph has a disconnected cut is NP-complete. Thi... Read More about The computational complexity of Disconnected Cut and 2K2-Partition.

Contracting a chordal graph to a split graph or a tree (2011)
Presentation / Conference Contribution
Golovach, P. A., Kaminski, M., & Paulusma, D. (2011, December). Contracting a chordal graph to a split graph or a tree. Presented at 36th International Symposium on Mathematical Foundations of Computer Science 2011, MFCS 2011, Warsaw, Poland

The problems Contractibility and Induced Minor are to test whether a graph G contains a graph H as a contraction or as an induced minor, respectively. We show that these two problems can be solved in |VG|f(|VH|)VGf(VH) time if G is a chordal input gr... Read More about Contracting a chordal graph to a split graph or a tree.

An intersection model for multitolerance graphs: Efficient algorithms and hierarchy (2011)
Presentation / Conference Contribution
Mertzios, G. (2011, January). An intersection model for multitolerance graphs: Efficient algorithms and hierarchy. Presented at ACM-SIAM Symposium on Discrete Algorithms (SODA), San Francisco, California USA

Tolerance graphs model interval relations in such a way that intervals can tolerate a certain degree of overlap without being in con ict. This class of graphs has attracted many research eorts, mainly due to its interesting structure and its numerous... Read More about An intersection model for multitolerance graphs: Efficient algorithms and hierarchy.

Randomized Diffusion for Indivisible Loads (2011)
Presentation / Conference Contribution
Berenbrink, P., Cooper, C., Friedetzky, T., Friedrich, T., & Sauerwald, T. (2011, January). Randomized Diffusion for Indivisible Loads. Presented at Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms., San Francisco

We present a new randomized diffusion-based algorithm for balancing indivisible tasks (tokens) on a network. Our aim is to minimize the discrepancy between the maximum and minimum load. The algorithm works as follows. Every vertex distributes its tok... Read More about Randomized Diffusion for Indivisible Loads.

Satisfiability of acyclic and almost acyclic CNF formulas (II) (2011)
Presentation / Conference Contribution
Ordyniak, S., Paulusma, D., & Szeider, S. (2011, December). Satisfiability of acyclic and almost acyclic CNF formulas (II). Presented at 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011, Ann Arbor, MI

In the first part of this work (FSTTCS’10) we have shown that the satisfiability of CNF formulas with β-acyclic hypergraphs can be decided in polynomial time. In this paper we continue and extend this work. The decision algorithm for β-acyclic formul... Read More about Satisfiability of acyclic and almost acyclic CNF formulas (II).

Numerical Updates of Lifetimes and Mixing Parameters of B Mesons (2011)
Presentation / Conference Contribution
Lenz, A., Nierste, U., & Gershon, T. (2010, September). Numerical Updates of Lifetimes and Mixing Parameters of B Mesons. Presented at CKM unitarity triangle : 6th International Workshop (CKM 2010), Warwick, UK

We update the Standard-Model predictions for several quantities related to Bs−B¯s and Bd−B¯d mixing. The mass and width differences in the Bs system read ΔMSMs=(17.3±2.6)ps−1 and ΔΓSMs=(0.087±0.021)ps−1, respectively. The CP asymmetries in flavour-sp... Read More about Numerical Updates of Lifetimes and Mixing Parameters of B Mesons.

Towards musical interaction: 'Schismatics' for e-violin and computer (2011)
Presentation / Conference Contribution
Kanno, M., Hayden, S., Adkins, M., & Isaacs, B. (2011, December). Towards musical interaction: 'Schismatics' for e-violin and computer. Presented at Proceedings of the International Computer Music Conference, ICMC 2011, Huddersfield, England

This paper discusses the evolution of the Max/MSP patch used in schismatics (2007, rev. 2010) for electric violin (Violectra) and computer, by composer Sam Hayden in collaboration with violinist Mieko Kanno. schismatics involves a standard performanc... Read More about Towards musical interaction: 'Schismatics' for e-violin and computer.