Naomi Nishimura

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 30

Top Topics

Tree Decompositions

Boolean Formula

Top Venues

Publications

Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura
Reconfiguration of Multisets with Applications to Bin Packing. WALCOM (2024)
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz
A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53 (2024)
Naomi Nishimura
Reasons to Fall (More) in Love with Combinatorial Reconfiguration. WALCOM (2024)
Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura
Reconfiguration of Multisets with Applications to Bin Packing. CoRR (2024)
Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura
Parameterized Complexity of Reconfiguration of Atoms. WALCOM (2022)
Nicolas Bousquet, Amer E. Mouawad, Naomi Nishimura, Sebastian Siebertz
A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems. CoRR (2022)
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
Incremental optimization of independent sets under the reconfiguration framework. J. Comb. Optim. 43 (5) (2022)
Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura
Parameterized complexity of reconfiguration of atoms. CoRR (2021)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806 (2020)
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
On directed covering and domination problems. Discret. Appl. Math. 259 (2019)
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
Incremental Optimization of Independent Sets Under the Reconfiguration Framework. COCOON (2019)
Benjamin Moore, Naomi Nishimura, Vijay Subramanya
Reconfiguration of Graph Minors. MFCS (2018)
Naomi Nishimura
Introduction to Reconfiguration. Algorithms 11 (4) (2018)
Benjamin Moore, Naomi Nishimura, Vijay Subramanya
Reconfiguration of graph minors. CoRR (2018)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring spanning and induced subgraphs. CoRR (2018)
Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki
Incremental Optimization of Independent Sets under Reachability Constraints. CoRR (2018)
Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura
Computing k-Atomicity in Polynomial Time. SIAM J. Comput. 47 (2) (2018)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz
Vertex Cover Reconfiguration and Beyond. Algorithms 11 (2) (2018)
Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan
Reconfiguring Spanning and Induced Subgraphs. COCOON (2018)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
On the Parameterized Complexity of Reconfiguration Problems. Algorithmica 78 (1) (2017)
Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono
On Directed Covering and Domination Problems. ISAAC (2017)
Naomi Nishimura, Vijay Subramanya
Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. COCOA (2) (2017)
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. SIAM J. Discret. Math. 31 (3) (2017)
Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
Reconfiguration of dominating sets. J. Comb. Optim. 32 (4) (2016)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The complexity of dominating set reconfiguration. Theor. Comput. Sci. 651 (2016)
Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura
Computing Weak Consistency in Polynomial Time: [Extended Abstract]. PODC (2015)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The Complexity of Dominating Set Reconfiguration. WADS (2015)
Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal
The complexity of dominating set reconfiguration. CoRR (2015)
Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura
On scalable parallel recursive backtracking. J. Parallel Distributed Comput. 84 (2015)
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. ICALP (1) (2015)
Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. IPEC (2014)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
Reconfiguration over tree decompositions. CoRR (2014)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
Vertex Cover Reconfiguration and Beyond. ISAAC (2014)
Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
Reconfiguration of Dominating Sets. COCOON (2014)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna
Reconfiguration over Tree Decompositions. IPEC (2014)
Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman
Shortest reconfiguration paths in the solution space of Boolean formulas. CoRR (2014)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman
Vertex Cover Reconfiguration and Beyond. CoRR (2014)
Akira Suzuki, Amer E. Mouawad, Naomi Nishimura
Reconfiguration of Dominating Sets. CoRR (2014)
Naomi Nishimura, Narges Simjour
Parameterized Enumeration of (Locally-) Optimal Aggregations. WADS (2013)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
On the Parameterized Complexity of Reconfiguration Problems. CoRR (2013)
Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
On the Parameterized Complexity of Reconfiguration Problems. IPEC (2013)
Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. CoRR (2013)
Marcin Kaminski, Naomi Nishimura
Finding an induced path of given parity in planar graphs in polynomial time. SODA (2012)
Naomi Nishimura, Narges Simjour
Enumerating Neighbour and Closest Strings. IPEC (2012)
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. Algorithmica 52 (2) (2008)
Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood
On the Parameterized Complexity of Layered Graph Drawing. Algorithmica 52 (2) (2008)
MohammadTaghi Hajiaghayi, Naomi Nishimura
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73 (5) (2007)
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
Solving #SAT using vertex covers. Acta Informatica 44 (7-8) (2007)
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
A Fixed-Parameter Approach to 2-Layer Planarization. Algorithmica 45 (2) (2006)
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
Solving #SAT Using Vertex Covers. SAT (2006)
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
. Discret. Appl. Math. 145 (2) (2005)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. 152 (1-3) (2005)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Parameterized Counting Algorithms for General Graph Covering Problems. WADS (2005)
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT (2004)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC (2004)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors. J. Comput. Syst. Sci. 69 (2) (2004)
Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides
Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems. ESA (2004)
Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt
On the parameterized complexity of the generalized rush hour puzzle. CCCG (2003)
Mohammad Taghi Hajiaghayi, Naomi Nishimura
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS (2002)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42 (1) (2002)
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
On the Parameterized Complexity of Layered Graph Drawing. ESA (2001)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS (2001)
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
A Fixed-Parameter Approach to Two-Layer Planarization. Graph Drawing (2001)
Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
-minor-free graphs. Electron. Notes Discret. Math. 10 (2001)
Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde
. SWAT (2000)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
On Graph Powers for Leaf-Labeled Trees. SWAT (2000)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11 (3) (2000)
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos
Finding Smallest Supertrees Under Minor Containment. WG (1999)
Lata Narayanan, Naomi Nishimura
-Trees. J. Algorithms 26 (2) (1998)
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
Characterizing Multiterminal Flow Networks and Computing Flows in Networks of Small Treewidth. J. Comput. Syst. Sci. 57 (3) (1998)
Arvind Gupta, Naomi Nishimura
Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21 (2) (1998)
Lata Narayanan, Naomi Nishimura
-trees. SIROCCO (1996)
Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
µDatabase: Parallelism in a Memory-Mapped Environment. SPAA (1996)
Arvind Gupta, Naomi Nishimura
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164 (1&2) (1996)
Arvind Gupta, Naomi Nishimura
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS (1996)
Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE (1996)
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53 (2) (1996)
Arvind Gupta, Naomi Nishimura
Finding Largest Common Embeddable Subtrees. STACS (1995)
Arvind Gupta, Naomi Nishimura
The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18 (1) (1995)
Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA (1995)
Naomi Nishimura
Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms. J. Comput. Syst. Sci. 50 (1) (1995)
Arvind Gupta, Naomi Nishimura
finding Smallest Supertrees. ISAAC (1995)
Arvind Gupta, Naomi Nishimura
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT (1994)
Naomi Nishimura
A Model for Asynchronous Shared Memory Parallel Computation. SIAM J. Comput. 23 (6) (1994)
Naomi Nishimura
Restricted CRCW PRAM. Theor. Comput. Sci. 123 (2) (1994)
Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo
Pointers versus Arithmetic in PRAMs. Computational Complexity Conference (1993)
Arvind Gupta, Naomi Nishimura
The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS (1992)
Naomi Nishimura
Asynchronous shared memory parallel computation (preliminary version). SIGARCH Comput. Archit. News 19 (1) (1991)
Naomi Nishimura
Asynchronous Shared Memory Parallel Computation. SPAA (1990)
Naomi Nishimura
Complexity Issues in Tree-Based Version Control. WADS (1989)