Skip to main content

Research Repository

Advanced Search

Outputs (79)

Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs (2010)
Presentation / Conference Contribution
Broersma, H., Golovach, P., Paulusma, D., & Song, J. (2010, June). Narrowing Down the Gap on the Complexity of Coloring Pk-Free Graphs. Presented at WG 2010: Graph-Theoretic Concepts in Computer Science, Zarós, Crete, Greece

Binary-SDMOPSO and its application in channel selection for Brain-Computer Interfaces (2010)
Presentation / Conference Contribution
Al Moubayed, N., Awwad Shiekh Hasan, B., Gan, J., Petrovski, A., & McCall, J. (2010, September). Binary-SDMOPSO and its application in channel selection for Brain-Computer Interfaces. Presented at 2010 UK Workshop on Computational Intelligence (UKCI), Colchester, UK

In, we introduced Smart Multi-Objective Particle Swarm Optimisation using Decomposition (SDMOPSO). The method uses the decomposition approach proposed in Multi-Objective Evolutionary Algorithms based on Decomposition (MOEA/D), whereby a multi-objecti... Read More about Binary-SDMOPSO and its application in channel selection for Brain-Computer Interfaces.

On Coloring Graphs without Induced Forests (2010)
Presentation / Conference Contribution
Broersma, H., Golovach, P., Paulusma, D., & Song, J. (2010, December). On Coloring Graphs without Induced Forests. Presented at ISAAC 2010: Algorithms and Computation, Jeju Island, Korea

Simulating Multiple Character Interactions with Collaborative and Adversarial Goals (2010)
Journal Article
Shum, H. P., Komura, T., & Yamazaki, S. (2012). Simulating Multiple Character Interactions with Collaborative and Adversarial Goals. IEEE Transactions on Visualization and Computer Graphics, 18(5), 741-752. https://doi.org/10.1109/tvcg.2010.257

This paper proposes a new methodology for synthesizing animations of multiple characters, allowing them to intelligently compete with one another in dense environments, while still satisfying requirements set by an animator. To achieve these two conf... Read More about Simulating Multiple Character Interactions with Collaborative and Adversarial Goals.

Satisfiability of Acyclic and Almost Acyclic CNF Formulas (2010)
Presentation / Conference Contribution
Ordyniak, S., Paulusma, D., & Szeider, S. (2010, December). Satisfiability of Acyclic and Almost Acyclic CNF Formulas. Presented at IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Chennai, India

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.