Complexity Issues in Tree-Based Version Control. - Naomi Nishimura (WADS, 1989)

Asynchronous Shared Memory Parallel Computation. - Naomi Nishimura (SPAA, 1990)

Asynchronous shared memory parallel computation (preliminary version). - Naomi Nishimura (SIGARCH Comput. Archit. News, 1991)

Asynchrony in shared memory parallel computation. - Naomi Nishimura (1991)

The Parallel Complexity of Tree Embedding Problems (Extended Abstract). - Arvind Gupta; Naomi Nishimura (STACS, 1992)

Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. - Arvind Gupta; Naomi Nishimura (SWAT, 1994)

A Model for Asynchronous Shared Memory Parallel Computation. - Naomi Nishimura (SIAM J. Comput., 1994)

Restricted CRCW PRAM. - Naomi Nishimura (Theor. Comput. Sci., 1994)

finding Smallest Supertrees. - Arvind Gupta; Naomi Nishimura (ISAAC, 1995)

Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. - Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde (SODA, 1995)

Finding Largest Common Embeddable Subtrees. - Arvind Gupta; Naomi Nishimura (STACS, 1995)

The Parallel Complexity of Tree Embedding Problems. - Arvind Gupta; Naomi Nishimura (J. Algorithms, 1995)

Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms. - Naomi Nishimura (J. Comput. Syst. Sci., 1995)

Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. - Peter A. Buhr; Anil K. Goel; Naomi Nishimura; Prabhakar Ragde (ICDE, 1996)

µDatabase: Parallelism in a Memory-Mapped Environment. - Peter A. Buhr; Anil K. Goel; Naomi Nishimura; Prabhakar Ragde (SPAA, 1996)

Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. - Arvind Gupta; Naomi Nishimura (STACS, 1996)

Pointers versus Arithmetic in PRAMs. - Patrick W. Dymond; Faith E. Fich; Naomi Nishimura; Prabhakar Ragde; Walter L. Ruzzo (J. Comput. Syst. Sci., 1996)

The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. - Arvind Gupta; Naomi Nishimura (Theor. Comput. Sci., 1996)

Finding Largest Subtrees and Smallest Supertrees. - Arvind Gupta; Naomi Nishimura (Algorithmica, 1998)

Interval Routing on k-Trees. - Lata Narayanan; Naomi Nishimura (J. Algorithms, 1998)

Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. - Torben Hagerup; Jyrki Katajainen; Naomi Nishimura; Prabhakar Ragde (J. Comput. Syst. Sci., 1998)

Finding Smallest Supertrees Under Minor Containment. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (Int. J. Found. Comput. Sci., 2000)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (ESA, 2001)

A Fixed-Parameter Approach to Two-Layer Planarization. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (GD, 2001)

Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. - Mohammad Taghi Hajiaghayi; Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (Electron. Notes Discret. Math., 2001)

On Graph Powers for Leaf-Labeled Trees. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (J. Algorithms, 2002)

On the parameterized complexity of the generalized rush hour puzzle. - Henning Fernau; Torben Hagerup; Naomi Nishimura; Prabhakar Ragde; Klaus Reinhardt (CCCG, 2003)

Smaller Kernels for Hitting Set Problems of Constant Arity. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (IWPEC, 2004)

Detecting Backdoor Sets with Respect to Horn and Binary Clauses. - Naomi Nishimura; Prabhakar Ragde; Stefan Szeider (SAT, 2004)

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. - Erik D. Demaine; Mohammad Taghi Hajiaghayi; Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (J. Comput. Syst. Sci., 2004)

Parameterized Counting Algorithms for General Graph Covering Problems. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (WADS, 2005)

Embeddings of k-connected graphs of pathwidth k. - Arvind Gupta; Naomi Nishimura; Andrzej Proskurowski; Prabhakar Ragde (Discret. Appl. Math., 2005)

Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. - Naomi Nishimura; Prabhakar Ragde; Dimitrios M. Thilikos (Discret. Appl. Math., 2005)

A Fixed-Parameter Approach to 2-Layer Planarization. - Vida Dujmovic; Michael R. Fellows; Michael T. Hallett; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Matthew Suderman; Sue Whitesides; David R. Wood (Algorithmica, 2006)

Solving #SAT using vertex covers. - Naomi Nishimura; Prabhakar Ragde; Stefan Szeider (Acta Informatica, 2007)

Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. - MohammadTaghi Hajiaghayi; Naomi Nishimura (J. Comput. Syst. Sci., 2007)

On the Parameterized Complexity of Layered Graph Drawing. - Vida Dujmovic; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine McCartin; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Sue Whitesides; David R. Wood (Algorithmica, 2008)

Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. - Michael R. Fellows; Christian Knauer; Naomi Nishimura; Prabhakar Ragde; Frances A. Rosamond; Ulrike Stege; Dimitrios M. Thilikos; Sue Whitesides (Algorithmica, 2008)

