基本信息
浏览量:217
职业迁徙
个人简介
Professor Lubiw's research is in the area of algorithms, specifically computational geometry and graph algorithms.
One main focus is finding and manipulating geometric representations of graphs (social networks, database hierarchies, the internet, chemical molecular structures). Currently she works on morphing graph drawings, and on finding "simultaneous" representations of graphs that share some vertices and edges, with the constraint that the shared part be represented consistently.
In a more geometric vein, Professor Lubiw has worked on folding and unfolding problems, for example finding the extra folds that are needed to flatten polyhedra (e.g., the creases that form on cereal boxes when you squash them for recycling).
She has worked on shortest path problems both in the geometric setting and in graphs. One example is
finding shortest paths on terrains, such as the earth's surface, while observing height constraints, such as going downhill but not too steeply. Another example is finding shortest paths in graphs when some subpaths are forbidden but the forbidden set is not known in advance, which has applications in optical network routing and vehicle dispatching.
Professor Lubiw has also worked on such fun topics as map labelling, the Rubik's cube, music pattern matching, and design of pop-up cards.
研究兴趣
论文共 103 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn