default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaomi Nishimura
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j34]Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized Complexity of Reconfiguration of Atoms. Algorithmica 86(10): 3284-3308 (2024)- [j33]Nicolas Bousquet, Amer E. Mouawad
, Naomi Nishimura, Sebastian Siebertz:
A survey on the parameterized complexity of reconfiguration problems. Comput. Sci. Rev. 53: 100663 (2024) - [c44]Naomi Nishimura:
Reasons to Fall (More) in Love with Combinatorial Reconfiguration. WALCOM 2024: 9-14 - [c43]Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura:
Reconfiguration of Multisets with Applications to Bin Packing. WALCOM 2024: 212-226 - [i14]Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura:
Reconfiguration of Multisets with Applications to Bin Packing. CoRR abs/2405.05535 (2024) - [i13]Mario Grobler, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura, Vijayaragunathan Ramamoorthi, Sebastian Siebertz:
Kernelization Complexity of Solution Discovery Problems. CoRR abs/2409.17250 (2024) - 2022
- [j32]Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental optimization of independent sets under the reconfiguration framework. J. Comb. Optim. 43(5): 1264-1279 (2022) - [c42]Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized Complexity of Reconfiguration of Atoms. WALCOM 2022: 263-274 - [i12]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 abs/2204.10526 (2022) - 2021
- [i11]Alexandre Cooper, Stephanie Maaz, Amer E. Mouawad, Naomi Nishimura:
Parameterized complexity of reconfiguration of atoms. CoRR abs/2107.12267 (2021) - 2020
- [j31]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. Theor. Comput. Sci. 806: 553-566 (2020)
2010 – 2019
- 2019
- [j30]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On directed covering and domination problems. Discret. Appl. Math. 259: 76-99 (2019) - [c41]Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental Optimization of Independent Sets Under the Reconfiguration Framework. COCOON 2019: 313-324 - 2018
- [j29]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Sebastian Siebertz:
Vertex Cover Reconfiguration and Beyond. Algorithms 11(2): 20 (2018) - [j28]Naomi Nishimura:
Introduction to Reconfiguration. Algorithms 11(4): 52 (2018) - [j27]Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura:
Computing k-Atomicity in Polynomial Time. SIAM J. Comput. 47(2): 420-455 (2018) - [c40]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring Spanning and Induced Subgraphs. COCOON 2018: 428-440 - [c39]Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya:
Reconfiguration of Graph Minors. MFCS 2018: 75:1-75:15 - [e1]Daniel Lokshtanov, Naomi Nishimura:
12th International Symposium on Parameterized and Exact Computation, IPEC 2017, September 6-8, 2017, Vienna, Austria. LIPIcs 89, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-051-4 [contents] - [i10]Tesshu Hanaka, Takehiro Ito, Haruka Mizuta, Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya, Akira Suzuki, Krishna Vaidyanathan:
Reconfiguring spanning and induced subgraphs. CoRR abs/1803.06074 (2018) - [i9]Benjamin R. Moore, Naomi Nishimura, Vijay Subramanya:
Reconfiguration of graph minors. CoRR abs/1804.09240 (2018) - [i8]Takehiro Ito, Haruka Mizuta, Naomi Nishimura, Akira Suzuki:
Incremental Optimization of Independent Sets under Reachability Constraints. CoRR abs/1804.09422 (2018) - 2017
- [j26]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. Algorithmica 78(1): 274-297 (2017) - [j25]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): 2185-2200 (2017) - [c38]Naomi Nishimura, Vijay Subramanya:
Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable. COCOA (2) 2017: 138-153 - [c37]Tesshu Hanaka, Naomi Nishimura, Hirotaka Ono:
On Directed Covering and Domination Problems. ISAAC 2017: 45:1-45:12 - 2016
- [j24]Akira Suzuki, Amer E. Mouawad, Naomi Nishimura:
Reconfiguration of dominating sets. J. Comb. Optim. 32(4): 1182-1195 (2016) - [j23]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: 37-49 (2016) - 2015
- [j22]Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura:
On scalable parallel recursive backtracking. J. Parallel Distributed Comput. 84: 65-75 (2015) - [c36]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas. ICALP (1) 2015: 985-996 - [c35]Wojciech M. Golab, Xiaozhou (Steve) Li, Alejandro López-Ortiz, Naomi Nishimura:
Computing Weak Consistency in Polynomial Time: [Extended Abstract]. PODC 2015: 395-404 - [c34]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The Complexity of Dominating Set Reconfiguration. WADS 2015: 398-409 - [i7]Arash Haddadan, Takehiro Ito, Amer E. Mouawad, Naomi Nishimura, Hirotaka Ono, Akira Suzuki, Youcef Tebbal:
The complexity of dominating set reconfiguration. CoRR abs/1503.00833 (2015) - 2014
- [c33]Akira Suzuki, Amer E. Mouawad, Naomi Nishimura:
Reconfiguration of Dominating Sets. COCOON 2014: 405-416 - [c32]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
Vertex Cover Reconfiguration and Beyond. ISAAC 2014: 452-463 - [c31]Paul S. Bonsma, Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration. IPEC 2014: 110-121 - [c30]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over Tree Decompositions. IPEC 2014: 246-257 - [i6]Akira Suzuki, Amer E. Mouawad, Naomi Nishimura:
Reconfiguration of Dominating Sets. CoRR abs/1401.5714 (2014) - [i5]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman:
Vertex Cover Reconfiguration and Beyond. CoRR abs/1402.4926 (2014) - [i4]Amer E. Mouawad, Naomi Nishimura, Vinayak Pathak, Venkatesh Raman:
Shortest reconfiguration paths in the solution space of Boolean formulas. CoRR abs/1404.3801 (2014) - [i3]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Marcin Wrochna:
Reconfiguration over tree decompositions. CoRR abs/1405.2447 (2014) - 2013
- [c29]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. IPEC 2013: 281-294 - [c28]Naomi Nishimura, Narges Simjour:
Parameterized Enumeration of (Locally-) Optimal Aggregations. WADS 2013: 512-523 - [i2]Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki:
On the Parameterized Complexity of Reconfiguration Problems. CoRR abs/1308.2409 (2013) - [i1]Faisal N. Abu-Khzam, Khuzaima Daudjee, Amer E. Mouawad, Naomi Nishimura:
An Easy-to-use Scalable Framework for Parallel Recursive Backtracking. CoRR abs/1312.7626 (2013) - 2012
- [c27]Naomi Nishimura, Narges Simjour:
Enumerating Neighbour and Closest Strings. IPEC 2012: 252-263 - [c26]Marcin Kaminski, Naomi Nishimura:
Finding an induced path of given parity in planar graphs in polynomial time. SODA 2012: 656-670
2000 – 2009
- 2008
- [j21]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): 167-176 (2008) - [j20]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): 267-292 (2008) - 2007
- [j19]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Solving #SAT using vertex covers. Acta Informatica 44(7-8): 509-523 (2007) - [j18]MohammadTaghi Hajiaghayi, Naomi Nishimura:
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth. J. Comput. Syst. Sci. 73(5): 755-768 (2007) - 2006
- [j17]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): 159-182 (2006) - [c25]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Solving #SAT Using Vertex Covers. SAT 2006: 396-409 - 2005
- [j16]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-connected graphs of pathwidth k. Discret. Appl. Math. 145(2): 242-265 (2005) - [j15]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover. Discret. Appl. Math. 152(1-3): 229-245 (2005) - [c24]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Parameterized Counting Algorithms for General Graph Covering Problems. WADS 2005: 99-109 - 2004
- [j14]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): 166-195 (2004) - [c23]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: 311-322 - [c22]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Smaller Kernels for Hitting Set Problems of Constant Arity. IWPEC 2004: 121-126 - [c21]Naomi Nishimura, Prabhakar Ragde, Stefan Szeider:
Detecting Backdoor Sets with Respect to Horn and Binary Clauses. SAT 2004 - 2003
- [c20]Henning Fernau, Torben Hagerup, Naomi Nishimura, Prabhakar Ragde, Klaus Reinhardt:
On the parameterized complexity of the generalized rush hour puzzle. CCCG 2003: 6-9 - 2002
- [j13]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees. J. Algorithms 42(1): 69-108 (2002) - [c19]Mohammad Taghi Hajiaghayi, Naomi Nishimura:
Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth. MFCS 2002: 305-318 - 2001
- [j12]Mohammad Taghi Hajiaghayi, Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast approximation schemes for K3, 3-minor-free or K5-minor-free graphs. Electron. Notes Discret. Math. 10: 137-142 (2001) - [c18]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: 488-499 - [c17]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. GD 2001: 1-15 - [c16]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover. WADS 2001: 75-86 - 2000
- [j11]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment. Int. J. Found. Comput. Sci. 11(3): 445-465 (2000) - [c15]Arvind Gupta, Naomi Nishimura, Andrzej Proskurowski, Prabhakar Ragde:
Embeddings of k-Connected Graphs of Pathwidth k. SWAT 2000: 111-124 - [c14]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
On Graph Powers for Leaf-Labeled Trees. SWAT 2000: 125-138
1990 – 1999
- 1999
- [c13]Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos:
Finding Smallest Supertrees Under Minor Containment. WG 1999: 303-312 - 1998
- [j10]Arvind Gupta, Naomi Nishimura:
Finding Largest Subtrees and Smallest Supertrees. Algorithmica 21(2): 183-210 (1998) - [j9]Lata Narayanan, Naomi Nishimura:
Interval Routing on k-Trees. J. Algorithms 26(2): 325-369 (1998) - [j8]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): 366-375 (1998) - 1996
- [j7]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo:
Pointers versus Arithmetic in PRAMs. J. Comput. Syst. Sci. 53(2): 218-232 (1996) - [j6]Arvind Gupta, Naomi Nishimura:
The Complexity of Subgraph Isomorphism for Classes of Partial k-Trees. Theor. Comput. Sci. 164(1&2): 287-298 (1996) - [c12]Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde:
Parallel Pointer-Based Join Algorithms in Memory-mapped Environments. ICDE 1996: 266-275 - [c11]Lata Narayanan, Naomi Nishimura:
Interval Routing on k-trees. SIROCCO 1996: 104-118 - [c10]Peter A. Buhr, Anil K. Goel, Naomi Nishimura, Prabhakar Ragde:
µDatabase: Parallelism in a Memory-Mapped Environment. SPAA 1996: 196-199 - [c9]Arvind Gupta, Naomi Nishimura:
Characterizing the Complexity of Subgraph Isomorphism for Graphs of Bounded Path-Width. STACS 1996: 453-464 - 1995
- [j5]Arvind Gupta, Naomi Nishimura:
The Parallel Complexity of Tree Embedding Problems. J. Algorithms 18(1): 176-200 (1995) - [j4]Naomi Nishimura:
Efficient Asynchronous Simulation of a Class of Synchronous Parallel Algorithms. J. Comput. Syst. Sci. 50(1): 98-113 (1995) - [c8]Arvind Gupta, Naomi Nishimura:
finding Smallest Supertrees. ISAAC 1995: 112-121 - [c7]Torben Hagerup, Jyrki Katajainen, Naomi Nishimura, Prabhakar Ragde:
Characterizations of k-Terminal Flow Networks and Computing Network Flows in Partial k-Trees. SODA 1995: 641-649 - [c6]Arvind Gupta, Naomi Nishimura:
Finding Largest Common Embeddable Subtrees. STACS 1995: 397-408 - 1994
- [j3]Naomi Nishimura:
A Model for Asynchronous Shared Memory Parallel Computation. SIAM J. Comput. 23(6): 1231-1252 (1994) - [j2]Naomi Nishimura:
Restricted CRCW PRAM. Theor. Comput. Sci. 123(2): 415-426 (1994) - [c5]Arvind Gupta, Naomi Nishimura:
Sequential and Parallel Algorithms for Embedding Problems on Classes of Partial k-Trees. SWAT 1994: 172-182 - 1993
- [c4]Patrick W. Dymond, Faith E. Fich, Naomi Nishimura, Prabhakar Ragde, Walter L. Ruzzo:
Pointers versus Arithmetic in PRAMs. SCT 1993: 239-252 - 1992
- [c3]Arvind Gupta, Naomi Nishimura:
The Parallel Complexity of Tree Embedding Problems (Extended Abstract). STACS 1992: 21-32 - 1991
- [b1]Naomi Nishimura:
Asynchrony in shared memory parallel computation. University of Toronto, Canada, 1991 - [j1]Naomi Nishimura:
Asynchronous shared memory parallel computation (preliminary version). SIGARCH Comput. Archit. News 19(1): 97-105 (1991) - 1990
- [c2]Naomi Nishimura:
Asynchronous Shared Memory Parallel Computation. SPAA 1990: 76-84
1980 – 1989
- 1989
- [c1]Naomi Nishimura:
Complexity Issues in Tree-Based Version Control. WADS 1989: 472-486
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 19:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
