Jan Niclas Dreier | AC Group | TU Wienhttps://ac.tuwien.ac.at/team/jan-niclas-dreier/Jan Niclas DreierHugo Blox Builder (https://hugoblox.com)en-usThu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/team/jan-niclas-dreier/avatar_hu12269737585447302461.jpgJan Niclas Dreierhttps://ac.tuwien.ac.at/team/jan-niclas-dreier/Efficient reversal of transductions of sparse graph classeshttps://ac.tuwien.ac.at/publication/efficient-reversal-of-transductions-of-sparse-graph-classes/Thu, 01 Jan 2026 00:00:00 +0000https://ac.tuwien.ac.at/publication/efficient-reversal-of-transductions-of-sparse-graph-classes/Approximate Evaluation of Quantitative Second Order Querieshttps://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximate-evaluation-of-quantitative-second-order-queries/Merge-Width and First-Order Model Checkinghttps://ac.tuwien.ac.at/publication/merge-width-and-first-order-model-checking/Wed, 01 Jan 2025 00:00:00 +0000https://ac.tuwien.ac.at/publication/merge-width-and-first-order-model-checking/First-Order Model Checking on Monadically Stable Graph Classeshttps://ac.tuwien.ac.at/publication/first-order-model-checking-on-monadically-stable-graph-classes/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-model-checking-on-monadically-stable-graph-classes/Flip-breakability: A combinatorial dichotomy for monadically dependent graph classeshttps://ac.tuwien.ac.at/publication/flip-breakability-a-combinatorial-dichotomy-for-monadically-dependent-graph-classes/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/flip-breakability-a-combinatorial-dichotomy-for-monadically-dependent-graph-classes/SAT backdoors: Depth beats sizehttps://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/Mon, 01 Jan 2024 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size-2/A logic-based algorithmic meta-theorem for mim-widthhttps://ac.tuwien.ac.at/publication/a-logic-based-algorithmic-meta-theorem-for-mim-width/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/a-logic-based-algorithmic-meta-theorem-for-mim-width/CSP beyond tractable constraint languageshttps://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages-2/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages-2/Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyondhttps://ac.tuwien.ac.at/publication/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/evaluating-restricted-first-order-counting-properties-on-nowhere-dense-classes-and-beyond/First-Order Model Checking on Structurally Sparse Graph Classeshttps://ac.tuwien.ac.at/publication/first-order-model-checking-on-structurally-sparse-graph-classes/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-model-checking-on-structurally-sparse-graph-classes/Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classeshttps://ac.tuwien.ac.at/publication/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/indiscernibles-and-flatness-in-monadically-stable-and-monadically-nip-classes/Pseudorandom Finite Modelshttps://ac.tuwien.ac.at/publication/pseudorandom-finite-models/Sun, 01 Jan 2023 00:00:00 +0000https://ac.tuwien.ac.at/publication/pseudorandom-finite-models/Combinatorial and Algorithmic Aspects of Monadic Stabilityhttps://ac.tuwien.ac.at/publication/combinatorial-and-algorithmic-aspects-of-monadic-stability/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/combinatorial-and-algorithmic-aspects-of-monadic-stability/CSP Beyond Tractable Constraint Languageshttps://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/csp-beyond-tractable-constraint-languages/Model Checking on Interpretations of Classes of Bounded Local Cliquewidthhttps://ac.tuwien.ac.at/publication/model-checking-on-interpretations-of-classes-of-bounded-local-cliquewidth/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/model-checking-on-interpretations-of-classes-of-bounded-local-cliquewidth/SAT Backdoors: Depth Beats Sizehttps://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/sat-backdoors-depth-beats-size/Treelike Decompositions for Transductions of Sparse Graphshttps://ac.tuwien.ac.at/publication/treelike-decompositions-for-transductions-of-sparse-graphs/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/treelike-decompositions-for-transductions-of-sparse-graphs/Twin-width and generalized coloring numbershttps://ac.tuwien.ac.at/publication/twin-width-and-generalized-coloring-numbers/Sat, 01 Jan 2022 00:00:00 +0000https://ac.tuwien.ac.at/publication/twin-width-and-generalized-coloring-numbers/Approximate Evaluation of First-Order Counting Querieshttps://ac.tuwien.ac.at/publication/approximate-evaluation-of-first-order-counting-queries/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/approximate-evaluation-of-first-order-counting-queries/Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classeshttps://ac.tuwien.ac.at/publication/lacon-and-shrub-decompositions-a-new-characterization-of-first-order-transductions-of-bounded-expansion-classes/Fri, 01 Jan 2021 00:00:00 +0000https://ac.tuwien.ac.at/publication/lacon-and-shrub-decompositions-a-new-characterization-of-first-order-transductions-of-bounded-expansion-classes/Complexity of independency and cliquy treeshttps://ac.tuwien.ac.at/publication/complexity-of-independency-and-cliquy-trees/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/complexity-of-independency-and-cliquy-trees/First-Order Model-Checking in Random Graphs and Complex Networkshttps://ac.tuwien.ac.at/publication/first-order-model-checking-in-random-graphs-and-complex-networks/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/first-order-model-checking-in-random-graphs-and-complex-networks/Hard Problems on Random Graphshttps://ac.tuwien.ac.at/publication/hard-problems-on-random-graphs/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/hard-problems-on-random-graphs/Maximum Shallow Clique Minors in Preferential Attachment Graphs have Polylogarithmic Sizehttps://ac.tuwien.ac.at/publication/maximum-shallow-clique-minors-in-preferential-attachment-graphs-have-polylogarithmic-size/Wed, 01 Jan 2020 00:00:00 +0000https://ac.tuwien.ac.at/publication/maximum-shallow-clique-minors-in-preferential-attachment-graphs-have-polylogarithmic-size/Hardness of FO Model-Checking on Random Graphshttps://ac.tuwien.ac.at/publication/hardness-of-fo-model-checking-on-random-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/hardness-of-fo-model-checking-on-random-graphs/Motif Counting in Preferential Attachment Graphshttps://ac.tuwien.ac.at/publication/motif-counting-in-preferential-attachment-graphs/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/motif-counting-in-preferential-attachment-graphs/The Complexity of Packing Edge-Disjoint Pathshttps://ac.tuwien.ac.at/publication/the-complexity-of-packing-edge-disjoint-paths/Tue, 01 Jan 2019 00:00:00 +0000https://ac.tuwien.ac.at/publication/the-complexity-of-packing-edge-disjoint-paths/Local Structure Theorems for Erdos-Rényi Graphs and Their Algorithmic Applicationshttps://ac.tuwien.ac.at/publication/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-applications/Mon, 01 Jan 2018 00:00:00 +0000https://ac.tuwien.ac.at/publication/local-structure-theorems-for-erdos-renyi-graphs-and-their-algorithmic-applications/