Enumerating Neighbour and Closest Strings. - Naomi Nishimura; Narges Simjour (IPEC, 2012)

Finding an induced path of given parity in planar graphs in polynomial time. - Marcin Kaminski 001; Naomi Nishimura (SODA, 2012)

Parameterized Enumeration of (Locally-) Optimal Aggregations. - Naomi Nishimura; Narges Simjour (WADS, 2013)

An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. - Faisal N. Abu-Khzam; Khuzaima Daudjee; Amer E. Mouawad; Naomi Nishimura (CoRR, 2013)

Vertex Cover Reconfiguration and Beyond. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001 (ISAAC, 2014)

The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. - Paul S. Bonsma; Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001 (IPEC, 2014)

Reconfiguration over Tree Decompositions. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Marcin Wrochna (IPEC, 2014)

Computing Weak Consistency in Polynomial Time: [Extended Abstract]. - Wojciech M. Golab; Xiaozhou (Steve) Li; Alejandro López-Ortiz; Naomi Nishimura (PODC, 2015)

On scalable parallel recursive backtracking. - Faisal N. Abu-Khzam; Khuzaima Daudjee; Amer E. Mouawad; Naomi Nishimura (J. Parallel Distributed Comput., 2015)

Reconfiguration of dominating sets. - Akira Suzuki 001; Amer E. Mouawad; Naomi Nishimura (J. Comb. Optim., 2016)

The complexity of dominating set reconfiguration. - Arash Haddadan; Takehiro Ito; Amer E. Mouawad; Naomi Nishimura; Hirotaka Ono 001; Akira Suzuki 001; Youcef Tebbal (Theor. Comput. Sci., 2016)

Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. - Naomi Nishimura; Vijay Subramanya (COCOA (2), 2017)

On the Parameterized Complexity of Reconfiguration Problems. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Narges Simjour; Akira Suzuki 001 (Algorithmica, 2017)

Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. - Amer E. Mouawad; Naomi Nishimura; Vinayak Pathak; Venkatesh Raman 001 (SIAM J. Discret. Math., 2017)

Reconfiguration of Graph Minors. - Benjamin R. Moore; Naomi Nishimura; Vijay Subramanya (MFCS, 2018)

Vertex Cover Reconfiguration and Beyond. - Amer E. Mouawad; Naomi Nishimura; Venkatesh Raman 001; Sebastian Siebertz (Algorithms, 2018)

Introduction to Reconfiguration. - Naomi Nishimura (Algorithms, 2018)

Incremental Optimization of Independent Sets under Reachability Constraints. - Takehiro Ito; Haruka Mizuta; Naomi Nishimura; Akira Suzuki 001 (CoRR, 2018)

Computing k-Atomicity in Polynomial Time. - Wojciech M. Golab; Xiaozhou (Steve) Li; Alejandro López-Ortiz; Naomi Nishimura (SIAM J. Comput., 2018)

On directed covering and domination problems. - Tesshu Hanaka; Naomi Nishimura; Hirotaka Ono 001 (Discret. Appl. Math., 2019)

Reconfiguring spanning and induced subgraphs. - Tesshu Hanaka; Takehiro Ito; Haruka Mizuta; Benjamin R. Moore; Naomi Nishimura; Vijay Subramanya; Akira Suzuki 001; Krishna Vaidyanathan (Theor. Comput. Sci., 2020)

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. - Nicolas Bousquet 001; Amer E. Mouawad; Naomi Nishimura; Sebastian Siebertz (CoRR, 2022)

Incremental optimization of independent sets under the reconfiguration framework. - Takehiro Ito; Haruka Mizuta; Naomi Nishimura; Akira Suzuki 001 (J. Comb. Optim., 2022)

Kernelization Complexity of Solution Discovery Problems. - Mario Grobler; Stephanie Maaz; Amer E. Mouawad; Naomi Nishimura; Vijayaragunathan Ramamoorthi; Sebastian Siebertz (ISAAC, 2024)

Reconfiguration of Multisets with Applications to Bin Packing. - Jeffrey Kam; Shahin Kamali; Avery Miller; Naomi Nishimura (WALCOM, 2024)

Reasons to Fall (More) in Love with Combinatorial Reconfiguration. - Naomi Nishimura (WALCOM, 2024)

A survey on the parameterized complexity of reconfiguration problems. - Nicolas Bousquet 001; Amer E. Mouawad; Naomi Nishimura; Sebastian Siebertz (Comput. Sci. Rev., 2024)

Parameterized Complexity of Reconfiguration of Atoms. - Alexandre Cooper; Stephanie Maaz; Amer E. Mouawad; Naomi Nishimura (Algorithmica, 2024)