PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Nishimura, Naomi"

Author of the publication

copydeleteadd this publication to your clipboard
The complexity of dominating set reconfiguration.

, , , , , , and . Theor. Comput. Sci., (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Nishimura, Naomi
add a person with the name Nishimura, Naomi
 

Other publications of authors with the same name

Approximation algorithms for classes of graphs excluding single-crossing graphs as minors., , , , and . J. Comput. Syst. Sci., 69 (2): 166-195 (2004)Finding Smallest Supertrees Under Minor Containment., , and . Int. J. Found. Comput. Sci., 11 (3): 445-465 (2000)Asynchronous shared memory parallel computation (preliminary version).. SIGARCH Computer Architecture News, 19 (1): 97-105 (1991)Incremental Optimization of Independent Sets under Reachability Constraints., , , and . CoRR, (2018)On Graph Powers for Leaf-Labeled Trees., , and . J. Algorithms, 42 (1): 69-108 (2002)On Directed Covering and Domination Problems., , and . ISAAC, volume 92 of LIPIcs, page 45:1-45:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2017)Finding Smallest Supertrees Under Minor Containment., , and . WG, volume 1665 of Lecture Notes in Computer Science, page 303-312. Springer, (1999)Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth., and . MFCS, volume 2420 of Lecture Notes in Computer Science, page 305-318. Springer, (2002)Reconfiguration of Graph Minors., , and . MFCS, volume 117 of LIPIcs, page 75:1-75:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Graph Editing to a Given Neighbourhood Degree List is Fixed-Parameter Tractable., and . COCOA (2), volume 10628 of Lecture Notes in Computer Science, page 138-153. Springer, (2017)