Outputs (3167)

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.

Induced disjoint paths in AT-free graphs (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & van Leeuwen, E. J. (2012, December). Induced disjoint paths in AT-free graphs

Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test whether a gra...

Induced disjoint paths in claw-free graphs (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & van Leeuwen, E. J. (2012, December). Induced disjoint paths in claw-free graphs

Paths P1,…,Pk in a graph G = (V,E) are said to be mutually induced if for any 1 ≤ i < j ≤ k, Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their end-vertices). The Induced Disjoint Paths problem is to test whether a gra...

Closing complexity gaps for coloring problems on H-free graphs (2012)
Presentation / Conference Contribution
Golovach, P. A., Paulusma, D., & Song, J. (2012, December). Closing complexity gaps for coloring problems on H-free graphs

If a graph G contains no subgraph isomorphic to some graph H, then G is called H-free. A coloring of a graph G = (V,E) is a mapping c: V → {1,2,…} such that no two adjacent vertices have the same color, i.e., c(u) ≠ c(v) if uv ∈ E; if |c(V)| ≤ k then... Read More about Closing complexity gaps for coloring problems on H-free graphs.

Finding vertex-surjective graph homomorphisms (2012)
Presentation / Conference Contribution
Golovach, P. A., Lidicky, B., Martin, B., & Paulusma, D. (2012, December). Finding vertex-surjective graph homomorphisms

The Surjective Homomorphism problem is to test whether a given graph G called the guest graph allows a vertex-surjective homomorphism to some other given graph H called the host graph. The bijective and injective homomorphism problems can be formulat... Read More about Finding vertex-surjective graph homomorphisms.

Obtaining planarity by contracting few edges (2012)
Presentation / Conference Contribution
Golovach, P. A., van 't Hog, P., & Paulusma, D. (2012, December). Obtaining planarity by contracting few edges

The Planar Contraction problem is to test whether a given graph can be made planar by using at most k edge contractions. This problem is known to be NP-complete. We show that it is fixed-parameter tractable when parameterized by k.

Detecting induced minors in AT-free graphs (2012)
Presentation / Conference Contribution
Golovach, P. A., Kratsch, D., & Paulusma, D. (2012, December). Detecting induced minors in AT-free graphs

The problem Induced Minor is to test whether a graph G can be modified into a graph H by a sequence of vertex deletions and edge contractions. We prove that Induced Minor is polynomial-time solvable when G is AT-free, and H is fixed, i.e., not part o... Read More about Detecting induced minors in AT-free graphs.

Annotated Free-Hand Sketches for Video Retrieval Using Object Semantics and Motion (2012)
Presentation / Conference Contribution
Hu, R., James, S., & Collomosse, J. (2012, January). Annotated Free-Hand Sketches for Video Retrieval Using Object Semantics and Motion. Presented at MMM 2012: Advances in Multimedia Modeling, Klagenfurt, Austria

We present a novel video retrieval system that accepts annotated free-hand sketches as queries. Existing sketch based video retrieval (SBVR) systems enable the appearance and movements of objects to be searched naturally through pictorial representat... Read More about Annotated Free-Hand Sketches for Video Retrieval Using Object Semantics and Motion.

Placing regenerators in optical networks to satisfy multiple sets of requests (2012)
Journal Article
Mertzios, G., Sau, I., Shalom, M., & Zaks, S. (2012). Placing regenerators in optical networks to satisfy multiple sets of requests. IEEE/ACM Transactions on Networking, 20(6), 1870-1879. https://doi.org/10.1109/tnet.2012.2186462

The placement of regenerators in optical networks has become an active area of research during the last few 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... Read More about Placing regenerators in optical networks to satisfy multiple sets of requests.

Gender differences in spatial awareness in immersive virtual environments: a preliminary investigation (2012)
Presentation / Conference Contribution
Paraskeva, C., Koulieris, G. A., Coxon, M., & Mania, K. (2012, December). Gender differences in spatial awareness in immersive virtual environments: a preliminary investigation. Presented at Proceedings of the 11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and its Applications in Industry ACM, Singapore

This paper presents an experiment exploring gender differences in spatial navigation, memory performance and spatial awareness through a complex Virtual Environment (VE). The immersive simulation consisted of a radiosity-rendered space divided in fou... Read More about Gender differences in spatial awareness in immersive virtual environments: a preliminary investigation.