Jan Dreier

Available identifiers

zbMath Open dreier.janMaRDI QIDQ2065918

List of research outcomes

Publication	Date of Publication	Type
Evaluating restricted first-order counting properties on nowhere dense classes and beyond	2025-01-06	Paper
Treelike decompositions for transductions of sparse graphs	2024-12-06	Paper
Model checking on interpretations of classes of bounded local cliquewidth	2024-12-06	Paper
Indiscernibles and flatness in monadically stable and monadically NIP classes	2024-11-14	Paper
Combinatorial and algorithmic aspects of monadic stability	2024-09-11	Paper
A logic-based algorithmic meta-theorem for mim-width	2024-05-14	Paper
SAT backdoors: depth beats size	2024-03-11	Paper
CSP beyond tractable constraint languages	2024-02-14	Paper
https://portal.mardi4nfdi.de/entity/Q6147359	2024-01-15	Paper
First-Order Model Checking on Monadically Stable Graph Classes	2023-11-30	Paper
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size	2023-10-31	Paper
Corrigendum to: ``Twin-width and generalized coloring numbers	2023-10-30	Paper
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes	2023-08-26	Paper
First-Order Model-Checking in Random Graphs and Complex Networks	2023-02-07	Paper
First-Order Model Checking on Structurally Sparse Graph Classes	2023-02-07	Paper
The complexity of packing edge-disjoint paths	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5875543	2023-02-03	Paper
Motif Counting in Preferential Attachment Graphs	2023-02-03	Paper
Combinatorial and Algorithmic Aspects of Monadic Stability	2022-06-29	Paper
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes	2022-06-28	Paper
Model Checking on Interpretations of Classes of Bounded Local Cliquewidth	2022-02-25	Paper
Treelike decompositions for transductions of sparse graphs	2022-01-26	Paper
Twin-width and generalized coloring numbers	2022-01-13	Paper
Local structure theorems for Erdős-Rényi graphs and their algorithmic applications	2020-10-21	Paper
Complexity of independency and cliquy trees	2019-12-30	Paper
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes	N/A	Paper

Research outcomes over time

This page was built for person: Jan Dreier