( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Complexity of Dominating Set Reconfiguration.

, , , , , , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 398-409. Springer, (2015)

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.

Yoko Suzuki

Akira Hayashima

Akira Hori

Akira Satake

Akira Hayashima

 

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

Hitori Number., , и . FUN, том 7288 из Lecture Notes in Computer Science, стр. 334-345. Springer, (2012)Reconfiguration of dominating sets., , и . J. Comb. Optim., 32 (4): 1182-1195 (2016)Computation of inverses in residue class rings with parameters., , , и . ACM Commun. Comput. Algebra, 42 (3): 140-141 (2008)Active power minimization of a sound source in a reverberant closed space., , и . IEEE Trans. Signal Process., 39 (1): 246-248 (1991)The complexity of dominating set reconfiguration., , , , , , и . Theor. Comput. Sci., (2016)Reconfiguring spanning and induced subgraphs., , , , , , , и . Theor. Comput. Sci., (2020)Complexity of Coloring Reconfiguration under Recolorability Constraints., , , и . ISAAC, том 92 из LIPIcs, стр. 62:1-62:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)On the Minimum Caterpillar Problem in Digraphs., , , и . COCOON, том 7936 из Lecture Notes in Computer Science, стр. 729-736. Springer, (2013)Diameter of colorings under Kempe changes., , , , , , , и . Theor. Comput. Sci., (2020)Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete., , , , и . CCCG, стр. 211-216. (2012)