Network Structure and Activity in Boolean Networks. - Abhijin Adiga; Hilton Galyean; Chris J. Kuhlman; Michael Levet; Henning S. Mortveit; Sichao Wu (Automata, 2015)

A Mechanism Design Approach for Influence Maximization. - Michael Levet; Siddharth Krishnan (GAMENETS, 2016)

Activity in Boolean networks. - Abhijin Adiga; Hilton Galyean; Chris J. Kuhlman; Michael Levet; Henning S. Mortveit; Sichao Wu (Nat. Comput., 2017)

Weisfeiler-Leman for Group Isomorphism: Action Compatibility. - Joshua A. Grochow; Michael Levet (CoRR, 2021)

Experience Report: Standards-Based Grading at Scale in Algorithms. - Lijun Chen 001; Joshua A. Grochow; Ryan Layer; Michael Levet (ITiCSE (1), 2022)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups. - Joshua A. Grochow; Michael Levet (CoRR, 2022)

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture. - Jeremy F. Alm; David Andrews; Michael Levet (RAMiCS, 2023)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. - Joshua A. Grochow; Michael Levet (FCT, 2023)

Logarithmic Weisfeiler-Leman Identifies All Graphs of Bounded Rank Width. - Michael Levet; Nicholas Sieger (CoRR, 2023)

On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract). - Joshua A. Grochow; Michael Levet (GandALF, 2023)

On the complexity of identifying strongly regular graphs. - Michael Levet (Australas. J Comb., 2023)

Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture. - Jeremy F. Alm; Michael Levet (Int. J. Algebra Comput., 2023)

Constant Depth Circuit Complexity for Generating Quasigroups. - Nathaniel A. Collins; Joshua A. Grochow; Michael Levet; Armin Weiß (ISSAC, 2024)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman. - Michael Levet; Puck Rombach; Nicholas Sieger (SWAT, 2024)

Complexity and enumeration in models of genome rearrangement. - Lora Bailey; Heather C. Smith Blake; Garner Cochran; Nathan Fox; Michael Levet; Reem Mahmoud; Elizabeth Bailey Matson; Inne Singgih; Grace Stadnyk; Xinyi Wang; Alexander Wiedemann (Theor. Comput. Sci., 2024)

Count-free Weisfeiler-Leman and group isomorphism. - Nathaniel A. Collins; Michael Levet (Int. J. Algebra Comput., 2024)

Pairwise rearrangement is fixed-parameter tractable in the Single Cut-and-Join model. - Lora Bailey; Heather C. Smith Blake; Garner Cochran; Nathan Fox; Michael Levet; Reem Mahmoud; Inne Singgih; Grace Stadnyk; Alexander Wiedemann (Theor. Comput. Sci., 2025)

Complexity of Minimal Faithful Permutation Degree for Fitting-free Groups. - Michael Levet; Pranjal Srivastava; Dhara Thakkar (CoRR, 2025)

On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness. - Joshua A. Grochow; Dan Johnson; Michael Levet (CoRR, 2025)