Follow
Therese Biedl
Title
Cited by
Cited by
Year
A better heuristic for orthogonal graph drawings
T Biedl, G Kant
Computational Geometry 9 (3), 159-180, 1998
1631998
A better heuristic for orthogonal graph drawings
T Biedl, G Kant
European Symposium on Algorithms, 24-35, 1994
1301994
Efficient algorithms for Petersen's matching theorem
TC Biedl, P Bose, ED Demaine, A Lubiw
Journal of Algorithms 38 (1), 110-134, 2001
972001
Locked and unlocked polygonal chains in 3D
T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ...
arXiv preprint cs/9910009, 1999
96*1999
Area-efficient static and incremental graph drawings
TC Biedl, M Kaufmann
European Symposium on Algorithms, 37-52, 1997
961997
Tight bounds on maximal and maximum matchings
T Biedl, ED Demaine, CA Duncan, R Fleischer, SG Kobourov
Discrete Mathematics 285 (1-3), 7-15, 2004
952004
Unfolding some classes of orthogonal polyhedra
TBEDM Demainez, A Lubiwzx, MOJOR Steve, RS Whitesidesyxyy
831998
Computing cartograms with optimal complexity
M Alam, T Biedl, S Felsner, M Kaufmann, SG Kobourov, T Ueckerdt
Discrete & Computational Geometry 50 (3), 784-810, 2013
812013
A note on reconfiguring tree linkages: Trees can lock
T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ...
Discrete Applied Mathematics 117 (1-3), 293-297, 2002
672002
Curvature-constrained shortest paths in a convex polygon
PK Agarwal, T Biedl, S Lazard, S Robbins, S Suri, S Whitesides
SIAM Journal on Computing 31 (6), 1814-1851, 2002
622002
On triangulating planar graphs under the four-connectivity constraint
T Biedl, G Kant, M Kaufmann
Algorithmica 19 (4), 427-446, 1997
601997
Balanced vertex-orderings of graphs
T Biedl, T Chan, Y Ganjali, MT Hajiaghayi, DR Wood
Discrete Applied Mathematics 148 (1), 27-48, 2005
542005
Drawing planar partitions II: HH-drawings
T Biedl, M Kaufmann, P Mutzel
International Workshop on Graph-Theoretic Concepts in Computer Science, 124-136, 1998
501998
Curvature-constrained shortest paths in a convex polygon
PK Agarwal, T Biedl, S Lazard, S Robbins, S Suri, S Whitesides
Proceedings of the fourteenth annual symposium on Computational geometry …, 1998
481998
The three-phase method: A unified approach to orthogonal graph drawing
TC Biedl, BP Madden, IG Tollis
International Symposium on Graph Drawing, 391-402, 1997
481997
The complexity of Clickomania
R Fleischer, L Jacobsen, J MUNRO
More Games of No Chance—Combinatorial Games at MSRI, 2000 42, 389-404, 2002
472002
On the complexity of crossings in permutations
T Biedl, FJ Brandenburg, X Deng
Discrete Mathematics 309 (7), 1813-1823, 2009
452009
Optimal arrangement of leaves in the tree representing hierarchical clustering of gene expression data
T Biedl, B Brejová, ED Demaine, AM Hamel, T Vinar
University of Waterloo, Canada, 2001
452001
New lower bounds for orthogonal graph drawings
TC Biedl
International Symposium on Graph Drawing, 28-39, 1995
451995
Crossings and permutations
T Biedl, FJ Brandenburg, X Deng
International Symposium on Graph Drawing, 1-12, 2005
432005
The system can't perform the operation now. Try again later.
Articles 1–20