2024W

• Algorithmic Meta-Theorems / 192.122 / VU
• Algorithmics / 186.814 / VU
• Bachelor Thesis in Computer Science / 186.819 / PR

• CSP beyond tractable constraint languages / Dreier, J., Ordyniak, S., & Szeider, S. (2023). CSP beyond tractable constraint languages. Constraints, 28(3), 450–471. https://doi.org/10.1007/s10601-023-09362-3
  Download: PDF (503 KB)
  Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024)
• Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond / Dreier, J., Mock, D., & Rossmanith, P. (2023). Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond. In 31st Annual European Symposium on Algorithms, ESA 2023. 31st Annual European Symposium on Algorithms (ESA 2023), Amsterdam, Netherlands (the). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2023.43
  Download: PDF (653 KB)
• Pseudorandom Finite Models / Dreier, J., & Tucker-Foltz, J. (2023). Pseudorandom Finite Models. In 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1–13). IEEE. https://doi.org/10.1109/LICS56636.2023.10175694
• Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes / Dreier, J., Mählmann, N., Siebertz, S., & Toruńczyk, S. (2023). Indiscernibles and Flatness in Monadically Stable and Monadically NIP Classes. In 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023). 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023), Paderborn, Germany. Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.125
  Download: PDF (864 KB)
• First-Order Model Checking on Structurally Sparse Graph Classes / Dreier, J., Mählmann, N., & Siebertz, S. (2023). First-Order Model Checking on Structurally Sparse Graph Classes. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 567–580). https://doi.org/10.1145/3564246.3585186
• A logic-based algorithmic meta-theorem for mim-width / Bergougnoux, B., Dreier, J., & Jaffke, L. (2023). A logic-based algorithmic meta-theorem for mim-width. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA23) (pp. 3282–3304). Society for Industrial and Applied Mathematics (SIAM). https://doi.org/10.1137/1.9781611977554.ch125
• Combinatorial and Algorithmic Aspects of Monadic Stability / Dreier, J., Mählmann, N., Mouawad, A., Siebertz, S., & Vigny, A. (2022). Combinatorial and Algorithmic Aspects of Monadic Stability. In S. W. Bae & H. Park (Eds.), 33rd International Symposium on Algorithms and Computation (ISAAC 2022) (pp. 1–17). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ISAAC.2022.11
  Download: PDF (868 KB)
• SAT Backdoors: Depth Beats Size / Dreier, J., Ordyniak, S., & Szeider, S. (2022). SAT Backdoors: Depth Beats Size. In 30th Annual European Symposium on Algorithms (ESA 2022) (pp. 1–18). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2022.46
  Download: PDF (829 KB)
  Projects: REVEAL-AI (2020–2024) / SLIM (2019–2024)
• Treelike Decompositions for Transductions of Sparse Graphs / Dreier, J., Gajarský, J., Kiefer, S., Pilipczuk, M., & Toruńczyk, S. (2022). Treelike Decompositions for Transductions of Sparse Graphs. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. Thirty-Seventh Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Haifa, Israel. Association for Computing Machinery, Inc. https://doi.org/10.1145/3531130.3533349
  Download: PDF (987 KB)
• Model Checking on Interpretations of Classes of Bounded Local Cliquewidth / Bonnet, É., Dreier, J., Gajarský, J., Kreutzer, S., Mählmann, N., Simon, P., & Toruńczyk, S. (2022). Model Checking on Interpretations of Classes of Bounded Local Cliquewidth. In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (pp. 1–13). The Association for Computing Machinery. https://doi.org/10.1145/3531130.3533367
• CSP Beyond Tractable Constraint Languages / Dreier, J., Ordyniak, S., & Szeider, S. (2022). CSP Beyond Tractable Constraint Languages. In C. Solnon (Ed.), 28th International Conference on Principles and Practice of Constraint Programming (pp. 1–17). Schloss Dagstuhl, Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CP.2022.20
  Download: PDF (681 KB)
• Twin-width and generalized coloring numbers / Dreier, J., Gajarský, J., Jiang, Y., Ossona de Mendez, P., & Raymond, J.-F. (2022). Twin-width and generalized coloring numbers. Discrete Mathematics, 345(3), Article 112746. https://doi.org/10.1016/j.disc.2021.112746
• Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes / Dreier, J. (2021). Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes. In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS 2021 - Symposium on Logic in Computer Science, Unknown. https://doi.org/10.1109/lics52264.2021.9470680
• Approximate Evaluation of First-Order Counting Queries / Dreier, J., & Rossmanith, P. (2021). Approximate Evaluation of First-Order Counting Queries. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 1720–1739). https://doi.org/10.1137/1.9781611976465.104