32 citations · 39 across the 4 of their papers we have counts for
4 papers
Graphical Condensation Generalizations Involving Pfaffians and Determinants
Eric Kuo
Graphical condensation is a technique used to prove combinatorial identities among numbers of perfect matchings of plane graphs. Propp and Kuo first applied this technique to prove…
Viterbi Sequences and Polytopes
Eric H. Kuo
A Viterbi path of length n of a discrete Markov chain is a sequence of n+1 states that has the greatest probability of ocurring in the Markov chain. We divide the space of all Mark…
Applications of Graphical Condensation for Enumerating Matchings and Tilings
Eric H. Kuo
A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions.…
Ununfoldable Polyhedra with Convex Faces
Marshall Bern, Erik D. Demaine, David Eppstein +3
Unfolding a convex polyhedron into a simple planar polygon is a well-studied problem. In this paper, we study the limits of unfoldability by studying nonconvex polyhedra with the s…