Therese C. Biedl

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2011
39Efficient view point selection for silhouettes of convex polyhedra. Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz. Comput. Geom. (44): 399-408 (2011). Web SearchBibTeXDownload
38A note on improving the performance of approximation algorithms for radiation therapy. Therese C. Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young. Inf. Process. Lett. (111): 326-333 (2011). Web SearchBibTeXDownload
37Reconstructing Convex Polygons and Convex Polyhedra from Edge and Face Counts in Orthogonal Projections. Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz. Int. J. Comput. Geometry Appl. (21): 215-239 (2011). Web SearchBibTeXDownload
36Reconstructing polygons from scanner data. Therese C. Biedl, Stephane Durocher, Jack Snoeyink. Theor. Comput. Sci. (412): 4161-4172 (2011). Web SearchBibTeXDownload
2010
35Sorting with networks of data structures. Therese C. Biedl, Alexander Golynski, Angčle M. Hamel, Alejandro López-Ortiz, J. Ian Munro. Discrete Applied Mathematics (158): 1579-1586 (2010). Web SearchBibTeXDownload
2009
34Fixed-Parameter Tractability and Improved Approximations for Segment Minimization. Therese C. Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young. CoRR (abs/0905.4930) (2009). Web SearchBibTeXDownload
33Reconstructing Polygons from Scanner Data. Therese C. Biedl, Stephane Durocher, Jack Snoeyink. ISAAC 2009, 862-871. Web SearchBibTeXDownload
2007
32Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz. FSTTCS 2007, 400-411. Web SearchBibTeXDownload
2005
31Cross-Stitching Using Little Thread. Therese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz. CCCG 2005, 199-202. Web SearchBibTeXDownload
2004
30Fun-Sort--or the chaos of unordered binary search. Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro. Discrete Applied Mathematics (144): 231-236 (2004). Web SearchBibTeXDownload
29Tight bounds on maximal and maximum matchings. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov. Discrete Mathematics (285): 7-15 (2004). Web SearchBibTeXDownload
28Efficient View Point Selection for Silhouettes of Convex Polyhedra. Therese C. Biedl, Masud Hasan, Alejandro López-Ortiz. MFCS 2004, 735-747. Web SearchBibTeXDownload
27Finding hidden independent sets in interval graphs. Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angčle M. Hamel, Alejandro López-Ortiz, Tomás Vinar. Theor. Comput. Sci. (310): 287-307 (2004). Web SearchBibTeXDownload
2003
26Finding Hidden Independent Sets in Interval Graphs. Therese C. Biedl, Brona Brejová, Erik D. Demaine, Angčle M. Hamel, Alejandro López-Ortiz, Tomás Vinar. COCOON 2003, 182-191. Web SearchBibTeXDownload
25Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. Therese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper. ESA 2003, 90-101. Web SearchBibTeXDownload
24Drawing K2, n: A lower bound. Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. Inf. Process. Lett. (85): 303-305 (2003). Web SearchBibTeXDownload
23Palindrome recognition using a multidimensional tape. Therese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar. Theor. Comput. Sci. (302): 475-480 (2003). Web SearchBibTeXDownload
2002
22Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. Therese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang. CCCG 2002, 105-108. Web SearchBibTeXDownload
21Drawing k2, n: A lower bound. Therese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz. CCCG 2002, 146-148. Web SearchBibTeXDownload
20Searching for the center of a circle. Therese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar. CCCG 2002, 137-141. Web SearchBibTeXDownload
19A note on reconfiguring tree linkages: trees can lock. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. Discrete Applied Mathematics (117): 293-297 (2002). Web SearchBibTeXDownload
18Balanced k-colorings. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. Discrete Mathematics (254): 19-32 (2002). Web SearchBibTeXDownload
17Curvature-Constrained Shortest Paths in a Convex Polygon. Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. SIAM J. Comput. (31): 1814-1851 (2002). Web SearchBibTeXDownload
2001
16The Complexity of Clickomania. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro. CoRR (cs.CC/0107031) (2001). Web SearchBibTeXDownload
15Locked and Unlocked Polygonal Chains in Three Dimensions. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. Discrete & Computational Geometry (26): 269-281 (2001). Web SearchBibTeXDownload
14Graph-Drawing Contest Report. Franz-Josef Brandenburg, Christian A. Duncan, Emden R. Gansner, Stephen G. Kobourov, Falk Schreiber. Graph Drawing 2001, 513-522. Web SearchBibTeXDownload
13Tight Bounds on Maximal and Maximum Matchings. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov. ISAAC 2001, 308-319. Web SearchBibTeXDownload
12Efficient Algorithms for Petersen's Matching Theorem. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw. J. Algorithms (38): 110-134 (2001). Web SearchBibTeXDownload
2000
11Balanced k-Colorings. Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang. MFCS 2000, 202-211. Web SearchBibTeXDownload
1999
10On Reconfiguring Tree Linkages: Trees can Lock. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. CoRR (cs.CG/9910024) (1999). Web SearchBibTeXDownload
9Convexifying Monotone Polygons. Therese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss. ISAAC 1999, 415-424. Web SearchBibTeXDownload
8Efficient Algorithms for Petersen's Matching Theorem. Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw. SODA 1999, 130-139. Web SearchBibTeXDownload
7Locked and Unlocked Polygonal Chains in 3D. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. SODA (cs.CG/9910009): 866-867 (1999). Web SearchBibTeXDownload
1998
6Hiding disks in folded polygons. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint. CCCG 1998. Web SearchBibTeXDownload
5Unfolding some classes of orthogonal polyhedra. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides. CCCG 1998. Web SearchBibTeXDownload
4On reconfiguring tree linkages: Trees can lock. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. CCCG 1998. Web SearchBibTeXDownload
3Locked and Unlocked Polygonal Chains in 3D. Therese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Mark H. Overmars, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides. CoRR (cs.CG/9811019) (1998). Web SearchBibTeXDownload
2Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Pankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides. Symposium on Computational Geometry 1998, 392-401. Web SearchBibTeXDownload
1Drawing Planar Partitions II: HH-Drawings. Therese C. Biedl, Michael Kaufmann, Petra Mutzel. WG 1998, 124-136. Web SearchBibTeXDownload
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research