Nikolas Mählmann

Orcid: 0000-0003-3657-7736

According to our database1, Nikolas Mählmann authored at least 11 papers between 2019 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Monadically stable and monadically dependent graph classes: characterizations and algorithmic meta-theorems
PhD thesis, 2024

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
First-Order Model Checking on Monadically Stable Graph Classes.
CoRR, 2023

First-Order Model Checking on Structurally Sparse Graph Classes.
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Flipper Games for Monadically Stable Graph Classes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes.
CoRR, 2022

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Combinatorial and Algorithmic Aspects of Monadic Stability.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
Recursive Backdoors for SAT.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2019
Procedural Content Generation in Competitive Multiplayer Platform Games.
Proceedings of the Entertainment Computing and Serious Games, 2019


  Loading...