dblp.uni-trier.dewww.uni-trier.de

Therese C. Biedl Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
85EETherese C. Biedl, Michal Stern: Edge-Intersection Graphs of k-Bend Paths in Grids. COCOON 2009: 86-95
84EETherese C. Biedl, Burkay Genc: Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. ESA 2009: 71-82
83EETherese C. Biedl, Stephane Durocher, Holger H. Hoos, Shuang Luan, Jared Saia, Maxwell Young: Fixed-Parameter Tractability and Improved Approximations for Segment Minimization CoRR abs/0905.4930: (2009)
2007
82 Shabnam Aziza, Therese C. Biedl: Improved Layouts of the Multigrid Network. CCCG 2007: 221-224
81 Therese C. Biedl: Realizations of Hexagonal Graph Representations. CCCG 2007: 89-92
80EETherese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. FSTTCS 2007: 400-411
79EETherese C. Biedl, Anna Lubiw, Michael J. Spriggs: Cauchy's Theorem and Edge Lengths of Convex Polyhedra. WADS 2007: 398-409
2006
78EETherese C. Biedl, Franz-Josef Brandenburg: Partitions of Graphs into Trees. Graph Drawing 2006: 430-439
77EETherese C. Biedl, Torsten Thiele, David R. Wood: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Algorithmica 44(3): 233-255 (2006)
76EETherese C. Biedl: Polygons Needing Many Flipturns. Discrete & Computational Geometry 35(1): 131-141 (2006)
2005
75EETherese C. Biedl, Franz-Josef Brandenburg: Drawing planar bipartite graphs with small area. CCCG 2005: 105-108
74EETherese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing Polyhedra Preserving Face Normals: A Counterexample. CCCG 2005: 109-112
73EETherese C. Biedl, Burkay Genc: Complexity of Octagonal and Rectangular Cartograms. CCCG 2005: 117-120
72EETherese C. Biedl: The complexity of domino tiling. CCCG 2005: 187-190
71EETherese C. Biedl, Joseph Douglas Horton, Alejandro López-Ortiz: Cross-Stitching Using Little Thread. CCCG 2005: 199-202
70EETherese C. Biedl, Franz-Josef Brandenburg, Xiaotie Deng: Crossings and Permutations. Graph Drawing 2005: 1-12
69EETherese C. Biedl, Anna Lubiw, Michael J. Spriggs: Morphing Planar Graphs While Preserving Edge Directions. Graph Drawing 2005: 13-24
68EETherese C. Biedl, Anna Lubiw, Julie Sun: When can a net fold to a polyhedron? Comput. Geom. 31(3): 207-218 (2005)
67EETherese C. Biedl, Timothy M. Chan, Yashar Ganjali, Mohammad Taghi Hajiaghayi, David R. Wood: Balanced vertex-orderings of graphs. Discrete Applied Mathematics 148(1): 27-48 (2005)
66EETherese C. Biedl, Timothy M. Chan: A note on 3D orthogonal graph drawing. Discrete Applied Mathematics 148(2): 189-193 (2005)
65EETherese C. Biedl, Dana F. Wilkinson: Bounded-Degree Independent Sets in Planar Graphs. Theory Comput. Syst. 38(3): 253-278 (2005)
2004
64EETherese C. Biedl, Burkay Genc: When can a graph form an orthogonal polyhedron? CCCG 2004: 53-56
63EEShabnam Aziza, Therese C. Biedl: Hexagonal Grid Drawings: Algorithms and Lower Bounds. Graph Drawing 2004: 18-24
62EETherese C. Biedl, Masud Hasan, Alejandro López-Ortiz: Efficient View Point Selection for Silhouettes of Convex Polyhedra. MFCS 2004: 735-747
61EETherese C. Biedl, Anna Lubiw, Michael J. Spriggs: Angles and Lengths in Reconfigurations of Polygons and Polyhedra. MFCS 2004: 748-759
60EETherese C. Biedl, Timothy M. Chan, Erik D. Demaine, Rudolf Fleischer, Mordecai J. Golin, James A. King, J. Ian Munro: Fun-Sort--or the chaos of unordered binary search. Discrete Applied Mathematics 144(3): 231-236 (2004)
59EETherese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight bounds on maximal and maximum matchings. Discrete Mathematics 285(1-3): 7-15 (2004)
58EETherese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar: Finding hidden independent sets in interval graphs. Theor. Comput. Sci. 310(1-3): 287-307 (2004)
2003
57 Therese C. Biedl, Anna Lubiw, Michael J. Spriggs: Parallel morphing of trees and cycles. CCCG 2003: 29-34
56EETherese C. Biedl, Brona Brejová, Erik D. Demaine, Angèle M. Hamel, Alejandro López-Ortiz, Tomás Vinar: Finding Hidden Independent Sets in Interval Graphs. COCOON 2003: 182-191
55EETherese C. Biedl, Erik D. Demaine, Alexander Golynski, Joseph Douglas Horton, Alejandro López-Ortiz, Guillaume Poirier, Claude-Guy Quimper: Optimal Dynamic Video-on-Demand Using Adaptive Broadcasting. ESA 2003: 90-101
54EETherese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz: Drawing K2, n: A lower bound. Inf. Process. Lett. 85(6): 303-305 (2003)
53EETherese C. Biedl, Jonathan F. Buss, Erik D. Demaine, Martin L. Demaine, Mohammad Taghi Hajiaghayi, Tomás Vinar: Palindrome recognition using a multidimensional tape. Theor. Comput. Sci. 302(1-3): 475-480 (2003)
2002
52EETherese C. Biedl, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Paul Nijjar, Ryuhei Uehara, Ming-wei Wang: Tighter bounds on the genus of nonorthogonal polyhedra built from rectangles. CCCG 2002: 105-108
51EETherese C. Biedl, Masud Hasan, Joseph Douglas Horton, Alejandro López-Ortiz, Tomás Vinar: Searching for the center of a circle. CCCG 2002: 137-141
50EETherese C. Biedl, Timothy M. Chan, Alejandro López-Ortiz: Drawing k2, n: A lower bound. CCCG 2002: 146-148
49EETherese C. Biedl: Drawing Outer-Planar Graphs in O(n log n) Area. Graph Drawing 2002: 54-65
48EETherese C. Biedl, Dana F. Wilkinson: Bounded-Degree Independent Sets in Planar Graphs. ISAAC 2002: 416-427
47 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: A note on reconfiguring tree linkages: trees can lock. Discrete Applied Mathematics 117(1-3): 293-297 (2002)
46EETherese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-colorings. Discrete Mathematics 254(1-3): 19-32 (2002)
45EEPankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides: Curvature-Constrained Shortest Paths in a Convex Polygon. SIAM J. Comput. 31(6): 1814-1851 (2002)
2001
44EETherese C. Biedl, John R. Johansen, Thomas C. Shermer, David R. Wood: Orthogonal Drawings with Few Layers. Graph Drawing 2001: 297-311
43EETherese C. Biedl, Franz-Josef Brandenburg: Graph-Drawing Contest Report. Graph Drawing 2001: 513-522
42EETherese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov: Tight Bounds on Maximal and Maximum Matchings. ISAAC 2001: 308-319
41EETherese C. Biedl: Linear reductions of maximum matching. SODA 2001: 825-826
40EETherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Lars Jacobsen, J. Ian Munro: The Complexity of Clickomania CoRR cs.CC/0107031: (2001)
39 Therese C. Biedl: The DFS-heuristic for orthogonal graph drawing. Comput. Geom. 18(3): 167-188 (2001)
38EETherese 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: Locked and Unlocked Polygonal Chains in Three Dimensions. Discrete & Computational Geometry 26(3): 269-281 (2001)
37 Therese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw: Efficient Algorithms for Petersen's Matching Theorem. J. Algorithms 38(1): 110-134 (2001)
36EETherese C. Biedl: 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved. J. Graph Algorithms Appl. 5(3): (2001)
2000
35EETherese C. Biedl: 1-bend 3-D orthogonal drawings: two open problems solved. CCCG 2000
34EETherese C. Biedl, Torsten Thiele, David R. Wood: Three-Dimensional Orthogonal Graph Drawing with Optimal Volume. Graph Drawing 2000: 284-295
33EETherese C. Biedl, Brona Brejová, Tomás Vinar: Simplifying Flow Networks. MFCS 2000: 192-201
32EETherese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang: Balanced k-Colorings. MFCS 2000: 202-211
31 Therese C. Biedl, Brendan Madden, Ioannis G. Tollis: The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Int. J. Comput. Geometry Appl. 10(6): 553-580 (2000)
1999
30EETherese C. Biedl, Anna Lubiw, Julie Sun: When can a net fold to a polyhedron. CCCG 1999
29EETherese C. Biedl, Anna Bretscher, Henk Meijer: Rectangle of Influence Drawings of Graphs without Filled 3-Cycles. Graph Drawing 1999: 359-368
28EETherese C. Biedl, Erik D. Demaine, Sylvain Lazard, Steven M. Robbins, Michael A. Soss: Convexifying Monotone Polygons. ISAAC 1999: 415-424
27EETherese C. Biedl, Prosenjit Bose, Erik D. Demaine, Anna Lubiw: Efficient Algorithms for Petersen's Matching Theorem. SODA 1999: 130-139
26EETherese 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: Locked and Unlocked Polygonal Chains in 3D. SODA 1999: 866-867
25EETherese 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: Locked and Unlocked Polygonal Chains in 3D CoRR cs.CG/9910009: (1999)
24EETherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On Reconfiguring Tree Linkages: Trees can Lock CoRR cs.CG/9910024: (1999)
23EETherese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Bounds for Orthogonal 3-D Graph Drawing. J. Graph Algorithms Appl. 3(4): 63-79 (1999)
1998
22EETherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Godfried T. Toussaint: Hiding disks in folded polygons. CCCG 1998
21EETherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Sylvain Lazard, Anna Lubiw, Joseph O'Rourke, Steve Robbins, Ileana Streinu, Godfried T. Toussaint, Sue Whitesides: On reconfiguring tree linkages: Trees can lock. CCCG 1998
20EETherese C. Biedl, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Mark H. Overmars, Joseph O'Rourke, Steve Robbins, Sue Whitesides: Unfolding some classes of orthogonal polyhedra. CCCG 1998
19EETherese C. Biedl: Three Approaches to 3D-Orthogonal Box-Drawings. Graph Drawing 1998: 30-43
18EETherese C. Biedl, Joe Marks, Kathy Ryall, Sue Whitesides: Graph Multidrawing: Finding Nice Drawings Without Defining Nice. Graph Drawing 1998: 347-355
17EETherese C. Biedl: Drawing Planar Partitions I: LL-Drawings and LH-Drawings. Symposium on Computational Geometry 1998: 287-296
16EEPankaj K. Agarwal, Therese C. Biedl, Sylvain Lazard, Steve Robbins, Subhash Suri, Sue Whitesides: Curvature-Constrained Shortest Paths in a Convex Polygon (Extended Abstract). Symposium on Computational Geometry 1998: 392-401
15EETherese C. Biedl, Michael Kaufmann, Petra Mutzel: Drawing Planar Partitions II: HH-Drawings. WG 1998: 124-136
14EETherese 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: Locked and Unlocked Polygonal Chains in 3D CoRR cs.CG/9811019: (1998)
13 Therese C. Biedl, Goos Kant: A better heuristic for orthogonal graph drawings. Comput. Geom. 9(3): 159-180 (1998)
12EETherese C. Biedl: Relating Bends and Size in Orthogonal Graph Drawings. Inf. Process. Lett. 65(2): 111-115 (1998)
11EETherese C. Biedl: New Lower Bounds For Orthogonal Drawings. J. Graph Algorithms Appl. 2(2): (1998)
1997
10EETherese C. Biedl, Michael Kaufmann: Area-Efficient Static and Incremental Graph Drawings. ESA 1997: 37-52
9 Therese C. Biedl, Brendan Madden, Ioannis G. Tollis: The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Graph Drawing 1997: 391-402
8 Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath: Orthogonal 3-D Graph Drawing. Graph Drawing 1997: 76-86
7 Therese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs Under the Four-Connectivity Constraint. Algorithmica 19(4): 427-446 (1997)
1996
6 Therese C. Biedl: Improved Orthogonal Drawings of 3-graphs. CCCG 1996: 295-299
5 Therese C. Biedl: Optimal Orthogonal Drawings of Connected Plane Graphs. CCCG 1996: 306-311
4EETherese C. Biedl: Optimal Orthogonal Drawings of Triconnected Plane Graphs. SWAT 1996: 333-344
1995
3 Therese C. Biedl: New Lower Bounds for Orthogonal Graph Drawings. Graph Drawing 1995: 28-39
1994
2EETherese C. Biedl, Goos Kant: A Better Heuristic for Orthogonal Graph Drawings. ESA 1994: 24-35
1EETherese C. Biedl, Goos Kant, Michael Kaufmann: On Triangulating Planar Graphs under the Four-Connectivity Constraint. SWAT 1994: 83-94

