| A logic-based algorithmic meta-theorem for mim-width B Bergougnoux, J Dreier, L Jaffke Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023 | 22 | 2023 |
| Twin-width and generalized coloring numbers J Dreier, J Gajarský, Y Jiang, PO de Mendez, JF Raymond Discrete Mathematics 345 (3), 112746, 2022 | 22 | 2022 |
| First-order model checking on structurally sparse graph classes J Dreier, N Mählmann, S Siebertz Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 567-580, 2023 | 16 | 2023 |
| Model checking on interpretations of classes of bounded local cliquewidth É Bonnet, J Dreier, J Gajarský, S Kreutzer, N Mählmann, P Simon, ... Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 15 | 2022 |
| Indiscernibles and flatness in monadically stable and monadically NIP classes J Dreier, N Mählmann, S Siebertz, S Toruńczyk 50th International Colloquium on Automata, Languages, and Programming (ICALP …, 2023 | 11* | 2023 |
| Complexity of independency and cliquy trees K Casel, J Dreier, H Fernau, M Gobbert, P Kuinke, FS Villaamil, ... Discrete Applied Mathematics 272, 2-15, 2020 | 11 | 2020 |
| Lacon-, shrub-and parity-decompositions: Characterizing transductions of bounded expansion classes J Dreier Logical Methods in Computer Science 19, 2023 | 9* | 2023 |
| Treelike decompositions for transductions of sparse graphs J Dreier, J Gajarský, S Kiefer, M Pilipczuk, S Toruńczyk Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 9 | 2022 |
| First-order model checking on monadically stable graph classes J Dreier, I Eleftheriadis, N Mählmann, R McCarty, M Pilipczuk, ... arXiv preprint arXiv:2311.18740, 2023 | 7 | 2023 |
| Approximate evaluation of first-order counting queries J Dreier, P Rossmanith Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 7 | 2021 |
| Overlapping communities in social networks J Dreier, P Kuinke, R Przybylski, F Reidl, P Rossmanith, S Sikdar arXiv preprint arXiv:1412.4973, 2014 | 7 | 2014 |
| SAT backdoors: Depth beats size J Dreier, S Ordyniak, S Szeider arXiv preprint arXiv:2202.08326, 2022 | 6 | 2022 |
| Local structure theorems for erdős–rényi graphs and their algorithmic applications J Dreier, P Kuinke, BL Xuan, P Rossmanith SOFSEM 2018: Theory and Practice of Computer Science: 44th International …, 2018 | 6 | 2018 |
| CSP beyond tractable constraint languages J Dreier, S Ordyniak, S Szeider # PLACEHOLDER_PARENT_METADATA_VALUE# 235, 1-17, 2022 | 5 | 2022 |
| Advice for online knapsack with removable items HJ Böckenhauer, J Dreier, F Frei, P Rossmanith arXiv preprint arXiv:2005.01867, 2020 | 5 | 2020 |
| The complexity of packing edge-disjoint paths J Dreier, J Fuchs, TA Hartmann, P Kuinke, P Rossmanith, B Tauer, ... arXiv preprint arXiv:1910.00440, 2019 | 5 | 2019 |
| Motif counting in preferential attachment graphs J Dreier, P Rossmanith 39th IARCS Annual Conference on Foundations of Software Technology and …, 2019 | 4 | 2019 |
| First-order model-checking in random graphs and complex networks J Dreier, P Kuinke, P Rossmanith arXiv preprint arXiv:2006.14488, 2020 | 3 | 2020 |
| Maximum shallow clique minors in preferential attachment graphs have polylogarithmic size J Dreier, P Kuinke, P Rossmanith Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020 | 3 | 2020 |
| Hardness of FO model-checking on random graphs J Dreier, P Rossmanith 14th International Symposium on Parameterized and Exact Computation (IPEC 2019), 2019 | 3 | 2019 |
