Sandra Kiefer
2015
A researcher in the Science corpus: 1 paper; trusts 6 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Sandra Kiefer trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Jin-Yi Cai
- Martin Fürer
- Christoph Berkholz
- László Babai
- Martin Grohe
- Neil Immerman
- Paul S. Bonsma
- Vikraman Arvind
- Brendan D. McKay
Who trusts Sandra Kiefer overall
Papers from Sandra Kiefer's perspective
Ordered by how strongly the researchers Sandra Kiefer trusts endorse each paper. Same corpus, a different order for every researcher.
- Random Graph Isomorphism
- An optimal lower bound on the number of variables for graph identification
- Practical graph isomorphism, II
- On the Power of Color Refinement
- An optimal lower bound on the number of variables for graph identification
- Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement
- PEBBLE GAMES AND LINEAR EQUATIONS
- Canonical labelling of graphs in linear average time
- Canonical labeling of graphs
- A Note on the Graph Isomorphism counting Problem
Their papers
- Graphs Identified by Logics with Counting (2015) — 52 citations