Skip to main content

Research Repository

Advanced Search

Outputs (44)

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

Software Architecture Visualization: An Evaluation Framework and Its Application (2007)
Journal Article
Gallagher, K., Hatch, A., & Munro, M. (2008). Software Architecture Visualization: An Evaluation Framework and Its Application. IEEE Transactions on Software Engineering, 34(2), 260-270. https://doi.org/10.1109/tse.2007.70757

In order to characterize and improve software architecture visualization practice, the paper derives and constructs a qualitative framework, with 7 key areas and 31 features, for the assessment of software architecture visualization tools. The framew... Read More about Software Architecture Visualization: An Evaluation Framework and Its Application.

Reducing Regression Test Size by Exclusion (2007)
Presentation / Conference Contribution
Gallagher, K., Hall, T., Black, S., Tahvildari, L., & Canfora, G. (2007). Reducing Regression Test Size by Exclusion. In IEEE International Conference on Software Maintenance, ICSM 2007, 2-5 October 2007, Paris ; proceedings (154-163). https://doi.org/10.1109/icsm.2007.4362628

Operational software is constantly evolving. Regression testing is used to identify the unintended consequences of evolutionary changes. As most changes affect only a small proportion of the system, the challenge is to ensure that the regression test... Read More about Reducing Regression Test Size by Exclusion.

Parameterized proof complexity (2007)
Presentation / Conference Contribution
Dantchev, S., Martin, B., & Szeider, S. (2007). Parameterized proof complexity. In 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS '07, 21-23 October 2007, Providence, RI ; proceedings (150-160). https://doi.org/10.1109/focs.2007.53

We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given propositional CNF formula cannot be satisfied by a truth assignment that se... Read More about Parameterized proof complexity.

Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links (2007)
Journal Article
Stewart, I. (2007). Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links. Journal of Interconnection Networks, 8(3), 253-284. https://doi.org/10.1142/s0219265907002016

We derive a sequential algorithm Find-Ham-Cycle with the following property. On input: k and n (specifying the k-ary n-cube Q(n,k); F, a set of at most 2n-2 faulty links; and v, a node of Q(n,k), the algorithm outputs nodes v+ and v- such that if Fin... Read More about Distributed algorithms for building Hamiltonian cycles in k-ary n-cubes and hypercubes with faulty links.