基本信息
浏览量:69
职业迁徙
个人简介
Professor Nishimura's research is in the area of algorithms and complexity, with an emphasis on graph algorithms. Her main research interests involve the identification and use of structure in developing algorithms, such as graph algorithms, fixed-parameter algorithms, and algorithms for reconfiguration problems.
Parameterized complexity allows the development of efficient algorithms for various problems which, when considered in full generality, are considered to be intractable. The aim of the parameterized approach is to identify the source of complexity as one or more parameters of the problem, obtaining algorithms that are polynomial in the size of the input but possibly exponential in the parameter(s). In situations in which the parameters are guaranteed to be small in comparison to the size of the input, these techniques yield polynomial-time algorithms. Professor Nishimura's work includes the first parameterized algorithms for graph drawing problems and for backdoor sets for formulas for the satisfiability problem.
Reconfiguration considers the solution space of an instance of a problem, asking, for example, whether it is possible to transform one feasible solution into another in a sequence of reconfiguration steps such that each step results in a feasible solution. Professor Nishimura and her collaborators were the first to consider the parameterized complexity of reconfiguration problems, and continue to explore the two areas both singly and in combination. This work applies to a large range of problem domains, and is part of a long-term project to study algorithms for situations subject to change.
研究兴趣
论文共 76 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
International Conference and Workshops on Algorithms and Computationpp.9-14, (2024)
International Conference and Workshops on Algorithms and Computationpp.212-226, (2024)
Remy El Sabeh, Jessica Bohm, Zhiqian Ding,Stephanie Maaz,Naomi Nishimura,Izzat El Hajj,Amer E. Mouawad,Alexandre Cooper
arxiv(2023)
International Conference and Workshops on Algorithms and Computation (WALCOM) (2022): 263-274
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn