Naomi Nishimura
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
36
Venues
18
Active years
1989–2026
Best venue rank
A*
Where they publish
Papers
36 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SOFSEM | On the Complexity of Constrained Reconfiguration and Motion Planning. | Nicolas Bousquet, Remy El Sabeh, Amer E. Mouawad, Naomi Nishimura |
| 2024 | ISAAC | Kernelization Complexity of Solution Discovery Problems. | Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, Sebastian Siebertz |
| 2024 | WALCOM | Reconfiguration of Multisets with Applications to Bin Packing. | Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura |
| 2024 | WALCOM | Reasons to Fall (More) in Love with Combinatorial Reconfiguration. | Naomi Nishimura |
| 2022 | WALCOM | Parameterized Complexity of Reconfiguration of Atoms. | Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura |
| 2019 | COCOON | Incremental Optimization of Independent Sets Under the Reconfiguration Framework. | Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki |
| 2018 | COCOON | Reconfiguring Spanning and Induced Subgraphs. | Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan |
| 2018 | MFCS | Reconfiguration of Graph Minors. | Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya |
| 2017 | COCOA | Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. | Naomi Nishimura, Vijay Subramanya |
| 2017 | ISAAC | On Directed Covering and Domination Problems. | Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono |
| 2015 | ICALP | Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. | Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman |
| 2015 | PODC | Computing Weak Consistency in Polynomial Time: [Extended Abstract]. | Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro Lpez-Ortiz, Naomi Nishimura |
| 2015 | WADS | The Complexity of Dominating Set Reconfiguration. | Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal |
| 2014 | COCOON | Reconfiguration of Dominating Sets. | Akira Suzuki, Amer E. Mouawad, Naomi Nishimura |
| 2014 | ISAAC | Vertex Cover Reconfiguration and Beyond. | Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman |
| 2013 | WADS | Parameterized Enumeration of (Locally-) Optimal Aggregations. | Naomi Nishimura, Narges Simjour |
| 2012 | SODA | Finding an induced path of given parity in planar graphs in polynomial time. | Marcin Kaminski, Naomi Nishimura |
| 2006 | SAT | Solving #SAT Using Vertex Covers. | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2005 | WADS | Parameterized Counting Algorithms for General Graph Covering Problems. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 2004 | ESA | 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 |
| 2004 | SAT | Detecting Backdoor Sets with Respect to Horn and Binary Clauses. | Naomi Nishimura, Prabhakar Ragde, Stefan Szeider |
| 2002 | MFCS | Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. | Mohammad Taghi Hajiaghayi, Naomi Nishimura |
| 2001 | ESA | 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 |
| 2001 | GD | 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 |
| 2001 | WADS | Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 1999 | WG | Finding Smallest Supertrees Under Minor Containment. | Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos |
| 1996 | ICDE | Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. | Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde |
| 1996 | STACS | Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. | Arvind Gupta, Naomi Nishimura |
| 1996 | SPAA | Database: Parallelism in a Memory-Mapped Environment. | Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde |
| 1996 | SIROCCO | Interval Routing on | Lata Narayanan, Naomi Nishimura |
| 1995 | ISAAC | finding Smallest Supertrees. | Arvind Gupta, Naomi Nishimura |
| 1995 | SODA | Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. | Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde |
| 1995 | STACS | Finding Largest Common Embeddable Subtrees. | Arvind Gupta, Naomi Nishimura |
| 1992 | STACS | The Parallel Complexity of Tree Embedding Problems (Extended Abstract). | Arvind Gupta, Naomi Nishimura |
| 1990 | SPAA | Asynchronous Shared Memory Parallel Computation. | Naomi Nishimura |
| 1989 | WADS | Complexity Issues in Tree-Based Version Control. | Naomi Nishimura |