Naomi Nishimura

99 papers A* 4A 8B 24Misc 3Journal 51Unranked 8

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