( en | de | ru )

 

Disambiguation of "Nishimura, Naomi"

Author of the publication

copydeleteadd this publication to your clipboard
Solving #SAT using vertex covers.

, , and . Acta Inf., 44 (7-8): 509-523 (2007)

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.

Naomi Silberner

Kumi Nishimura

Masanobu Nishimura

Naomi Tidten

Masanobu Nishimura

 

Other publications of authors with the same name

Incremental Optimization of Independent Sets under Reachability Constraints., , , and . CoRR, (2018)Asynchronous shared memory parallel computation (preliminary version).. SIGARCH Comput. Archit. News, 19 (1): 97-105 (1991)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)A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems., , , and . CoRR, (2022)Computing Weak Consistency in Polynomial Time: Extended Abstract., , , and . PODC, page 395-404. ACM, (2015)On Graph Powers for Leaf-Labeled Trees., , and . J. Algorithms, 42 (1): 69-108 (2002)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)Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , and . COCOON, volume 11653 of Lecture Notes in Computer Science, page 313-324. Springer, (2019)Finding Smallest Supertrees Under Minor Containment., , and . WG, volume 1665 of Lecture Notes in Computer Science, page 303-312. Springer, (1999)