Rosemary Apple
Indiana University
rapple%indiana.edu
University of Edinburgh
Amanda Cadieu
Western Illinois University
ab-cadieu%wiu.edu
Subgraph Recoverability
Subgraph Recoverability
(ps,
pdf
tex)
David Diamondstone
Brandeis University
diamondstone%brandeis.edu
Connections and Determinants: A Geometric Formulation
(ps,
pdf,
tex)
Walk Network Recoverability and the Card Conjecture
(ps,
pdf,
tex)
University of Chicago
Jennifer French
University of Washington
jefrench%u.washington.edu
2^n to 1 Networks
(ps,
pdf,
tex)
MIT
Noah Giansiracusa
University of Washington
noahgian%u.washington.edu
Harmonic Graph Homomorphisms
(ps,
pdf,
tex)
Brown University
Igor Gorodezky
University of Chicago
igor2006%uchicago.edu
On Embeddings of Circular Planar Graphs
(ps,
pdf,
tex)
Kyotaro Hemmi
University of Washington
kyotarohemmi%aol.com
Recovering Stars with Eigenvalues and Eigenvectors (old)
(pdf)
Chad Johnson
Illinois Institute of Technology
johncha2%iit.edu
Andrew Lewis
University of Washington
tartuffe%u.washington.edu
Random Walk Networks
(ps,
pdf,
tex)
Google
Nicholas Reichert
University of Washington
nwr%u.washington.edu
The Smallest Recoverable Flower
(ps,
pdf,
tex)
Mobius Strips, Pinwheels, and Other Two-to-One Generalizations of N-Gon-in-N-Gon Graphs
(ps,
pdf,
tex)
Generalized Circular Medial Graphs
(ps,
pdf,
tex)
Princeton University
Jerry Pan
University of Washington
panshen%u.washington.edu
See French for papers
Amazon
Nyssa Thompson
California Institute of Technology
nyssa%caltech.edu
All Recoverable Graphs with Five Boundary Nodes or Fewer
(pdf)
Miao Xu
Louisiana State University
mxu1%lsu.edu
On the Nature of Connectivity Types (Midterm)
(ps,
pdf,
tex)
And, the final version
(ps,
pdf,
tex)