Demaine, Erik D.; Erickson, Jeff; Kriząnc, Danny; Meijer, Henk; Morin, Pat; Overmars, Mark; Whitesides, Sue Realizing partitions respecting full and partial order information. (English) Zbl 1156.68025 J. Discrete Algorithms 6, No. 1, 51-58 (2008). MSC: 68Q25 05A17 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., J. Discrete Algorithms 6, No. 1, 51--58 (2008; Zbl 1156.68025) Full Text: DOI
Demaine, Erik D.; Erickson, Jeff; Hurtado, Ferran; Iacono, John; Langerman, Stefan; Meijer, Henk; Overmars, Mark; Whitesides, Sue Separating point sets in polygonal environments. (English) Zbl 1104.68116 Int. J. Comput. Geom. Appl. 15, No. 4, 403-419 (2005). MSC: 68U05 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Int. J. Comput. Geom. Appl. 15, No. 4, 403--419 (2005; Zbl 1104.68116) Full Text: DOI
Demaine, Erik D.; Erickson, Jeff; Hurtado, Ferran; Iacono, John; Langerman, Stefan; Meijer, Henk; Overmars, Mark; Whitesides, Sue Separating point sets in polygonal environments. (English) Zbl 1374.68656 Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8–11, 2004. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-885-7). 10-16 (2004). MSC: 68U05 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., in: Proceedings of the 20th annual symposium on computational geometry, SCG/SoCG 2004, Brooklyn, NY, USA, June 8--11, 2004. New York, NY: Association for Computing Machinery (ACM). 10--16 (2004; Zbl 1374.68656) Full Text: DOI
Biedl, Therese; Demaine, Erik; Demaine, Martin; Lazard, Sylvain; Lubiw, Anna; O’Rourke, Joseph; Robbins, Steve; Streinu, Ileana; Toussaint, Godfried; Whitesides, Sue A note on reconfiguring tree linkages: Trees can lock. (English) Zbl 0993.52003 Discrete Appl. Math. 117, No. 1-3, 293-297 (2002). MSC: 52C25 PDFBibTeX XMLCite \textit{T. Biedl} et al., Discrete Appl. Math. 117, No. 1--3, 293--297 (2002; Zbl 0993.52003) Full Text: DOI
Biedl, T.; Demaine, E.; Demaine, M.; Lazard, S.; Lubiw, A.; O’Rourke, J.; Overmars, M.; Robbins, S.; Streinu, I.; Toussaint, G.; Whitesides, S. Locked and unlocked polygonal chains in three dimensions. (English) Zbl 0988.68202 Discrete Comput. Geom. 26, No. 3, 269-281 (2001). MSC: 68U05 PDFBibTeX XMLCite \textit{T. Biedl} et al., Discrete Comput. Geom. 26, No. 3, 269--281 (2001; Zbl 0988.68202) Full Text: DOI
Biedl, T.; Demaine, E.; Demaine, M.; Lazard, S.; Lubiw, A.; O’Rourke, J.; Overmars, M.; Robbins, S.; Streinu, I.; Toussaint, G.; Whitesides, S. Locked and unlocked polygonal chains in 3D. (English) Zbl 1052.68759 Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17–19, 1999. Philadelphia, PA: SIAM (ISBN 0-89871-434-6). 866-867 (1999). MSC: 68U05 PDFBibTeX XMLCite \textit{T. Biedl} et al., in: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, SODA '99. Baltimore, MD, USA, January 17--19, 1999. Philadelphia, PA: SIAM. 866--867 (1999; Zbl 1052.68759)