Jan Dreier

Publication Activity (10 Years)

Years Active: 2014-2024
Publications (10 Years): 42

Top Topics

Preferential Attachment

Top Venues

Publications

Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. Discret. Math. 347 (1) (2024)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk
Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. ICALP (2023)
Jan Dreier, Ioannis Eleftheriadis, Nikolas Mählmann, Rose McCarty, Michal Pilipczuk, Szymon Torunczyk
First-Order Model Checking on Monadically Stable Graph Classes. CoRR (2023)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
First-Order Model Checking on Structurally Sparse Graph Classes. CoRR (2023)
Jan Dreier
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes. Log. Methods Comput. Sci. 19 (2) (2023)
Jan Dreier, Jamie Tucker-Foltz
Pseudorandom Finite Models. CoRR (2023)
Jan Dreier, Daniel Mock, Peter Rossmanith
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. CoRR (2023)
Jan Dreier, Jamie Tucker-Foltz
Pseudorandom Finite Models. LICS (2023)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
CSP beyond tractable constraint languages. Constraints An Int. J. 28 (3) (2023)
Jan Dreier, Robert Ganian, Thekla Hamm
Approximate Evaluation of Quantitative Second Order Queries. CoRR (2023)
Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
A logic-based algorithmic meta-theorem for mim-width. SODA (2023)
Jan Dreier, Daniel Mock, Peter Rossmanith
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. ESA (2023)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz
First-Order Model Checking on Structurally Sparse Graph Classes. STOC (2023)
É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. LICS (2022)
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny
Combinatorial and Algorithmic Aspects of Monadic Stability. CoRR (2022)
É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 (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
CSP Beyond Tractable Constraint Languages. CP (2022)
Jan Dreier, Nikolas Mählmann, Sebastian Siebertz, Szymon Torunczyk
Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. CoRR (2022)
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
Treelike decompositions for transductions of sparse graphs. CoRR (2022)
Benjamin Bergougnoux, Jan Dreier, Lars Jaffke
A logic-based algorithmic meta-theorem for mim-width. CoRR (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT Backdoors: Depth Beats Size. ESA (2022)
Jan Dreier, Sebastian Ordyniak, Stefan Szeider
SAT Backdoors: Depth Beats Size. CoRR (2022)
Jan Dreier, Nikolas Mählmann, Amer E. Mouawad, Sebastian Siebertz, Alexandre Vigny
Combinatorial and Algorithmic Aspects of Monadic Stability. ISAAC (2022)
Jan Dreier, Jakub Gajarský, Sandra Kiefer, Michal Pilipczuk, Szymon Torunczyk
Treelike Decompositions for Transductions of Sparse Graphs. LICS (2022)
Jan Dreier, Jakub Gajarský, Yiting Jiang, Patrice Ossona de Mendez, Jean-Florent Raymond
Twin-width and generalized coloring numbers. Discret. Math. 345 (3) (2022)
Jan Dreier
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. LICS (2021)
Jan Dreier, Peter Rossmanith
Approximate Evaluation of First-Order Counting Queries. SODA (2021)
Jan Dreier
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. CoRR (2021)
Katrin Casel, Jan Dreier, Henning Fernau, Moritz Gobbert, Philipp Kuinke, Fernando Sánchez Villaamil, Markus L. Schmid, Erik Jan van Leeuwen
Complexity of independency and cliquy trees. Discret. Appl. Math. 272 (2020)
Jan Dreier, Henri Lotze, Peter Rossmanith
Hard Problems on Random Graphs. ICALP (2020)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. APPROX-RANDOM (2020)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
First-Order Model-Checking in Random Graphs and Complex Networks. ESA (2020)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
First-Order Model-Checking in Random Graphs and Complex Networks. CoRR (2020)
Jan Dreier, Peter Rossmanith
Approximate Evaluation of First-Order Counting Queries. CoRR (2020)
Hans-Joachim Böckenhauer, Jan Dreier, Fabian Frei, Peter Rossmanith
Advice for Online Knapsack With Removable Items. CoRR (2020)
Jan Dreier, Peter Rossmanith
Hardness of FO Model-Checking on Random Graphs. IPEC (2019)
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
The Complexity of Packing Edge-Disjoint Paths. CoRR (2019)
Jan Dreier, Peter Rossmanith
Motif Counting in Preferential Attachment Graphs. FSTTCS (2019)
Jan Dreier, Janosch Fuchs, Tim A. Hartmann, Philipp Kuinke, Peter Rossmanith, Bjoern Tauer, Hung-Lung Wang
The Complexity of Packing Edge-Disjoint Paths. IPEC (2019)
Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. SOFSEM (2018)
Jan Dreier, Philipp Kuinke, Peter Rossmanith
The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness. CoRR (2018)
Jan Dreier, Philipp Kuinke, Ba Le Xuan, Peter Rossmanith
Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application. CoRR (2017)
Jan Dreier, Philipp Kuinke, Rafael Przybylski, Felix Reidl, Peter Rossmanith, Somnath Sikdar
Overlapping Communities in Social Networks. CoRR (2014)
Jan Dreier
Overlapping Communities in Complex Networks. CoRR (2014)