Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms
(2005)
Presentation / Conference Contribution
Fiala, J., Paulusma, D., & Telle, J. (2005, June). Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms. Presented at WG 2005: Graph-Theoretic Concepts in Computer Science, Metz, France
Outputs (3022)
Supermodularity on chains and complexity of maximum constraint satisfaction (2005)
Presentation / Conference Contribution
Deineko, V., Jonsson, P., Klasson, M., & Krokhin, A. (2005, December). Supermodularity on chains and complexity of maximum constraint satisfaction. Presented at 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb'05)
Phase modulation with polymer-dispersed liquid crystals (2005)
Presentation / Conference Contribution
Hands, P., Kirby, A., & Love, G. (2005, December). Phase modulation with polymer-dispersed liquid crystals
Maximum constraint satisfaction on diamonds (2005)
Presentation / Conference Contribution
Krokhin, A., & Larose, B. (2005, December). Maximum constraint satisfaction on diamonds. Presented at 11th International Conference on Principles and Practice of Constraint Programming {(CP'05)
Optical design of liquid crystal lenses: off-axis modelling (2005)
Presentation / Conference Contribution
Kirby, A., Hands, P., & Love, G. (2005, December). Optical design of liquid crystal lenses: off-axis modelling
Eine cache-optimale Implementierung eines Navier-Stokes Lösers unter besonderer Berücksichtigung physikalischer Erhaltungssätze (2005)
Thesis
Weinzierl, T. Eine cache-optimale Implementierung eines Navier-Stokes Lösers unter besonderer Berücksichtigung physikalischer Erhaltungssätze. (Dissertation). Fakultät für Informatik, Technische Universität München Fakultät für Informatik, Technische Universität München. https://durham-repository.worktribe.com/output/1698173
International workshop on realising evidence-based software engineering (2005)
Presentation / Conference Contribution
Budgen, D., Brereton, P., Kitchenham, B., & Linkman, S. (2005, February). International workshop on realising evidence-based software engineering. Presented at Proceedings - International Conference on Software Engineering, St Louis, USAThis workshop is concerned with defining the procedures that are needed to establish a sound empirical foundation for the practices of Software Engineering. Our goal is to begin building a community that will review, analyse, codify and promulgate so... Read More about International workshop on realising evidence-based software engineering.
Realising evidence-based software engineering (2005)
Presentation / Conference Contribution
Kitchenham, B., Budgen, D., Brereton, P., & Linkman, S. H. (2005, February). Realising evidence-based software engineering. Presented at Proceedings of the 2005 Workshop on Realising Evidence-Based Software Engineering, REBSE '05, St Louis, USAThis paper provides an introduction to the papers for the Workshop on Realising Evidence-Based Software Engineering. Copyright 2005 ACM.
A conceptual model for virtual organizations in the grid (2005)
Presentation / Conference Contribution
Song, W., Li, X., Zhuge, H., & Fox, G. (2005, November). A conceptual model for virtual organizations in the grid. Presented at Fourth International Conference on Grid and Cooperative Computing, Beijing, ChinaOne of the key problems with virtual organizations in the context of the (Semantic) Grid is we don’t know how to describe the components used in virtual organizations because they appear to be dynamic, dispersed, transient, type-vague (or we don’t kn... Read More about A conceptual model for virtual organizations in the grid.
Backdoor Sets for DLL Subsolvers (2005)
Journal Article
Szeider, S. (2005). Backdoor Sets for DLL Subsolvers. Journal of Automated Reasoning, 35(1-3), 73-88. https://doi.org/10.1007/s10817-005-9007-9We study the parameterized complexity of detecting small backdoor sets for instances of the propositional satisfiability problem (SAT). The notion of backdoor sets has been recently introduced by Williams, Gomes, and Selman for explaining the ‘heavy-... Read More about Backdoor Sets for DLL Subsolvers.