( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Detecting Backdoor Sets with Respect to Horn and Binary Clauses.

, , и . SAT, (2004)

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.

Naomi Silberner

Kumi Nishimura

Masanobu Nishimura

Naomi Tidten

Masanobu Nishimura

 

Другие публикации лиц с тем же именем

Incremental Optimization of Independent Sets under Reachability Constraints., , , и . CoRR, (2018)Incremental Optimization of Independent Sets Under the Reconfiguration Framework., , , и . COCOON, том 11653 из Lecture Notes in Computer Science, стр. 313-324. Springer, (2019)Finding Smallest Supertrees Under Minor Containment., , и . WG, том 1665 из Lecture Notes in Computer Science, стр. 303-312. Springer, (1999)Asynchronous shared memory parallel computation (preliminary version).. SIGARCH Comput. Archit. News, 19 (1): 97-105 (1991)Computing Weak Consistency in Polynomial Time: Extended Abstract., , , и . PODC, стр. 395-404. ACM, (2015)Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth., и . MFCS, том 2420 из Lecture Notes in Computer Science, стр. 305-318. Springer, (2002)On Graph Powers for Leaf-Labeled Trees., , и . J. Algorithms, 42 (1): 69-108 (2002)Finding Smallest Supertrees Under Minor Containment., , и . 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., , , и . CoRR, (2022)Approximation algorithms for classes of graphs excluding single-crossing graphs as minors., , , , и . J. Comput. Syst. Sci., 69 (2): 166-195 (2004)