#### Filter Results:

- Full text PDF available (74)

#### Publication Year

1994

2019

- This year (14)
- Last 5 years (63)
- Last 10 years (112)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Torben Hagerup, James Haralambides, +7 authors Therese C. Biedl
- 1996

32 that a canonical ordering or a 4-connected triangular planar graph is possible, in which every vertex v k has out(v k) 2, which decreases the width of a visibility representation by a factor 2.… (More)

- Therese C. Biedl, Goos Kant
- ESA
- 1994

16 We end this paper by mentioning some open problems and directions for further research: Valiant proved that a grid-area of (n 2) is necessary for drawing non-planar graphs, since the crossing… (More)

- Therese C. Biedl, Martin L. Demaine, Christian A. Duncan, Rudolf Fleischer, Stephen G. Kobourov
- Discrete Mathematics
- 2004

- Therese C. Biedl, Michal Stern
- COCOON
- 2009

Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid paths share a grid… (More)

- Therese C. Biedl, Anna Bretscher, Henk Meijer
- Graph Drawing
- 1999

- Therese C. Biedl, Thomas C. Shermer, Sue Whitesides, Stephen K. Wismath
- J. Graph Algorithms Appl.
- 1999

This paper studies 3-D orthogonal grid drawings for graphs of arbitrary degree, in particular Kn, with vertices drawn as boxes. It establishes asymptotic lower bounds for the volume of the bounding… (More)

We investigate weighted straight skeletons from a geometric, graph-theoretical, and combinatorial point of view. We start with a thorough definition and shed light on some ambiguity issues in the… (More)

In this paper, we study how to present gene expression data to display similarities by trying to find a linear ordering of genes such that genes with similar expression profiles will be close in this… (More)

- Muhammad Jawaherul Alam, Therese C. Biedl, Stefan Felsner, Michael Kaufmann, Stephen G. Kobourov, Torsten Ueckerdt
- Discrete & Computational Geometry
- 2013

- Therese C. Biedl, Giuseppe Liotta, Fabrizio Montecchiani
- Symposium on Computational Geometry
- 2015

A rectangle visibility representation (RVR) of a graph consists of an assignment of axis-aligned rectangles to vertices such that for every edge there exists a horizontal or vertical line of sight… (More)