Anna Lubiw | Academic Influence

Anna Lubiw's AcademicInfluence.com Rankings

Anna Lubiw

Computer Science

#1811

World Rank

#1878

Historical Rank

Database

#8390

World Rank

#8779

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Anna Lubiw's Degrees

PhD Computer Science University of British Columbia
Masters Computer Science University of British Columbia
Bachelors Mathematics University of British Columbia

Similar Degrees You Can Earn

Why Is Anna Lubiw Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Anna Lubiw is a computer scientist known for her work in computational geometry and graph theory. She is currently a professor at the University of Waterloo. Education Lubiw received her Ph.D from the University of Toronto in 1986 under the joint supervision of Rudolf Mathon and Stephen Cook.

(See a Problem?)

Anna Lubiw's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Pattern Matching for Permutations (1993) (214)
Doubly lexical orderings of matrices (1985) (156)
Some NP-Complete Problems Similar to Graph Isomorphism (1981) (153)
Touring a sequence of polygons (2003) (151)
On Simultaneous Planar Graph Embeddings (2003) (130)
Efficient visibility queries in simple polygons (2002) (97)
Upward planar drawing of single source acyclic digraphs (1991) (92)
Efficient algorithms for Petersen's matching theorem (1999) (79)
Computing homotopic shortest paths efficiently (2002) (79)
Unfolding some classes of orthogonal polyhedra (1998) (77)
Decomposing polygonal regions into convex quadrilaterals (1985) (64)
Folding and Cutting Paper (1998) (59)
Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem (2004) (58)
Flip Distance Between Two Triangulations of a Point Set is NP-complete (2012) (58)
A Visibility Representation for Graphs in Three Dimensions (1998) (56)
Locked and unlocked polygonal chains in 3D (1998) (55)
The Floodlight Problem (1997) (54)
Folding and unfolding (2002) (52)
When Can a Polygon Fold to a Polytope (1999) (46)
Noncrossing Subgraphs in Topological Layouts (1991) (44)
Locked and Unlocked Polygonal Chains in Three Dimensions (1999) (44)
Distance visibility graphs (1991) (43)
Morphing orthogonal planar graph drawings (2013) (43)
Testing Simultaneous Planarity when the Common Graph is 2-Connected (2010) (43)
The rectangle of influence drawability problem (1996) (41)
Counterexample to a Conjecture of Szymanski on Hypercube Routing (1990) (37)
Algorithms for Solving Rubik's Cubes (2011) (36)
How to Morph Planar Graph Drawings (2016) (34)
A note on reconfiguring tree linkages: trees can lock (2002) (33)
Folding and one straight cut suffice (1999) (32)
The Complexity of Drawing a Graph in a Polygonal Region (2018) (32)
Self-approaching Graphs (2012) (32)
Shortest paths avoiding forbidden subpaths (2008) (31)
The Boolean Basis Problem and How to Cover Some Polygons by Rectangles (1990) (31)
Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs (1993) (30)
Enumerating Foldings and Unfoldings Between Polygons and Polytopes (2001) (29)
Drawing Partially Embedded and Simultaneously Planar Graphs (2014) (29)
Morphing Planar Graph Drawings with a Polynomial Number of Steps (2013) (28)
When can a net fold to a polyhedron (2005) (28)
A weighted min-max relation for intervals (1990) (28)
Semantic Word Cloud Representations: Hardness and Approximation Algorithms (2013) (27)
Zipper unfoldings of polyhedral complexes (2010) (25)
Smart-Grid Electricity Allocation via Strip Packing with Slicing (2013) (24)
Simultaneous Interval Graphs (2010) (24)
The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs (2009) (22)
Morphing Planar Graphs While Preserving Edge Directions (2005) (21)
On reconfiguring tree linkages: Trees can lock (1999) (21)
Visibility Graphs of Towers (1997) (20)
On the Planar Split Thickness of Graphs (2015) (19)
Coverage with k-transmitters in the presence of obstacles (2010) (19)
Polyhedral Sculptures with Hyperbolic Paraboloids (1999) (19)
Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition (2016) (19)
Recognizing Rectangle of Influence Drawable Graphs (1994) (18)
Dominating cliques in chordal graphs (1994) (18)
Metamorphosis of the cube (1999) (18)
Shortest Descending Paths through Given Faces (2009) (18)
Convexifying Polygons Without Losing Visibilities (2011) (18)
Elastic Labels: the Two-Axis Case (1997) (18)
A Lower Bound for the Integer Element Distinctness Problem (1991) (17)
Orderings and some combinatorial optimization problems with geometric applications (1986) (17)
Morphing Planar Graph Drawings with Bent Edges (2008) (17)
Optimal Morphs of Convex Drawings (2015) (17)
Approximation algorithms for shortest descending paths in terrains (2008) (16)
Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations (2013) (16)
Morphing Schnyder Drawings of Planar Triangulations (2014) (15)
Flipping edge-labelled triangulations (2013) (15)
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations (2017) (15)
Elastic labels around the perimeter of a map (1999) (14)
Continuously Flattening Polyhedra Using Straight Skeletons (2014) (14)
Modelling gateway placement in wireless networks: geometric k-centres of unit disc graphs (2008) (14)
Short-chorded and perfect graphs (1991) (14)
Convergents of folded continued fractions (1996) (14)
Large Angle Crossing Drawings of Planar Graphs in Subquadratic Area (2011) (13)
Morphing Planar Graph Drawings with Unidirectional Moves (2014) (13)
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes (2000) (12)
Embedding problems for paths with direction constrained edges (2000) (11)
Flat Foldings of Plane Graphs with Prescribed Angles and Edge Lengths (2014) (10)
A note on odd/even cycles (1988) (10)
Algorithms for Designing Pop-Up Cards (2013) (9)
Shortest Descending Paths: towards an Exact Algorithm (2011) (9)
Shortest Paths and Convex Hulls in 2D Complexes with Non-Positive Curvature (2016) (9)
Angle-monotone Paths in Non-obtuse Triangulations (2017) (9)
The Shape of Orthogonal Cycles in Three Dimensions (2012) (8)
Convexity-Increasing Morphs of Planar Graphs (2018) (8)
Recovery of Convex Hulls From External Visibility Graphs (1993) (8)
Hiding disks in folded polygons (1998) (8)
Minimum Ply Covering of Points with Disks and Squares (2019) (7)
Orthogonal Drawings of Cycles in 3D Space (Extended Abstract) (2000) (7)
A Lower Bound on the Area of a 3-Coloured Disc Packing (2008) (7)
Folding a paper strip to minimize thickness (2014) (7)
Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges (2017) (6)
Morphing Planar Graph Drawings (2007) (6)
Construction and Local Routing for Angle-Monotone Graphs (2018) (6)
Recognition and Drawing of Stick Graphs (2018) (6)
Parallel morphing of trees and cycles (2003) (6)
Shortest Gently Descending Paths (2009) (6)
Rigid flattening of polyhedra with slits (2015) (6)
Refold rigidity of convex polyhedra (2013) (6)
An Approximation Algorithm for Shortest Descending Paths (2007) (6)
Reconfiguring Undirected Paths (2019) (6)
Visibility Graphs, Dismantlability, and the Cops and Robbers Game (2016) (6)
Cauchy's Theorem and Edge Lengths of Convex Polyhedra (2007) (5)
Rollercoasters: Long Sequences without Short Runs (2019) (5)
Angles and Lengths in Reconfigurations of Polygons and Polyhedra (2004) (5)
Fractional Coverings, Greedy Coverings, and Rectifier Networks (2015) (5)
Partitioning Orthogonal Histograms into Rectangular Boxes (2018) (5)
A Generalization of the Source Unfolding of Convex Polyhedra (2011) (5)
Upward Planning of Single-Source Acyclic Digraphs (1996) (4)
On Compatible Triangulations with a Minimum Number of Steiner Points (2017) (4)
Building a larger class of graphs for efficient reconfiguration of vertex colouring (2020) (4)
Optimal Schedules for 2-guard Room Search (2007) (4)
Bounded-Angle Minimum Spanning Trees (2021) (4)
Graph Drawing and Network Visualization (2015) (4)
Angle-Monotone Graphs: Construction and Local Routing (2018) (4)
Minimum shared‐power edge cut (2018) (4)
Hardness of Token Swapping on Trees (2021) (4)
Universal Hinge Patterns for Folding Strips Efficiently into Any Grid Polyhedron (2016) (4)
Equiprojective Polyhedra (2008) (4)
A Set of Programs for MOS Design (1981) (3)
Reconfiguring Ordered Bases of a Matroid (2016) (3)
Bounded-degree polyhedronization of point sets (2010) (3)
Token Swapping on Trees (2019) (3)
Star Unfolding from a Geodesic Curve (2016) (2)
A tale of two communities : assessing homophily in node-link diagrams (2015) (2)
Dispersion for Intervals: A Geometric Approach (2021) (2)
Compatible Paths on Labelled Point Sets (2020) (2)
Morphing Schnyder Drawings of Planar Triangulations (2018) (2)
On the Planar Split Thickness of Graphs (2017) (1)
Rectangle-of-influence triangulations (2016) (1)
Morphing orthogonal planar graph drawings (2006) (1)
Computation and Reconfiguration in Low-Dimensional Topological Spaces (Dagstuhl Seminar 22062) (2022) (1)
Revised Selected Papers of the 23rd International Symposium on Graph Drawing and Network Visualization - Volume 9411 (2015) (1)
Face flips in origami tessellations (2019) (1)
Computation in Low-Dimensional Geometry and Topology (Dagstuhl Seminar 19352) (2019) (1)
Bounded-Angle Minimum Spanning Trees (2021) (1)
Quasi-Twisting Convex Polyhedra (2022) (1)
The Rectangle of In uence Drawability Problem (1997) (1)
Forbidding Edges between Points in the Plane to Disconnect the Triangulation Flip Graph (2022) (1)
Reprint of: Refold rigidity of convex polyhedra (2014) (1)
Interval Graphs as Visibility Graphs of Simple Polygons Part 1: Parachutes (1994) (1)
Reconfiguration of Non-crossing Spanning Trees (2022) (1)
The Simultaneous Membership Problem for Chordal, Comparability and Permutation graphs (2008) (1)
Strip Packing with Slicing (2012) (1)
Maximum Matchings and Minimum Blocking Sets in Θ6-Graphs (2019) (1)
Star Unfolding from a Geodesic Curve (2016) (1)
A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations (2018) (1)
Elastic Labels on the Perimeter of a Rectangle (1998) (1)
Morphing polyhedra with parallel faces: Counterexamples (2009) (1)
Turning Orthogonally Convex Polyhedra into Orthoballs (2014) (1)
Universality Results for Pop-Ups (2011) (1)
Rollercoasters and Caterpillars (2018) (1)
The Visibility Center of a Simple Polygon (2021) (1)
Msn-support Help (2001) (0)
The geodesic edge center of a simple polygon (2023) (0)
Correction to: Algorithms and Data Structures (2022) (0)
Guest Editors’ Foreword (2017) (0)
The cccg 2001 logo (2001) (0)
Covering Folded Shapes (2014) (0)
MIT Open Access Articles Reconfiguring Undirected Paths (2022) (0)
C G ] 8 O ct 1 99 9 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl (2008) (0)
Guest Editors’ Foreword (2017) (0)
Distant Representatives for Rectangles in the Plane (2021) (0)
C G ] 2 9 Se p 20 00 On Reconfiguring Tree Linkages : Trees can Lock (2019) (0)
Title : How to Morph Planar Graph Drawings (2018) (0)
Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors (2016) (0)
Coverage with k-transmitters in the presence of obstacles (2012) (0)
Graph drawing and network visualization : 23rd international symposium, GD 2015, Los Angeles, CA, USA, September 24-26, 2015 : revised selected papers (2015) (0)
Algorithms and Data Structures (2013) (0)
Towards characterizing graphs with a sliceable rectangular dual (2015) (0)
Some Counterexamples for Compatible Triangulations (2016) (0)
Preface (1968) (0)
Efficient Representation and Encoding of Distributive Lattices by Corwin Sinnamon (2018) (0)
Maximum Matchings and Minimum Blocking Sets in \varTheta _6 -Graphs (2019) (0)
The Rectangle of Influence Drawabillty Problem 6 (0)
When Can a PolygonFold to a Polytope ? (1996) (0)
Computation in Low-Dimensional Geometry and Topology (2019) (0)
Reconfiguring a Chain of Cubes (2015) (0)
The Rectangle of Innuence Drawability Problem the Rectangle of Innuence Drawability Problem (1996) (0)
C G ] 11 N ov 1 99 8 Locked and Unlocked Polygonal Chains in 3 D ∗ T . Biedl (2008) (0)
Local Overlaps in Unfoldings of Polyhedra (2016) (0)
Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021) (2023) (0)
Computing Realistic Terrains from Imprecise Elevations (2022) (0)
Morphing Polyhedra Preserving Face Normals: A Counterexample (2005) (0)
The Shape of Orthogonal Cycles in Three Dimensions (2011) (0)
08191 Working Group Report - Visualization of Trajectories (2008) (0)
LIPIcs, Volume 51, SoCG'16, Complete Volume (2016) (0)
Dihedral angles and orthogonal polyhedra (2013) (0)
The Steiner Ratio for Obstacle-Avoiding Rectilinear Steiner Trees (2008) (0)
Continuously Flattening Polyhedra Using Straight Skeletons Citation (2014) (0)
Reconstructing a Polyhedron between Polygons in Parallel Slices (2020) (0)
Local Overlaps in Unfoldings of Polyhedra Abstract (2005) (0)

This paper list is powered by the following services:

Other Resources About Anna Lubiw

en.wikipedia.org

What Schools Are Affiliated With Anna Lubiw?

Anna Lubiw is affiliated with the following schools: