( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width.

, и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 483-494. Springer, (2011)

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.

Amal Dé

Dennis De

Soumen De

Inessa De

Suparna De

 

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

Maximal Matching and Path Matching Counting in Polynomial Time for Graphs of Bounded Clique Width., и . TAMC, том 6648 из Lecture Notes in Computer Science, стр. 483-494. Springer, (2011)Two-player Domino games., и . CoRR, (2023)The Domino Problem Is Undecidable on Every Rhombus Subshift., , и . DLT, том 13911 из Lecture Notes in Computer Science, стр. 100-112. Springer, (2023)The Aperiodic Domino Problem in Higher Dimension., и . STACS, том 219 из LIPIcs, стр. 19:1-19:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Two-Player Domino Games., и . CiE, том 14773 из Lecture Notes in Computer Science, стр. 139-152. Springer, (2024)Construction of mu-Limit Sets of Two-dimensional Cellular Automata., и . STACS, том 30 из LIPIcs, стр. 262-274. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Self-organization in Cellular Automata: A Particle-Based Approach., and . Developments in Language Theory, volume 6795 of Lecture Notes in Computer Science, page 251-263. Springer, (2011)Sturmian and Infinitely Desubstitutable Words Accepted by an ømega-Automaton., and . WORDS, volume 13899 of Lecture Notes in Computer Science, page 104-116. Springer, (2023)String attractors and bi-infinite words., , and . CoRR, (2024)