Welcome to Durham Research Online (DRO)

Upper Bounds and Algorithms for Parallel Knock-Out Numbers (2007)
Presentation / Conference Contribution
Broersma, H., Johnson, M., & Paulusma, D. (2007, June). Upper Bounds and Algorithms for Parallel Knock-Out Numbers. Presented at SIROCCO 2007: Structural Information and Communication Complexity, Castiglioncello, Italy

Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars (2007)
Presentation / Conference Contribution
Broersma, H., Marchal, B., Paulusma, D., & Salman, A. (2007, January). Improved Upper Bounds for λ-Backbone Colorings Along Matchings and Stars. Presented at SOFSEM 2007, Harrachov, Czech Republic

Covering Graphs with Few Complete Bipartite Subgraphs (2007)
Presentation / Conference Contribution
Fleischner, H., Mujuni, E., Paulusma, D., & Szeider, S. (2007, December). Covering Graphs with Few Complete Bipartite Subgraphs. Presented at FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, New Delhi, India

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

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