Author:
Barcucci Elena,Brunetti Sara,Del Lungo Alberto,Nivat Maurice
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. R. P. Anstee, “Invariant sets of arcs in network flow problems,” Disc. Appl. Math. 13, 1–7(1986).
2. B. Aspvall, M.F. Plass and R.E. Tarjan, “A linear-time algorithm for testing the truth of certain quantified Boolean formulas”Inf. Proc. Lett., 8,3 (1979).
3. E. Barcucci, A. Del Lungo, M. Nivat and R. Pinzani, “Reconstructing convex polyominoes from their horizontal and vertical projections”, Theor. Comp. Sci., 155 (1996) 321–347.
4. M. Chrobak, C. Dürr, “Reconstructing hv-Convex Polyominoes from Orthogonal Projectionsý, Inf. Proc. Lett. (69)6, (1999) 283–289.
5. A. Denise, C. Dürr and F. Ibn-majdoub-Hassani, “Enumération et génération aléatoire de polyominos convexes en réseau hexagonal”, Proc. of the 9
th
FPSAC, Vienna, 222–235 (1997).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Discrete Q-Convex Sets Reconstruction from Discrete Point X-Rays;Lecture Notes in Computer Science;2011
2. An algorithm reconstructing convex lattice sets;Theoretical Computer Science;2003-07
3. Detection of the discrete convexity of polyominoes;Discrete Applied Mathematics;2003-01
4. Introduction;Advances in Discrete Tomography and Its Applications