Michael Levet

According to our database, Michael Levet authored at least 17 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Count-free Weisfeiler-Leman and group isomorphism.

Nathaniel A. Collins, Michael Levet

Int. J. Algebra Comput., May, 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

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman.

Michael Levet, Puck Rombach, Nicholas Sieger

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 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

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Constant Depth Circuit Complexity for Generating Quasigroups.

Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß

Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024

2023

Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture.

Jeremy F. Alm, Michael Levet

Int. J. Algebra Comput., December, 2023

On the complexity of identifying strongly regular graphs.

Michael Levet

Australas. J Comb., October, 2023

On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract).

Joshua A. Grochow, Michael Levet

Proceedings of the Fourteenth International Symposium on Games, 2023

Logarithmic Weisfeiler-Leman Identifies All Graphs of Bounded Rank Width.

Michael Levet, Nicholas Sieger

CoRR, 2023

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman.

Joshua A. Grochow, Michael Levet

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture.

Jeremy F. Alm, David Andrews, Michael Levet

Proceedings of the Relational and Algebraic Methods in Computer Science, 2023

2022

On the Descriptive Complexity of Groups without Abelian Normal Subgroups.

Joshua A. Grochow, Michael Levet

CoRR, 2022

Experience Report: Standards-Based Grading at Scale in Algorithms.

Lijun Chen, Joshua A. Grochow, Ryan Layer, Michael Levet

Proceedings of the ITiCSE 2022: Innovation and Technology in Computer Science Education, Dublin, Ireland, July 8, 2022

2021

Weisfeiler-Leman for Group Isomorphism: Action Compatibility.

Joshua A. Grochow, Michael Levet

CoRR, 2021

2017

Activity in Boolean networks.

Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Michael Levet, Henning S. Mortveit, Sichao Wu

Nat. Comput., 2017

2016

A Mechanism Design Approach for Influence Maximization.

Michael Levet, Siddharth Krishnan

Proceedings of the Game Theory for Networks, 2016

2015

Network Structure and Activity in Boolean Networks.

Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Michael Levet, Henning S. Mortveit, Sichao Wu

Proceedings of the Cellular Automata and Discrete Complex Systems, 2015