World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
30
Citations
4198
World Ranking
3497
National Ranking
143

Research.com Recognitions

  • 2009 - ACM Distinguished Member

Overview

Anna Lubiw is affiliated with the University of Waterloo in Canada and has focused their research primarily in the fields of Computer Science and Engineering. Their work spans a variety of subfields including Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Computer Networks and Communications, and Signal Processing.

The main topics of their research include:

  • Computational Geometry and Mesh Generation
  • Advanced Graph Theory Research
  • Data Management and Algorithms
  • Computer Graphics and Visualization Techniques
  • Digital Image Processing Techniques
  • Genome Rearrangement Algorithms
  • Optimization and Search Problems

Lubiw's recent publications demonstrate a focus on graph algorithms, geometry, and computation, with papers such as:

  • "The Complexity of Drawing a Graph in a Polygonal Region", 2022, Journal of Graph Algorithms and Applications
  • "Shortest paths and convex hulls in 2D complexes with non-positive curvature", 2020, Computational Geometry

Co-authorship collaborations form a significant part of their work. Frequent collaborators include:

  • Thérèse Biedl
  • Anurag Murty Naredla
  • Debajyoti Mondal
  • Ahmad Biniaz
  • Erik D. Demaine

Lubiw has published in several venues, with multiple contributions to:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Computational Geometry
  • Algorithmica
  • Journal of Graph Algorithms and Applications

In addition to articles, Lubiw has published a book titled Algorithms and Data Structures (2021) under Springer Science+Business Media, which has garnered significant citations.

Recognition of Lubiw's standing in the field includes receiving the ACM Distinguished Member award in 2009.

Best Publications

  • Pattern matching for permutations

    Prosenjit Bose;Jonathan F. Buss;Anna Lubiw

  • Doubly lexical orderings of matrices

    Anna Lubiw

  • Some NP-Complete Problems Similar to Graph Isomorphism

    Anna Lubiw

  • Touring a sequence of polygons

    Moshe Dror;Alon Efrat;Anna Lubiw;Joseph S. B. Mitchell

  • On simultaneous planar graph embeddings

    Peter Brass;Eowyn Cenek;Cristian A. Duncan;Alon Efrat

  • The floodlight problem

    Prosenjit Bose;Leonidas J. Guibas;Anna Lubiw;Mark H. Overmars

  • Efficient visibility queries in simple polygons

    Prosenjit Bose;Anna Lubiw;J. Ian Munro

  • Upward Planar Drawing of Single-Source AcyclicDigraphs

    Michael D. Hutton;Anna Lubiw

  • Efficient algorithms for Petersen's matching theorem

    Therese C. Biedl;Prosenjit Bose;Erik D. Demaine;Anna Lubiw

  • Locked and Unlocked Polygonal Chains in Three Dimensions

    T. Biedl;E. Demaine;M. Demaine;S. Lazard

  • Folding and Cutting Paper

    Erik D. Demaine;Martin L. Demaine;Anna Lubiw

  • Decomposing polygonal regions into convex quadrilaterals

    Anna Lubiw

  • Unfolding some classes of orthogonal polyhedra.

    Therese C. Biedl;Erik D. Demaine;Martin L. Demaine;Anna Lubiw

  • A Visibility Representation for Graphs in Three Dimensions

    Prosenjit Bose;Hazel Everett;P. Fekete;Michael E. Houle

  • A note on reconfiguring tree linkages: trees can lock ☆

    Therese C. Biedl;Erik D. Demaine;Martin L. Demaine;Sylvain Lazard

  • DISTANCE VISIBILITY GRAPHS

    Collette R. Coullard;Anna Lubiw

  • Computing homotopic shortest paths efficiently

    Alon Efrat;Stephen G. Kobourov;Anna Lubiw

  • Pattern Matching in Polyphonic Music as a Weighted Geometric Translation Problem.

    Anna Lubiw;Luke Tanur

  • Noncrossing subgraphs in topological layouts

    Jan Kratochvíl;Anna Lubiw;Jaroslav Nešetřil

  • Folding and unfolding

    Anna Lubiw;Ian Munro;Erik D. Demaine

  • Flip distance between two triangulations of a point set is NP-complete

    Anna Lubiw;Vinayak Pathak

  • Coverage with k-transmitters in the presence of obstacles

    Brad Ballinger;Nadia Benbernou;Prosenjit Bose;Mirela Damian

Frequent Co-Authors

Sue Whitesides
Sue Whitesides University of Victoria
Joseph O'Rourke
Joseph O'Rourke Smith College
Stephen G. Kobourov
Stephen G. Kobourov University of Arizona
Prosenjit Bose
Prosenjit Bose Carleton University
Timothy M. Chan
Timothy M. Chan University of Illinois at Urbana-Champaign
David Eppstein
David Eppstein University of California, Irvine
Godfried T. Toussaint
Godfried T. Toussaint New York University Abu Dhabi
Giuseppe Di Battista
Giuseppe Di Battista Roma Tre University
Alon Efrat
Alon Efrat University of Arizona

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, expanding skill sets through related online degrees can open diverse career pathways. Many graduates explore an online MBA accepting transfer credits, allowing them to leverage their mathematical background while gaining valuable business acumen.

Additionally, pursuing a data analytics masters is a natural extension for math students interested in big data and informed decision-making roles across industries like finance and technology.

For those concerned about admission competitiveness or flexibility, investigating easy MBA programs to get into can provide a practical route to graduate-level qualifications without lengthy application hurdles.

Moreover, opting for an easiest online MBA program can offer the convenience of remote study with streamlined coursework, ideal for working professionals balancing education and career advancement.

Best Scientists Citing Anna Lubiw

Trending Scientists