Jan Dreier
Orcid: 0000-0002-2662-5303
According to our database1,
Jan Dreier
authored at least 32 papers
between 2014 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Corrigendum to "Twin-width and generalized coloring numbers" [Discrete Math. 345 (3) (2022) 112746].
Discret. Math., January, 2024
Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
2023
Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes.
Log. Methods Comput. Sci., 2023
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023
Evaluating Restricted First-Order Counting Properties on Nowhere Dense Classes and Beyond.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023
2022
CoRR, 2022
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022
2021
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021
Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021
2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
Proceedings of the 28th Annual European Symposium on Algorithms, 2020
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size.
Proceedings of the Approximation, 2020
2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019
Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019
2018
CoRR, 2018
Proceedings of the SOFSEM 2018: Theory and Practice of Computer Science - 44th International Conference on Current Trends in Theory and Practice of Computer Science, Krems, Austria, January 29, 2018
2017
CoRR, 2017
2014