Karen Meagher
Computational Theory and Mathematics · 2005–2015
A researcher in the Science corpus: 4 papers; trusts 2 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 11 citations into it
Whom Karen Meagher trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Karen Meagher overall
Papers from Karen Meagher's perspective
Ordered by how strongly the researchers Karen Meagher trusts endorse each paper. Same corpus, a different order for every researcher.
- Group construction of covering arrays
- On the state of strength‐three covering arrays
- Constructing test suites for interaction testing (25th International Conference on Software Engineering, 2003. Proceedings.)
- Algebraic Graph Theory
- Graphs and homomorphisms (Oxford lecture series in mathematics and its applications)
- ON THE MINIMUM NUMBER OF DISTINCT EIGENVALUES FOR A SYMMETRIC MATRIX WHOSE GRAPH IS A GIVEN TREE
- The graphs for which the maximum multiplicity of an eigenvalue is two
- Covering arrays of higher strength from permutation vectors
- The minimum rank of symmetric matrices described by a graph: A survey☆
- SPECTRAL GRAPH THEORY AND THE INVERSE EIGENVALUE PROBLEM OF A GRAPH
Their papers
- Group construction of covering arrays (2005) — 59 citations
- Erdős-Ko-Rado Theorems: Algebraic Approaches (2015) — 229 citations
- Minimum number of distinct eigenvalues of graphs (2013) — 51 citations
- Covering arrays on graphs: Qualitative independence graphs and extremal set partition theory (2007) — 46 citations