Coauthor Index

1Pankaj K. Agarwal [16] [45]
2Shabnam Aziza [63] [82]
3Prosenjit Bose [27] [37]
4Franz-Josef Brandenburg [43] [70] [75] [78]
5Brona Brejová [33] [56] [58]
6Anna Bretscher [29]
7Jonathan F. Buss [53]
8Eowyn Cenek [32] [46]
9Timothy M. Chan [32] [46] [50] [52] [54] [60] [66] [67]
10Erik D. Demaine [14] [20] [21] [22] [24] [25] [26] [27] [28] [32] [37] [38] [40] [42] [46] [47] [52] [53] [55] [56] [58] [59] [60]
11Martin L. Demaine [14] [20] [21] [22] [24] [25] [26] [32] [38] [40] [46] [47] [52] [53]
12Xiaotie Deng [70]
13Christian A. Duncan [42] [59]
14Stephane Durocher [83]
15Rudolf Fleischer [32] [40] [42] [46] [59] [60]
16Yashar Ganjali [67]
17Burkay Genc [64] [73] [84]
18Mordecai J. Golin [60]
19Alexander Golynski [55]
20Mohammad Taghi Hajiaghayi (MohammadTaghi Hajiaghayi) [53] [67]
21Angèle M. Hamel [56] [58]
22Masud Hasan [51] [62] [80]
23Holger H. Hoos (Holger Hoos) [83]
24Joseph Douglas Horton (Joseph D. Horton) [51] [55] [71]
25Lars Jacobsen [40]
26John R. Johansen [44]
27Goos Kant [1] [2] [7] [13]
28Michael Kaufmann [1] [7] [10] [15]
29James A. King [60]
30Stephen G. Kobourov [42] [59]
31Sylvain Lazard [14] [16] [21] [24] [25] [26] [28] [38] [45] [47]
32Alejandro López-Ortiz [50] [51] [54] [55] [56] [58] [62] [71] [80]
33Shuang Luan (Shuang (Sean) Luan) [83]
34Anna Lubiw [14] [20] [21] [22] [24] [25] [26] [27] [30] [37] [38] [47] [57] [61] [68] [69] [74] [79]
35Brendan Madden [9] [31]
36Joe Marks [18]
37Henk Meijer [29]
38J. Ian Munro [40] [60]
39Petra Mutzel [15]
40Paul Nijjar [52]
41Joseph O'Rourke [14] [20] [21] [24] [25] [26] [38] [47]
42Mark H. Overmars [14] [20] [25] [26] [38]
43Guillaume Poirier [55]
44Claude-Guy Quimper [55]
45Steve Robbins [14] [16] [20] [21] [24] [25] [26] [38] [45] [47]
46Steven M. Robbins [28]
47Kathy Ryall (Kathleen Ryall) [18]
48Jared Saia [83]
49Thomas C. Shermer [8] [23] [44]
50Michael A. Soss [28]
51Michael J. Spriggs [57] [61] [69] [74] [79]
52Michal Stern [85]
53Ileana Streinu [14] [21] [24] [25] [26] [38] [47]
54Julie Sun [30] [68]
55Subhash Suri [16] [45]
56Torsten Thiele [34] [77]
57Ioannis G. Tollis [9] [31]
58Godfried T. Toussaint [14] [21] [22] [24] [25] [26] [38] [47]
59Ryuhei Uehara [52]
60Tomás Vinar [33] [51] [53] [56] [58]
61Ming-wei Wang [32] [46] [52]
62Sue Whitesides [8] [14] [16] [18] [20] [21] [23] [24] [25] [26] [38] [45] [47]
63Dana F. Wilkinson [48] [65]
64Stephen K. Wismath [8] [23]
65David R. Wood [34] [44] [67] [77]
66Maxwell Young [83]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)