default search action
Nikolas Mählmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [b1]Nikolas Mählmann:
Monadically stable and monadically dependent graph classes: characterizations and algorithmic meta-theorems. Bremen University, Germany, 2024 - [c9]Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk:
First-Order Model Checking on Monadically Stable Graph Classes. FOCS 2024: 21-30 - [c8]Jan Dreier
, Nikolas Mählmann
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. STOC 2024: 1550-1560 - [i8]Jan Dreier
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. CoRR abs/2403.15201 (2024) - 2023
- [c7]Jan Dreier
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. ICALP 2023: 125:1-125:18 - [c6]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
Flipper Games for Monadically Stable Graph Classes. ICALP 2023: 128:1-128:16 - [c5]Jan Dreier
First-Order Model Checking on Structurally Sparse Graph Classes. STOC 2023: 567-580 - [i7]Jakub Gajarský, Nikolas Mählmann, Rose McCarty
Flipper games for monadically stable graph classes. CoRR abs/2301.13735 (2023) - [i6]Jan Dreier
First-Order Model Checking on Structurally Sparse Graph Classes. CoRR abs/2302.03527 (2023) - [i5]Jan Dreier
First-Order Model Checking on Monadically Stable Graph Classes. CoRR abs/2311.18740 (2023) - 2022
- [c4]Jan Dreier
Combinatorial and Algorithmic Aspects of Monadic Stability. ISAAC 2022: 11:1-11:17 - [c3]Édouard Bonnet, Jan Dreier
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. LICS 2022: 54:1-54:13 - [i4]Édouard Bonnet, Jan Dreier, Jakub Gajarský, Stephan Kreutzer, Nikolas Mählmann, Pierre Simon, Szymon Torunczyk:
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. CoRR abs/2202.13014 (2022) - [i3]Jan Dreier
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. CoRR abs/2206.13765 (2022) - [i2]Jan Dreier
Combinatorial and Algorithmic Aspects of Monadic Stability. CoRR abs/2206.14509 (2022) - 2021
- [c2]Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny:
Recursive Backdoors for SAT. MFCS 2021: 73:1-73:18 - [i1]Nikolas Mählmann, Sebastian Siebertz, Alexandre Vigny:
Recursive Backdoors for SAT. CoRR abs/2102.04707 (2021)
2010 – 2019
- 2019
- [c1]Georg Volkmar, Nikolas Mählmann, Rainer Malaka
Procedural Content Generation in Competitive Multiplayer Platform Games. ICEC-JCSG 2019: 228-234
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: