Overlapping Communities in Complex Networks. - Jan Dreier (CoRR, 2014)

Overlapping Communities in Social Networks. - Jan Dreier; Philipp Kuinke; Rafael Przybylski; Felix Reidl; Peter Rossmanith; Somnath Sikdar (CoRR, 2014)

Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application. - Jan Dreier; Philipp Kuinke; Ba Le Xuan; Peter Rossmanith (CoRR, 2017)

Local Structure Theorems for Erdős-Rényi Graphs and Their Algorithmic Applications. - Jan Dreier; Philipp Kuinke; Ba Le Xuan; Peter Rossmanith (SOFSEM, 2018)

The Fine Structure of Preferential Attachment Graphs I: Somewhere-Denseness. - Jan Dreier; Philipp Kuinke; Peter Rossmanith (CoRR, 2018)

Motif Counting in Preferential Attachment Graphs. - Jan Dreier; Peter Rossmanith (FSTTCS, 2019)

The Complexity of Packing Edge-Disjoint Paths. - Jan Dreier; Janosch Fuchs; Tim A. Hartmann; Philipp Kuinke; Peter Rossmanith; Bjoern Tauer; Hung-Lung Wang (IPEC, 2019)

Hardness of FO Model-Checking on Random Graphs. - Jan Dreier; Peter Rossmanith (IPEC, 2019)

Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size. - Jan Dreier; Philipp Kuinke; Peter Rossmanith (APPROX-RANDOM, 2020)

First-Order Model-Checking in Random Graphs and Complex Networks. - Jan Dreier; Philipp Kuinke; Peter Rossmanith (ESA, 2020)

Hard Problems on Random Graphs. - Jan Dreier; Henri Lotze; Peter Rossmanith (ICALP, 2020)

Advice for Online Knapsack With Removable Items. - Hans-Joachim Böckenhauer; Jan Dreier; Fabian Frei; Peter Rossmanith (CoRR, 2020)

Complexity of independency and cliquy trees. - Katrin Casel; Jan Dreier; Henning Fernau; Moritz Gobbert; Philipp Kuinke; Fernando Sánchez Villaamil; Markus L. Schmid; Erik Jan van Leeuwen (Discret. Appl. Math., 2020)

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. - Jan Dreier (LICS, 2021)

Approximate Evaluation of First-Order Counting Queries. - Jan Dreier; Peter Rossmanith (SODA, 2021)

Combinatorial and Algorithmic Aspects of Monadic Stability. - Jan Dreier; Nikolas Mählmann; Amer E. Mouawad; Sebastian Siebertz; Alexandre Vigny (ISAAC, 2022)

Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. - Édouard Bonnet; Jan Dreier; Jakub Gajarský; Stephan Kreutzer; Nikolas Mählmann; Pierre Simon; Szymon Torunczyk (LICS, 2022)

Treelike Decompositions for Transductions of Sparse Graphs. - Jan Dreier; Jakub Gajarský; Sandra Kiefer; Michal Pilipczuk; Szymon Torunczyk (LICS, 2022)

Indiscernibles and Wideness in Monadically Stable and Monadically NIP Classes. - Jan Dreier; Nikolas Mählmann; Sebastian Siebertz; Szymon Torunczyk (CoRR, 2022)

Twin-width and generalized coloring numbers. - Jan Dreier; Jakub Gajarský; Yiting Jiang; Patrice Ossona de Mendez; Jean-Florent Raymond (Discret. Math., 2022)

Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. - Jan Dreier; Daniel Mock; Peter Rossmanith (ESA, 2023)

Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. - Jan Dreier; Nikolas Mählmann; Sebastian Siebertz; Szymon Torunczyk (ICALP, 2023)

Pseudorandom Finite Models. - Jan Dreier; Jamie Tucker-Foltz (LICS, 2023)

A logic-based algorithmic meta-theorem for mim-width. - Benjamin Bergougnoux; Jan Dreier; Lars Jaffke (SODA, 2023)

First-Order Model Checking on Structurally Sparse Graph Classes. - Jan Dreier; Nikolas Mählmann; Sebastian Siebertz (STOC, 2023)

Approximate Evaluation of Quantitative Second Order Queries. - Jan Dreier; Robert Ganian; Thekla Hamm (CoRR, 2023)

Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes. - Jan Dreier (Log. Methods Comput. Sci., 2023)

CSP beyond tractable constraint languages. - Jan Dreier; Sebastian Ordyniak; Stefan Szeider (Constraints An Int. J., 2023)

First-Order Model Checking on Monadically Stable Graph Classes. - Jan Dreier; Ioannis Eleftheriadis; Nikolas Mählmann; Rose McCarty; Michal Pilipczuk; Szymon Torunczyk (FOCS, 2024)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes. - Jan Dreier; Nikolas Mählmann; Szymon Torunczyk (STOC, 2024)

SAT backdoors: Depth beats size. - Jan Dreier; Sebastian Ordyniak; Stefan Szeider (J. Comput. Syst. Sci., 2024)

Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746]. - Jan Dreier; Jakub Gajarský; Yiting Jiang; Patrice Ossona de Mendez; Jean-Florent Raymond (Discret. Math., 2024)

Merge-Width and First-Order Model Checking. - Jan Dreier; Szymon Torunczyk (STOC, 2025)