Therese Biedl
Therese Biedl
確認したメール アドレス: cs.uwaterloo.ca
タイトル
引用先
引用先
A better heuristic for orthogonal graph drawings
T Biedl, G Kant
Computational Geometry 9 (3), 159-180, 1998
1411998
A better heuristic for orthogonal graph drawings
T Biedl, G Kant
European Symposium on Algorithms, 24-35, 1994
1251994
Area-efficient static and incremental graph drawings
TC Biedl, M Kaufmann
European Symposium on Algorithms, 37-52, 1997
971997
Efficient algorithms for Petersen's matching theorem
TC Biedl, P Bose, ED Demaine, A Lubiw
Journal of Algorithms 38 (1), 110-134, 2001
902001
Unfolding some classes of orthogonal polyhedra
TBEDM Demainez, A Lubiwzx, MOJOR Steve, RS Whitesidesyxyy
771998
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
752004
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
662002
Computing cartograms with optimal complexity
MJ Alam, T Biedl, S Felsner, M Kaufmann, SG Kobourov, T Ueckerdt
Discrete & Computational Geometry 50 (3), 784-810, 2013
652013
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
582002
On triangulating planar graphs under the four-connectivity constraint
T Biedl, G Kant, M Kaufmann
Algorithmica 19 (4), 427-446, 1997
521997
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
511999
Locked and unlocked polygonal chains in three dimensions
T Biedl, E Demaine, M Demaine, S Lazard, A Lubiw, J O'Rourke, ...
Discrete & Computational Geometry 26 (3), 269-281, 2001
502001
Balanced vertex-orderings of graphs
T Biedl, T Chan, Y Ganjali, MT Hajiaghayi, DR Wood
Discrete Applied Mathematics 148 (1), 27-48, 2005
482005
The complexity of Clickomania
TC Biedl, ED Demaine, ML Demaine, R Fleischer, L Jacobsen, JI Munro
More games of no chance 42, 389-404, 2002
462002
Drawing planar partitions II: HH-drawings
T Biedl, M Kaufmann, P Mutzel
International Workshop on Graph-Theoretic Concepts in Computer Science, 124-136, 1998
461998
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
461998
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
451997
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
432001
The complexity of base station positioning in cellular networks
C Glaßer, S Reith, H Vollmer
Discrete Applied Mathematics 148 (1), 1-12, 2005
412005
Bounds for orthogonal 3-D graph drawing
T Biedl, T Shermer, S Whitesides, S Wismath
Graph Algorithms And Applications I, 375-391, 2002
402002
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20