Skip to main content

Research Repository

Advanced Search

Outputs (78)

On the intersection of tolerance and cocomparability graphs (2010)
Presentation / Conference Contribution
Mertzios, G., & Zaks, S. (2010, December). On the intersection of tolerance and cocomparability graphs. Presented at 21st International Symposium on Algorithms and Computation (ISAAC), Jeju Island, Korea

It has been conjectured by Golumbic and Monma in 1984 that the intersection of tolerance and cocomparability graphs coincides with bounded tolerance graphs. Since cocomparability graphs can be efficiently recognized, a positive answer to this conject... Read More about On the intersection of tolerance and cocomparability graphs.

Object Recognition using 3D SIFT in Complex CT Volumes (2010)
Presentation / Conference Contribution
Flitton, G., Breckon, T., & Megherbi, N. (2010, September). Object Recognition using 3D SIFT in Complex CT Volumes. Presented at Proc. British Machine Vision Conference

Can we evaluate the quality of software engineering experiments? (2010)
Presentation / Conference Contribution
Kitchenham, B., Sjøberg, D. I., Brereton, O. P., Budgen, D., Dybå, T., Höst, M., Pfahl, D., & Runeson, P. (2010, September). Can we evaluate the quality of software engineering experiments?. Presented at ESEM 2010 - 2010 ACM-IEEE International Symposium on Empirical Software Engineering and Measurement, Bolzano-Bozen, Italy

Context: The authors wanted to assess whether the quality of published human-centric software engineering experiments was improving. This required a reliable means of assessing the quality of such experiments. Aims: The aims of the study were to conf... Read More about Can we evaluate the quality of software engineering experiments?.

Computing sharp 2-factors in claw-free graphs (2010)
Journal Article
Broersma, H., & Paulusma, D. (2010). Computing sharp 2-factors in claw-free graphs. Journal of discrete algorithms, 8(3), 321-329. https://doi.org/10.1016/j.jda.2009.07.001

In a previous paper we obtained an upper bound for the minimum number of components of a 2-factor in a claw-free graph. This bound is sharp in the sense that there exist infinitely many claw-free graphs for which the bound is tight. In this paper we... Read More about Computing sharp 2-factors in claw-free graphs.

Computing role assignments of chordal graphs (2010)
Journal Article
Hof, P. V. '., Paulusma, D., & Rooij, J. V. (2010). Computing role assignments of chordal graphs. Theoretical Computer Science, 411(40-42), 3601-3613. https://doi.org/10.1016/j.tcs.2010.05.041

In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1,…,k}, called a role, to each vertex of G such that any two vertices with the same role have the same sets of roles a... Read More about Computing role assignments of chordal graphs.

Sketching-Based Skeleton Generation (2010)
Presentation / Conference Contribution
Zheng, Q., Li, F. L., & Lau, R. (2010, December). Sketching-Based Skeleton Generation. Presented at 2010 3rd IEEE International Conference on Ubi-Media Computing (U-Media 2010), Jinhua, China

Articulated character animation can be performed by manually creating and rigging a skeleton into an unfolded 3D object. Such tasks are not trivial, as it requires a substantial amount of training and practices. Although methods have been proposed to... Read More about Sketching-Based Skeleton Generation.