( en | de | ru )

 

Disambiguation of "Levet, Michael"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity and Enumeration in Models of Genome Rearrangement.

, , , , , , , , , , and . COCOON (1), volume 14422 of Lecture Notes in Computer Science, page 3-14. Springer, (2023)

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.

Gregor Levetzow

Cornelia Levetzow

Richard Levetzow

Sabine Levetzow

Reimer Levetzow

 

Other publications of authors with the same name

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture., , and . RAMiCS, volume 13896 of Lecture Notes in Computer Science, page 17-33. Springer, (2023)Activity in Boolean networks., , , , , and . Nat. Comput., 16 (3): 427-439 (2017)On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman., and . FCT, volume 14292 of Lecture Notes in Computer Science, page 234-247. Springer, (2023)Network Structure and Activity in Boolean Networks., , , , , and . Automata, volume 9099 of Lecture Notes in Computer Science, page 210-223. Springer, (2015)Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman., , and . SWAT, volume 294 of LIPIcs, page 32:1-32:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)On the Descriptive Complexity of Groups without Abelian Normal Subgroups., and . CoRR, (2022)On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract)., and . GandALF, volume 390 of EPTCS, page 185-202. (2023)Complexity and Enumeration in Models of Genome Rearrangement., , , , , , , , , and 1 other author(s). COCOON (1), volume 14422 of Lecture Notes in Computer Science, page 3-14. Springer, (2023)Constant Depth Circuit Complexity for Generating Quasigroups., , , and . ISSAC, page 198-207. ACM, (2024)On the Complexity of Identifying Strongly Regular Graphs.. CoRR, (2022)