- Morphing Polyhedra with Parallel Faces: Counterexamples
- Polygons needing many ipturns Therese Biedl
- Bounded-Degree Independent Sets in Planar Graphs
- Drawing Planar Partitions II: HHDrawings Therese Biedl 1 and Michael Kaufmann 2 and Petra Mutzel 3
- Simplifying ow networks Therese Biedl, Bro na Brejov a ? , and Tom a s Vina r ??
- Optimal orthogonal drawings of triconnected plane graphs ?
- Polygons needing many flipturns Therese Biedl #
- Linear reductions of maximum matching Therese Biedl
- Relating Bends and Size in Orthogonal Graph Drawings 1 Therese C. Biedl
- Graph Multidrawing: Finding Nice Drawings Without Defining Nice ?
- Tight Bounds on Maximal and Maximum Matchings
- Heuristics for 3DOrthogonal Graph Drawings Therese C. Biedl \Lambda
- Partitions of Graphs into Trees Therese Biedl and Franz J. Brandenburg
- Hiding Disks in Folded Polygons Therese C. Biedl \Lambda Erik D. Demaine yz Martin L. Demaine y
- A Better Heuristic for Orthogonal Graph Drawings \Lambda Therese Biedl Goos Kant
- Drawing outerplanar graphs in O(n log n) area Therese Biedl
- Drawing outer-planar graphs in O(n log n) area (Extended abstract)
- R u t c o r R e p o r t
- Drawing Planar Partitions I: LLDrawings and LHDrawings Therese C. Biedl \Lambda
- AreaEfficient Static and Incremental Graph Therese C. Biedl 1 Michael Kaufmann 2
- CURVATURE-CONSTRAINED SHORTEST PATHS IN A CONVEX POLYGON PANKAJ K. AGARWAL y , THERESE BIEDL z , SYLVAIN LAZARD x , STEVE ROBBINS { , SUBHASH SURI k , AND
- When Can a Net Fold to a Polyhedron? # Therese Biedl + Anna Lubiw + Julie Sun +
- 10.1007/s0045400100387 Discrete Comput 26:269--281 (2001) Discrete Computational
- When Can a Net Fold to a Polyhedron? \Lambda Therese Biedl y Anna Lubiw y Julie Sun y
- Finding Hidden Independent Sets in Interval Graphs Therese Biedl1
- The University of Sydney Basser Department of Computer Science
- Journal Algorithms 110#134 2001 doi:10.1006#jagm.2000.1132, available online http:##www.idealibrary.com
- When Can A Graph Form An Orthogonal Polyhedron? Therese Biedl # Burkay Genc #
- Unfolding Some Classes of Orthogonal Polyhedra \Lambda Therese Biedl y Erik Demaine zx Martin Demaine z Anna Lubiw zx
- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
- A note on 3D orthogonal graph drawing # Therese Biedl + Timothy M. Chan +
- Large Independent Sets and LowDegree Independent Sets in Planar Graphs in Linear Time
- Balanced kColorings Therese C. Biedl Eowyn
- Angles and Lengths in Recon gurations of Polygons and Polyhedra ?
- Three Approaches to 3DOrthogonal BoxDrawings ?
- Cross-coloring: improving the technique by Kolmogorov and Barzdin
- Three-Dimensional Orthogonal Graph Drawing with Optimal Volume
- Orthogonal Drawings With Few Layers ? Therese Biedl 1;?? , John R. Johansen 1 ,
- On Triangulating Planar Graphs under the FourConnectivity Constraint
- Orthogonal Graph Drawings: Algorithms and Lower Bounds
- Cauchy's Theorem and Edge Lengths of Convex Therese Biedl, Anna Lubiw, and Michael Spriggs
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- Rectangle of Influence Drawings of Graphs without Filled 3Cycles ?
- Optimal orthogonal drawings of connected plane graphs Therese C. Biedl y
- Convexifying Monotone Polygons Therese Biedl
- Cauchy's Theorem and Edge Lengths of Convex Therese Biedl, Anna Lubiw, and Michael Spriggs
- Therese Biedl \Lambda Timothy Chan \Lambda Erik D. Demaine \Lambda Rudolf Fleischer y Mordecai Golin y J. Ian Munro \Lambda
- Tight Bounds on Maximal and Maximum Matchings
- DIMACS Technical Report 9753 September 1997
- Drawing K 2;n : A Lower Bound Therese Biedl y Timothy M. Chan y Alejandro L opez-Ortiz y
- The Complexity of Clickomania Therese C. Biedl y Erik D. Demaine Martin L. Demaine
- Edge-intersection graphs of k-bend paths in grids
- ORTHOGONAL GRAPH VISUALIZATION: THE THREEPHASE METHOD WITH
- International Journal of Computational Geometry & Applications fl World Scientific Publishing Company
- Small poly-line drawings of series-parallel graphs Therese Biedl y
- Linear reductions of maximum matching Therese Biedl
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- The DFS-Heuristic for Orthogonal Graph Drawing ?
- Journal of Graph Algorithms and Applications http://www.cs.brown.edu/publications/jgaa/
- On the Complexity of Crossings in Permutations
- On the Complexity of Crossings in Permutations
- Small drawings of outer-planar graphs, series-parallel graphs and other planar graphs
