N
Naomi Nishimura
Researcher at University of Waterloo
Publications - 83
Citations - 1975
Naomi Nishimura is an academic researcher from University of Waterloo. The author has contributed to research in topics: Parameterized complexity & Subgraph isomorphism problem. The author has an hindex of 24, co-authored 81 publications receiving 1757 citations. Previous affiliations of Naomi Nishimura include University of Toronto & Goethe University Frankfurt.
Papers
More filters
Journal ArticleDOI
Introduction to Reconfiguration
TL;DR: Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?)
Proceedings Article
Detecting Backdoor Sets with Respect to Horn and Binary Clauses.
TL;DR: It is shown that with respect to both horn and 2-cnf classes, the detection of a strong backdoor set is fixed-parameter tractable (the existence of a set of size k for a formula of length N can be decided in time f(k)NO(1)), but that the detection
Journal ArticleDOI
On Graph Powers for Leaf-Labeled Trees
TL;DR: By discovering hidden combinatorial structure of cliques and neighborhoods, this work has developed polynomial-time algorithms that identify whether or not a given graph G is a k-leaf power of a tree T, and if so, produce aTree T for which G isA k- leaf power.
Journal ArticleDOI
On the Parameterized Complexity of Layered Graph Drawing
Vida Dujmović,Michael R. Fellows,Matthew Kitching,Giuseppe Liotta,Catherine McCartin,Naomi Nishimura,Prabhakar Ragde,Frances A. Rosamond,Sue Whitesides,David R. Wood +9 more
TL;DR: It is proved that graphs admitting crossing-free h-layer drawings (for fixed h) have bounded pathwidth and is extended to solve related problems, including allowing at most k crossings, or removing at most r edges to leave a crossing- free drawing ( for fixed k or r).
Journal ArticleDOI
On the Parameterized Complexity of Reconfiguration Problems
TL;DR: This study is motivated by results establishing that for many NP-hard problems, the classical complexity of reconfiguration is PSPACE-complete, and addresses the question for several important graph properties under two natural parameterizations.