Home

Publications

Journal Articles

(with Marcin Wrochna and Standa Zivny) Pliability and Approximating Max-CSPs
Journal of the ACM, 2023 [arXiv]

(with Felipe Quezada, Cristóbal Navarro and Cristhian Aguilera) Modeling GPU Dynamic Parallelism for Self Similar Density Workloads
Future Generation Computer Systems 145, 2023 [arXiv]

(with Michael Benedikt, Stanislav Kikot and Piotr Ostropolski-Nalewaja) On monotonic determinacy and rewritability for recursive queries and views
ACM Transactions on Computational Logic 24(2), 2023 [arXiv]

(with Clement Carbonnel and Standa Zivny) The Complexity of General-Valued CSPs Seen from the Other Side
SIAM Journal on Computing 51(1), 2022 [arXiv]

(with Clement Carbonnel and Standa Zivny) Point-width and Max-CSPs
ACM Transactions on Algorithms 16(4), 2020 [arXiv]

(with Pablo Barceló and Thomas Zeume) A more general theory of static approximations for conjunctive queries
Theory of Computing Systems 64(5), 2019 [arXiv]

(with Pablo Barceló and Andreas Pieris) Semantic optimization in tractable classes of conjunctive queries
ACM SIGMOD Record 46(2), 2017

(with Juan L. Reutter and Moshe Y. Vardi) Regular queries on graph databases
Theory of Computing Systems 61(1), 2017

(with Pablo Barceló and Moshe Y. Vardi) Semantic acyclicity of graph databases
SIAM Journal on Computing 45(4), 2016

(with Pablo Barceló and Leonid Libkin) Efficient approximations of conjunctive queries
SIAM Journal on Computing 43(3), 2014

Conference Papers

(with Xingyue Huang, Ismail Ilkan Ceylan, Pablo Barceló) A Theory of Link Prediction via Relational Weisfeiler-Leman
Neural Information Processing Systems (NeurIPS 2023) [arXiv]

(with Diego Figueira) Conjunctive Regular Path Queries under Injective Semantics
ACM Symposium on Principles of Database Systems (PODS 2023) [arXiv]

(with Pablo Barceló, Michael Galkin, Christopher Morris) Weisfeiler and Leman Go Relational
Learning on Graphs Conference (LoG 2022) [arXiv]

(with Marcelo Arenas, Pablo Barceló and Bernardo Subercaseaux) On Computing Probabilistic Explanations for Decision Trees
Neural Information Processing Systems (NeurIPS 2022) [arXiv]

(with Marcin Wrochna and Standa Zivny) Treewidth-Pliability and PTAS for Max-CSPs
ACM-SIAM Symposium on Discrete Algorithms (SODA 2021) [arXiv]

(with Michael Benedikt, Stanislav Kikot and Piotr Ostropolski-Nalewaja) On monotonic determinacy and rewritability for recursive queries and views
ACM Symposium on Principles of Database Systems (PODS 2020) [arXiv]

(with Pablo Barceló and Diego Figueira) Boundedness of Conjunctive Regular Path Queries
International Colloquium on Automata, Languages and Programming (ICALP 2019) [arXiv]

(with Clement Carbonnel and Standa Zivny) Point-width and Max-CSPs
ACM/IEEE Symposium on Logic in Computer Science (LICS 2019) [arXiv]

(with Clement Carbonnel and Standa Zivny) The complexity of general-valued CSPs seen from the other side
IEEE Symposium on Foundations of Computer Science (FOCS 2018) [arXiv]

The tractability frontier of well-designed SPARQL queries
ACM Symposium on Principles of Database Systems (PODS 2018) [arXiv]

(with Pablo Barceló and Thomas Zeume) A more general theory of static approximations for conjunctive queries
International Conference on Database Theory (ICDT 2018) [arXiv]

(with Pablo Barceló and Moshe Y. Vardi) The homomorphism problem for regular graph patterns
ACM/IEEE Symposium on Logic in Computer Science (LICS 2017)

(with Pablo Barceló) The complexity of reverse engineering problems for conjunctive queries
International Conference on Database Theory (ICDT 2017) [arXiv]

(with Egor V. Kostylev, Juan L. Reutter and Domagoj Vrgoč) SPARQL with property paths
International Semantic Web Conference (ISWC 2015)

(with Juan L. Reutter and Moshe Y. Vardi) Regular queries on graph databases
International Conference on Database Theory (ICDT 2015)

(with Pablo Barceló and Moshe Y. Vardi) Does query evaluation tractability help query containment?
ACM Symposium on Principles of Database Systems (PODS 2014)

(with Pablo Barceló and Moshe Y. Vardi) Semantic acyclicity on graph databases
ACM Symposium on Principles of Database Systems (PODS 2013)

(with Pablo Barceló and Leonid Libkin) Efficient approximations of conjunctive queries
ACM Symposium on Principles of Database Systems (PODS 2012)

You can also see my dblp and Google Scholar

Home