7 citations · 7 across the 2 of their papers we have counts for
3 papers
math.CO2004★ 7 cited
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…
math.CO2003
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.…
cs.CG1999
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…