The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Therese C. Biedl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  82. Edge-Intersection Graphs of k-Bend Paths in Grids. [Citation Graph (, )][DBLP]


  83. Cauchy's Theorem for Orthogonal Polyhedra of Genus 0. [Citation Graph (, )][DBLP]


  84. Reconstructing Convex Polygons and Polyhedra from Edge and Face Counts in Orthogonal Projections. [Citation Graph (, )][DBLP]


  85. Small Drawings of Series-Parallel Graphs and Other Subclasses of Planar Graphs. [Citation Graph (, )][DBLP]


  86. Drawing Planar 3-Trees with Given Face-Areas. [Citation Graph (, )][DBLP]


  87. Reconstructing Polygons from Scanner Data. [Citation Graph (, )][DBLP]


  88. Morphing polyhedra with parallel faces: Counterexamples. [Citation Graph (, )][DBLP]


  89. Fixed-Parameter Tractability and Improved Approximations for Segment Minimization [Citation Graph (, )][DBLP]


  90. Sorting with networks of data structures. [Citation Graph (, )][DBLP]


  91. On the complexity of crossings in permutations. [Citation Graph (, )][DBLP]


Search in 0.029secs, Finished in 0.031secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002