1. Elementary first-order model checking for sparse graphs;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
3. Expressive Completeness of Two-Variable First-Order Logic with Counting for First-Order Logic Queries on Rooted Unranked Trees;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. Beyond FO Within SO;Intelligent Systems Reference Library;2023
5. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL;ACM Transactions on Computation Theory;2022-12-31