Nikolas Mählmann
Scholar

Nikolas Mählmann

Google Scholar ID: Wqc0huEAAAAJ
University of Bremen
Logic in Computer ScienceFinite Model TheoryAlgorithmic Graph Theory
Citations & Impact
All-time
Citations
185
 
H-index
8
 
i10-index
6
 
Publications
13
 
Co-authors
14
list available
Contact
No contact links provided.
Resume (English only)
Academic Achievements
  • He has published several papers, including 'Separability Properties of Monadically Dependent Graph Classes' and 'Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO.' He has presented at multiple international conferences.
Research Experience
  • He conducts postdoctoral research at the University of Bremen, focusing on monadically stable and monadically dependent graph classes and model checking problems. He has also visited the University of Warsaw and the University of Montpellier for research.
Education
  • He obtained his PhD from the University of Bremen, supervised by Prof. Dr. Sebastian Siebertz.
Background
  • He is a postdoctoral researcher at the University of Bremen in the Theoretical Computer Science Group, with research interests in structural graph theory, logic, and algorithms. Currently, he focuses on monadically stable and monadically dependent classes of graphs and structures.
Miscellany
  • He can be reached via email at maehlmann[at]uni-bremen[dot]de.