フォロー
Anna Lubiw
Anna Lubiw
Professor, David R. Cheriton School of Computer Science, University of Waterloo
確認したメール アドレス: uwaterloo.ca - ホームページ
タイトル
引用先
引用先
Pattern matching for permutations
P Bose, JF Buss, A Lubiw
Information Processing Letters 65 (5), 277-283, 1998
292*1998
Doubly lexical orderings of matrices
A Lubiw
Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985
2241985
Some NP-complete problems similar to graph isomorphism
A Lubiw
SIAM Journal on Computing 10 (1), 11-21, 1981
2201981
Touring a sequence of polygons
M Dror, A Efrat, A Lubiw, JSB Mitchell
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
2082003
On simultaneous planar graph embeddings
P Brass, E Cenek, CA Duncan, A Efrat, C Erten, DP Ismailescu, ...
Computational Geometry 36 (2), 117-130, 2007
174*2007
Upward planar drawing of single-source acyclic digraphs
MD Hutton, A Lubiw
SIAM Journal on Computing 25, 291, 1996
1321996
Efficient visibility queries in simple polygons
P Bose, A Lubiw, JI Munro
Computational Geometry 23 (3), 313-335, 2002
1242002
Efficient algorithms for Petersen's matching theorem
TC Biedl, P Bose, ED Demaine, A Lubiw
Journal of Algorithms 38 (1), 110-134, 2001
1132001
Computing homotopic shortest paths efficiently
A Efrat, SG Kobourov, A Lubiw
Computational Geometry 35 (3), 162-172, 2006
102*2006
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
1022001
Decomposing polygonal regions into convex quadrilaterals
A Lubiw
Proceedings of the first annual symposium on Computational geometry, 97-106, 1985
1011985
Unfolding some classes of orthogonal polyhedra
T Biedl, E Demaine, M Demaine, A Lubiw, M Overmars, S Robbins, ...
93*1998
Folding and cutting paper
ED Demaine, ML Demaine, A Lubiw
Discrete and Computational Geometry: Japanese Conference, JCDCG’98 Tokyo …, 2000
812000
Г-free matrices
A Lubiw
Master's Thesis, Faculty of Mathematics, University of Waterloo, Ontario, Canada, 1982
81*1982
Computing the Flip-Distance Between Two Triangulations of a Point-Set is NP-complete
A Lubiw, V Pathak
80*2012
The floodlight problem
F Bose, L Guibas, A Lubiw, M Overmars, D Souvaine, J Urrutia
801994
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem.
A Lubiw, L Tanur
ISMIR, 2004
742004
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
712002
Noncrossing subgraphs in topological layouts
J Kratochvíl, A Lubiw, J Nešetřil
SIAM Journal on Discrete Mathematics 4 (2), 223-244, 1991
711991
A visibility representation for graphs in three dimensions
P Bose, H Everett, SP Fekete, ME Houle, A Lubiw, H Meijer, K Romanik, ...
Graph Algorithms And Applications I, 103-118, 2002
662002
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20